View Single Post
Old 2021-02-07, 15:28   #12
Happy5214
 
Happy5214's Avatar
 
"Alexander"
Nov 2008
The Alamo City

11358 Posts
Default

Quote:
Originally Posted by Kebbaj View Post
K.caldwel will not accept it, if you do not know how to factoring p-1 or p + 1 in the helper.

factoring p-1 is difficult for this small number:
2 * 7 * 3 * 1 * 5 * 2 * 7 * 1 * 11 * 1 * 13 * 1 * 17 * 1 * 19 * 1 * 31 * 1 * 61 * 1 * 163 * 1 * 181 * 1 * 433 * 1 * 2161 ** 8641 * 1 * 151201 * 84313972619 * 1163620706029 * ...
Did Prof. Caldwell tell you that was a requirement? There are several primes in that database with only an ECPP proof. There's an entire top 20 page of them.

I also ran a third or so of a t30 (ECM) on the cofactor of that number (which is nowhere near small for factorization, where 200 digits is huge for non-special forms), with no dice.
Happy5214 is offline