mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > NFSNET Discussion

 
 
Thread Tools
Old 2007-10-11, 14:54   #1
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

52×13×23 Posts
Default Interesting Question

Consider 2,980+ C162

We could do this via SNFS with a sextic; dividing out 2^140 + 1; giving
an 840 bit number to do.

Ow we could do it with a quartic; dividing out 2^196 + 1; giving a 784 bit
number to do.

Or we could do the C162 with GNFS.

I see no way to take advantage of both agebraic factors. The degree is
too high.

Any bets as to which is easiest? I would guess the C162 with GNFS.
R.D. Silverman is offline  
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Interesting question from the arxiv fivemack Other Mathematical Topics 4 2014-10-11 06:46
Interesting hypothetical question. Uncwilly Lounge 21 2014-01-20 10:26
Interesting Question R.D. Silverman Cunningham Tables 12 2010-02-21 02:06
Interesting contest... Xyzzy Programming 0 2004-05-20 12:52
Something Interesting clowns789 Hardware 1 2003-12-20 12:36

All times are UTC. The time now is 18:31.


Wed Sep 28 18:31:10 UTC 2022 up 41 days, 15:59, 2 users, load averages: 2.87, 2.46, 1.83

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.

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