|
2021-12-22, 13:59
|
#1 |
|
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 | |
Feb 2017
Nowhere
2·2,917 Posts |
Quote:
|
|
|
|
|
2021-12-22, 14:11
|
#3 |
|
Jun 2021
5010 Posts |
Ok. Thank You.
I won't even ask why |
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Possible extension to P-1 Stage 2 | JuanTutors | Math | 4 | 2021-06-17 19:00 |
| Extension request | LaurV | Data | 9 | 2019-04-14 00:13 |
| PCI-E USB 3.0 Extension Cable | vsuite | GPU Computing | 7 | 2017-07-10 20:45 |
| Hanging reservations and table extension | ET_ | Operation Billion Digits | 5 | 2012-06-12 08:48 |
| brent suyama extension in P-1 | bsquared | Factoring | 9 | 2007-05-18 19:24 |
