Because it's not your own prime. Find your own, not the discoveries of others.

Submissions: 14406 * 127^4520 + 1 (9514 digits)


Primality testing 14406*127^4520+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using zero-padded FFT length 4K on 14406*127^4520+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.96%
14406*127^4520+1 is prime! (2.3057s+0.0011s)

I'll have some more one a prime is found for k * 7^14980 + 1.

[QUOTE=Merfighters;232195]10^10^1749.6572163922 :smile:[/QUOTE]

Impossible.

[QUOTE=science_man_88;232281](2^86225218-1)/2^43112609[/QUOTE]

(2^86225218-1)/2^43112609 is not an integer
2^86225218-1=(2^43112609-1)*(2^43112609+1)
(2^86225218-1)/(2^43112609-1)=2^43112609+1
(2^86225218-1)/(2^43112609+1)=2^43112609-1

In any case, you're just restating a known prime in a slightly different way, not discovering a new one.

Well, at least he tried.. And failed miserably.

Prime found: (88087017938663222*p(1280)#^2+1)/86303268783527 (9008 digits)

Submissions: 157648*1999^6375+1 (21048 digits)

Verification:

Primality testing 157648*1999^6375+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using zero-padded FFT length 12K on 157648*1999^6375+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.98%
157648*1999^6375+1 is prime! (17.3056s+0.0015s)

[QUOTE=3.14159;232285](Merfighters: 10^10^1749.6572163922)

Impossible.[/QUOTE]

No, it's possible. I used this: [URL]http://www.mrob.com/pub/perl/hypercalc.txt[/URL]

Just the bad thing is that I can't change the scale(number of digits showing) on strawberry perl... :blush:
(Maybe I'll try with cygwin.)

Submissions: 290220*88^5520+1 (10740 digits)

Verification:


Primality testing 290220*88^5520+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 17
Special modular reduction using zero-padded FFT length 5K on 290220*88^5520+1
Calling Brillhart-Lehmer-Selfridge with factored part 53.53%
290220*88^5520+1 is prime! (3.6586s+0.0008s)

Prime found, cofactor entry: (515492527*106^2880+1)/252001 (5837 digits)

Submissions: 125892*1999^7650+1 (25257 digits)

Verification:

Primality testing 125892*1999^7650+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Special modular reduction using zero-padded FFT length 14K on 125892*1999^7650+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.98%
125892*1999^7650+1 is prime! (25.4010s+0.0021s)

I remember a conjecture that reads:

"There is always a prime number between an integer n and its double."

(Of course, when n > 1.)

Ex: 60.

Primes below 60 and 120: 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113.

Has this been proven?

Let's try n = 34073765446047729983193493020444568565003100171596087473591023330183990000166368.

Results: [code]34073765446047729983193493020444568565003100171596087473591023330183990000166471
34073765446047729983193493020444568565003100171596087473591023330183990000166517
34073765446047729983193493020444568565003100171596087473591023330183990000166633
34073765446047729983193493020444568565003100171596087473591023330183990000167269
34073765446047729983193493020444568565003100171596087473591023330183990000167317
34073765446047729983193493020444568565003100171596087473591023330183990000167323
34073765446047729983193493020444568565003100171596087473591023330183990000167521
34073765446047729983193493020444568565003100171596087473591023330183990000167633
34073765446047729983193493020444568565003100171596087473591023330183990000167701
34073765446047729983193493020444568565003100171596087473591023330183990000168143
34073765446047729983193493020444568565003100171596087473591023330183990000168151
34073765446047729983193493020444568565003100171596087473591023330183990000168371
34073765446047729983193493020444568565003100171596087473591023330183990000168463
34073765446047729983193493020444568565003100171596087473591023330183990000168659
34073765446047729983193493020444568565003100171596087473591023330183990000168887
34073765446047729983193493020444568565003100171596087473591023330183990000169033
34073765446047729983193493020444568565003100171596087473591023330183990000169069
34073765446047729983193493020444568565003100171596087473591023330183990000169421
34073765446047729983193493020444568565003100171596087473591023330183990000169813
34073765446047729983193493020444568565003100171596087473591023330183990000169937
34073765446047729983193493020444568565003100171596087473591023330183990000170009
34073765446047729983193493020444568565003100171596087473591023330183990000170447
34073765446047729983193493020444568565003100171596087473591023330183990000170503
34073765446047729983193493020444568565003100171596087473591023330183990000170609
34073765446047729983193493020444568565003100171596087473591023330183990000170681
34073765446047729983193493020444568565003100171596087473591023330183990000170753[/code]