20201111, 04:46  #23  
"Rashid Naimi"
Oct 2015
Remote to Here/There
7×283 Posts 
Quote:
Just claimed last week. Winning the lottery is one thing winning $70M on 1st try is something completely different. Quote:


20201111, 07:47  #24 
Nov 2016
2^{2}×691 Posts 
If F33 is prime, then this prime will prove the generalized Sierpinski conjecture base 32, since F33 = 4*32^1717986918+1

20201111, 08:56  #25 
Romulan Interpreter
Jun 2011
Thailand
3·11·277 Posts 
Haha, isn't that "looking a bit too high"? (but yea, it will...) 
20201111, 10:11  #26 
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,501 Posts 

20201111, 17:19  #27  
6809 > 6502
"""""""""""""""""""
Aug 2003
101Γ103 Posts
10001111101000_{2} Posts 
Quote:
Last fiddled with by Uncwilly on 20201111 at 17:19 

20201112, 00:54  #28 
Feb 2017
Nowhere
23·181 Posts 

20201112, 01:17  #29 
Feb 2019
China
59_{10} Posts 
http://numbers.computation.free.fr/C...splitting.html
In mathematics, binary splitting is a technique for speeding up numerical evaluation of many types of series with rational terms. In particular, it can be used to evaluate hypergeometric series at rational points. but I can not understand this algorithm very well 
20201112, 01:55  #30 
Feb 2019
China
59 Posts 

20201112, 02:52  #31 
"Curtis"
Feb 2005
Riverside, CA
4608_{10} Posts 
Lucky for you, you don't need to understand the algorithm itself in order to accept that an iteration of one algorithm can clearly take a lot longer than one iteration of another algorithm. The software that runs these algorithms is freely available you can run it yourself to see how long each iteration takes on each program, as well as how iteration length scales with the size of the input. None of that selfteaching requires you to understand the algorithms, nor to understand how they're coded into software.
It's ok for some math to be over your head. It's less ok for you to notify us that it's over your head in a way that suggests you expect the forum to teach it all to you. 
20201112, 03:02  #32  
Romulan Interpreter
Jun 2011
Thailand
3·11·277 Posts 
Quote:
I know there is an infinite number of primes, but they must be all smaller than F33, because we don't know any bigger...:P:P Last fiddled with by LaurV on 20201112 at 03:06 Reason: s/:razz:/:P:P/g (didn't realize it gave up the Raman text) 

20201112, 03:27  #33 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2×3^{4}×37 Posts 
