- **Miscellaneous Math**
(*https://www.mersenneforum.org/forumdisplay.php?f=56*)

- - **An extension of NFS**
(*https://www.mersenneforum.org/showthread.php?t=27426*)

An extension of NFSHi.
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 [B]outstanding[/B] 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? |

[QUOTE=RomanM;595937]<snip>
How do You think, Is this idea viable or not?[/QUOTE] Not. |

Ok. Thank You.
I won't even ask why |

All times are UTC. The time now is 11:09. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.