^{74,207,281}-1). Mersenne primes are a group of prime numbers of the form 2

^{n}-1 where n is is assumed to be prime. This is a fascinating find. Prime numbers are the "building blocks" of all other numbers. Their unique nature has led many number theorists and math enthusiasts to study them in great detail. Although they are used heavily in cryptography, the latest find is far too large to be used in any encryption schemes to date. But as computation theory evolves and computer architectures become more sophisticated these extremely large primes may find their place.

## No comments:

## Post a Comment