PRP for F33?

[a1call]

Originally Posted by VBCurtis

By this logic, nobody ever wins the lottery. You can't be serious.

Just claimed last week.
Winning the lottery is one thing winning $70M on 1st try is something completely different.

MONTREAL -- A Montrealer who decided to play the lottery for the first time ever in October is the lucky winner of the latest $70 million Lotto Max jackpot.

https://beta.ctvnews.ca/local/montre...1_5177970.html

[sweety439]

If F33 is prime, then this prime will prove the generalized Sierpinski conjecture base 32, since F33 = 4*32^1717986918+1

[LaurV]

Haha, isn't that "looking a bit too high"? (but yea, it will...)

[xilman]

Originally Posted by bbb120

what does binary splitting mean?
can you give more information about binary splitting ?

[Uncwilly]

Originally Posted by bbb120

what does binary splitting mean?
can you give more information about binary splitting ?

https://www.lmgtfy.app/#gsc.tab=0&gs...y%20splitting"

[Dr Sardonicus]

Originally Posted by bbb120

according to prime number theorem , the probability of F33 is a prime only has
1/(2^33*log(2))=3.86723328252e-10, so it must be a composite number !

By the same "reasoning," all numbers larger than F₃₃ also must be composite.

[bbb120]

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

[bbb120]

Originally Posted by xilman

you don't know Google and Wikipedia and Twitter and Facebook and YouTube
can not be used in some country

[VBCurtis]

Originally Posted by bbb120

but I can not understand this algorithm very well

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 self-teaching 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.

[LaurV]

Originally Posted by Dr Sardonicus

By the same "reasoning," all numbers larger than F₃₃ also must be composite.

Aren't they? Show me a prime larger than F33...
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

[retina]

Originally Posted by LaurV

Show me a prime larger than F33...

MM127

Now please, someone, prove me wrong and find a factor of that retched thing.