mersenneforum.org An extension of NFS
 Register FAQ Search Today's Posts Mark Forums Read

 2021-12-22, 13:59 #1 RomanM   Jun 2021 2·52 Posts An extension of NFS Hi. Both QS and NFS stuck with famouse A^2==B^2 mod p. If we look on the A^3==B^3 mod p that do the split also (30% vs 50% for quadratic) and in general to A^n==B^n*m & B^m=y mod p?? (1) as a result, for n*m=2*3*5*7*11... the amount of (1) grow outstanding fast. It is necessary to assess and verify the possibility of applying this approach. QS is not good i.e. (A+t)^n-p>>sqrt(p) for n>2 so this lead us to huge FB, long sieve and as result - very very tiny number of smoth numbers. NFS in spite of this sieve the Linear (!!!) things ((a-b*m)&&(a-b*θ)), and sieve for different n*m is nor do not impossible, but likely not super hard. LA will be harder, complicated and interesting, thought Root of polynomial, root of m degree, m>=2. We have a problem here... How do You think, Is this idea viable or not?
2021-12-22, 14:06   #2
Dr Sardonicus

Feb 2017
Nowhere

22·1,459 Posts

Quote:
 Originally Posted by RomanM How do You think, Is this idea viable or not?
Not.

 2021-12-22, 14:11 #3 RomanM   Jun 2021 2·52 Posts Ok. Thank You. I won't even ask why

 Similar Threads Thread Thread Starter Forum Replies Last Post JuanTutors Math 4 2021-06-17 19:00 LaurV Data 9 2019-04-14 00:13 vsuite GPU Computing 7 2017-07-10 20:45 ET_ Operation Billion Digits 5 2012-06-12 08:48 bsquared Factoring 9 2007-05-18 19:24

All times are UTC. The time now is 19:56.

Tue Jul 5 19:56:26 UTC 2022 up 82 days, 17:57, 1 user, load averages: 1.36, 1.24, 1.23