mersenneforum.org  

Go Back   mersenneforum.org > Search Forums
Reload this Page Search Results
Register FAQ Search Today's Posts Mark Forums Read

Showing results 1 to 5 of 5
Search took 0.00 seconds. Search: Posts Made By: R.D. Silverman
Forum: NFSNET Discussion 2005-05-13, 10:56
Replies: 20
Views: 14,928
Posted By R.D. Silverman
Thumbs up They would be roughly equivalent. However, the...

They would be roughly equivalent. However, the cyclotomic poly would
have a higher density of small primes that split completely. This would
make norms slightly more likely to be smooth.
Forum: NFSNET Discussion 2005-05-12, 19:53
Replies: 20
Views: 14,928
Posted By R.D. Silverman
2^760 + 1 = x^5 + 1 with x = 2^152. But x^5+1...

2^760 + 1 = x^5 + 1 with x = 2^152. But x^5+1 =
(x+1)(x^4-x^3+x^2-x+1)

So just use x - M and x^4-x^3+x^2-x+1 with M = 2^152

It is best NOT to convert the reciprocal quartiic into a...
Forum: NFSNET Discussion 2005-05-12, 02:02
Replies: 20
Views: 14,928
Posted By R.D. Silverman
Question Actually, the *really* interesting question is...

Actually, the *really* interesting question is whether the number would be
faster with SNFS or GNFS. SNFS lets us take advantage of the algebraic
factor 2^152+1, but requires a quartic, which is...
Forum: NFSNET Discussion 2005-04-14, 17:49
Replies: 20
Views: 14,928
Posted By R.D. Silverman
Thumbs up I am all for that!!!! :banana: :bounce:

I am all for that!!!! :banana: :bounce:
Forum: NFSNET Discussion 2005-04-14, 15:15
Replies: 20
Views: 14,928
Posted By R.D. Silverman
Question What's next?

Hi,

What's next after 11,212+? May I suggest 7,253- and 11,217-? (both easy)
7,253- has been among the first 5 holes in any table for the longest period
of time. It first appeared as a 5th...
Showing results 1 to 5 of 5

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


Sat May 28 10:19:58 UTC 2022 up 44 days, 8:21, 0 users, load averages: 0.93, 1.12, 1.20

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.

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