.comment-link {margin-left:.6em;}


Wednesday, January 25, 2006

New Prime Number

Great Internet Mersenne Prime Search (GIMPS) is a distributed computing project. It is like the SETI (Search for Extraterrestrial Intelligence) project that uses Internet-connected computers in search of extra-terrestrials, but GIMPS does the same for the discovery of new prime numbers that are divisible only by the number 1 and itself.

Last month a computing team led by Curtis Cooper and Steven Boone, as part of the GIMPS project, discovered the largest known prime number, 2^(30,402,457)-1 [To be read as 'one less than the number which is 2 to the power of 30,402,457].

The discovery is marked as the 43rd known Mersenne prime which is a prime number that is one less than a prime power of two. For example, 31 (a prime number) = 32 − 1 = 2^5 − 1. It was the 9th prime number discovered by GIMPS by running a program Prime95 that can be freely downloaded from GIMPS's website.

Sunday, January 08, 2006

Mark 8 : NAG C Library

The NAG C Library is the largest and most comprehensive collection of mathematical and statistical algorithms for C and C++ programmers. It contains over 1000 functions covering a wide range of topics. The NAG C Library functions are available on a wide range of systems commonly used for technical computing.

Recently NAG announced the launch of Mark 8 of the NAG C Library. Extensive new functionalities are added to the NAG C Library at the latest release and it will be available for 64-bit and 32-bit applications alike and feature compatibility with the latest compilers. It also extended the functionality of optimization routines.

For further information, visit: NAG's numerical Algorithm group.