-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem-097.py
More file actions
12 lines (9 loc) · 782 Bytes
/
problem-097.py
File metadata and controls
12 lines (9 loc) · 782 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
### Problem 97 - Large Non-Mersenne Prime
###-----------------------------------------------------------------------------------------------------------------------------------------------------------------------
### The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 26972593−1; it contains exactly 2,098,960 digits.
### Subsequently other Mersenne primes, of the form 2p−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.
### Solution
number = 28433 * pow(2, 7830457, 10 ** 10) + 1
print("The last ten digits are: " + str(number % 10 ** 10))