mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Closed Thread
 
Thread Tools
Old 2021-12-22, 13:59   #1
RomanM
 
Jun 2021

2·52 Posts
Default 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?
RomanM is offline  
Old 2021-12-22, 14:06   #2
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

22·1,459 Posts
Default

Quote:
Originally Posted by RomanM View Post
<snip>
How do You think, Is this idea viable or not?
Not.
Dr Sardonicus is offline  
Old 2021-12-22, 14:11   #3
RomanM
 
Jun 2021

2·52 Posts
Default

Ok. Thank You.
I won't even ask why
RomanM is offline  
Closed Thread

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

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

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔