Project Euler: Problem 97

By | 2. September 2013

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×27830457+1.
Find the last ten digits of this prime number.

BigInteger number1 = BigInteger.valueOf(28433);
BigInteger number2 = BigInteger.valueOf(2);
number2 = number2.modPow(new BigInteger("7830457"), new BigInteger("10000000000"));
number1 = number1.multiply(number2);
number1 = number1.mod(new BigInteger("10000000000"));
number1 = number1.add(BigInteger.ONE);
System.out.println(number1);

Lösung: 8739992577

Schreibe einen Kommentar

Deine E-Mail-Adresse wird nicht veröffentlicht. Erforderliche Felder sind mit * markiert.