Created
March 11, 2012 05:31
-
-
Save larryv/2015153 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-- Project Euler, Problem 97 | |
-- | |
-- ========== | |
-- The first known prime found to exceed one million digits was discovered | |
-- in 1999, and is a Mersenne prime of the form 2^6972593 - 1; it contains | |
-- exactly 2,098,960 digits. Subsequently other Mersenne primes, of the | |
-- form 2^p - 1, have been found which contain more digits. | |
-- | |
-- However, in 2004 there was found a massive non-Mersenne prime which | |
-- contains 2,357,207 digits: 28433 * 2^7830457 + 1. | |
-- | |
-- Find the last ten digits of this prime number. | |
-- ========== | |
-- | |
-- Lawrence Velazquez | |
-- 13 June 2011 | |
main = print $ reverse . take 10 . reverse . show $ 28433 * 2 ^ 7830457 + 1 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment