mersenneforum.org - View Single Post - if p is prime, factors of 2^p-1?

VBCurtis · 2020-10-23, 02:30

We already have the speed. You don't. Your methods are slow, and reflect no comprehension of factoring.

You don't even grasp how long it would take to read primes from a text file, versus generate them live via code. You think reading a file is "instant". It's not, not even a little bit.

"I'm so ignorant I might be a genius" is a special sort of argument. We have a name for that flavor of ignorance, too.

2020-10-23, 02:30	#7
VBCurtis "Curtis" Feb 2005 Riverside, CA 5³·37 Posts	We already have the speed. You don't. Your methods are slow, and reflect no comprehension of factoring. You don't even grasp how long it would take to read primes from a text file, versus generate them live via code. You think reading a file is "instant". It's not, not even a little bit. "I'm so ignorant I might be a genius" is a special sort of argument. We have a name for that flavor of ignorance, too. Last fiddled with by VBCurtis on 2020-10-23 at 02:32