![]() |
![]() |
#34 |
Apr 2010
Over the rainbow
5×503 Posts |
![]()
Any factor of this would be the largest prime ever found.
|
![]() |
![]() |
![]() |
#35 |
"Curtis"
Feb 2005
Riverside, CA
460510 Posts |
![]()
Why is that? Factors would have form 2kp+1, where p is 2^127-1, right?
Last fiddled with by VBCurtis on 2020-11-12 at 07:00 Reason: k -> p |
![]() |
![]() |
![]() |
#36 | |
Romulan Interpreter
Jun 2011
Thailand
24×571 Posts |
![]() Quote:
Last fiddled with by LaurV on 2020-11-12 at 07:22 |
|
![]() |
![]() |
![]() |
#37 |
Apr 2010
Over the rainbow
251510 Posts |
![]()
My bad I made a mistake.
|
![]() |
![]() |
![]() |
#38 |
"Viliam Furík"
Jul 2018
Martin, Slovakia
5058 Posts |
![]() |
![]() |
![]() |
![]() |
#39 |
"Rashid Naimi"
Oct 2015
Remote to Here/There
1,979 Posts |
![]() Last fiddled with by a1call on 2020-11-12 at 12:46 |
![]() |
![]() |
![]() |
#40 | |
"Viliam Furík"
Jul 2018
Martin, Slovakia
52×13 Posts |
![]() Quote:
Calculus is calculus, other mathematics is other mathematics. |
|
![]() |
![]() |
![]() |
#41 |
Jun 2003
2×32×269 Posts |
![]() |
![]() |
![]() |
![]() |
#42 | |
Feb 2017
Nowhere
26×5×13 Posts |
![]() Quote:
1) The smallest prime exceeding F33; in Pari-GP notation, this could be expressed nextprime(2^(2^33)33 + 2) although Pari-GP only guarantees a value for which ispseudoprime() returns 1. Not a problem here. Bertrand's Postulate (which has of course been proven) guarantees the existence of a prime between F33 and 2*F33. 2) The smallest prime factor of F2^(2^34) - 2. |
|
![]() |
![]() |
![]() |
#43 |
Mar 2019
11·13 Posts |
![]()
We can at least write F33 as 2^8589934592+1, yes? That may at least help to illustrate just how much larger it is than the largest-known prime, 2^82589933-1.
|
![]() |
![]() |
![]() |
#44 | |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
9,181 Posts |
![]() Quote:
"binary splitting" algorithm or "binary splitting" algorithm explained Last fiddled with by Uncwilly on 2020-11-12 at 17:26 |
|
![]() |
![]() |