mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 702
Search took 0.10 seconds.
Search: Posts Made By: charybdis
Forum: NFS@Home 2022-05-20, 02:34
Replies: 138
Views: 15,551
Posted By charybdis
QUEUED AS 2_2694M 2,2694M from the...

QUEUED AS 2_2694M

2,2694M from the Cunningham project is a c204 ready for GNFS on 16e-small. Thanks to Gimarel for finding the polynomial. 33/33 just about beats 33/34.

n:...
Forum: Msieve 2022-05-19, 18:47
Replies: 2,208
Views: 215,442
Posted By charybdis
Thank you! The second poly is the clear winner.

Thank you! The second poly is the clear winner.
Forum: NFS@Home 2022-05-19, 17:55
Replies: 1,922
Views: 179,421
Posted By charybdis
...but many other numbers would be completed 10...

...but many other numbers would be completed 10 weeks later in calendar time as a result. If this was some "high-priority" number - for example, if an original base-2 Cunningham had been knocked down...
Forum: NFS@Home 2022-05-19, 15:34
Replies: 1,922
Views: 179,421
Posted By charybdis
I think that must have been intended for smaller,...

I think that must have been intended for smaller, personal-size jobs. It breaks down well below GNFS-200; for example, it suggests GNFS-185 = SNFS-279, and having run both, I can tell you that...
Forum: NFS@Home 2022-05-19, 12:47
Replies: 1,922
Views: 179,421
Posted By charybdis
Firstly, I don't know where you got the idea that...

Firstly, I don't know where you got the idea that SNFS 311 is similar difficulty to GNFS 203; that would be a ratio of 0.65 rather than the more normal 0.68-0.69. Secondly, this isn't SNFS 311, it's...
Forum: Factoring 2022-05-12, 23:55
Replies: 17
Views: 679
Posted By charybdis
A030299 will produce more cubes because the...

A030299 will produce more cubes because the "carrying" ensures that the numbers are smaller and thus more likely to be cubes. Adding two digits on instead of one each time we add a number to the...
Forum: Factoring 2022-05-12, 23:46
Replies: 17
Views: 679
Posted By charybdis
Agreed. My point is that these unknown...

Agreed. My point is that these unknown constraints are extremely unlikely to exist. Off the top of my head, I can't think of a single example of a problem like this where the "correct" heuristic...
Forum: Factoring 2022-05-12, 22:48
Replies: 17
Views: 679
Posted By charybdis
I never intended my argument to be a proof, and...

I never intended my argument to be a proof, and there isn't any way to turn it into one.

Anyway, you ask about whether it's safe to assume that our permutations have the same chance of being cubes...
Forum: Factoring 2022-05-12, 10:54
Replies: 17
Views: 679
Posted By charybdis
Your conjecture is almost certainly false, but we...

Your conjecture is almost certainly false, but we don't have enough computing power to find a counterexample.

Consider permutations of the numbers from 1 to 43. The digit sum is 1 mod 9, so such a...
Forum: Miscellaneous Math 2022-05-03, 03:35
Replies: 29
Views: 1,043
Posted By charybdis
Doesn't look very prime to me, it has two 7-digit...

Doesn't look very prime to me, it has two 7-digit factors:
gp > forprime(p=2,10^7,if(Mod(2,p)^3486784401+3486784401==0,print(p)))
1454521
4965049
Forum: Miscellaneous Math 2022-05-03, 00:36
Replies: 4
Views: 149
Posted By charybdis
Your instincts are good. It's total nonsense....

Your instincts are good. It's total nonsense. There are many, many red flags before you even start reading the "proof".
Forum: CADO-NFS 2022-04-27, 20:22
Replies: 8
Views: 400
Posted By charybdis
Yeah, quartics tend to run substantially faster...

Yeah, quartics tend to run substantially faster than their score would suggest when compared to higher degree polys. But when the score is about the same as the record for 194-digit GNFS, that isn't...
Forum: CADO-NFS 2022-04-27, 01:30
Replies: 8
Views: 400
Posted By charybdis
Curtis has answered question 1, so I'll answer...

Curtis has answered question 1, so I'll answer question 2:



The quartic polynomial for this number arises because the exponent 290 is divisible by 5, and so 11^290+9^290 has an algebraic factor...
Forum: CADO-NFS 2022-04-26, 03:08
Replies: 8
Views: 400
Posted By charybdis
Are you aware of the scale of this job? This is a...

Are you aware of the scale of this job? This is a quartic of difficulty 241. I would guess it is roughly comparable to an "ordinary" SNFS (i.e. a sextic) of difficulty in the high 270s, or GNFS...
Forum: Msieve 2022-04-25, 17:36
Replies: 2,208
Views: 215,442
Posted By charybdis
Together with whatever Sam has run, that's...

Together with whatever Sam has run, that's probably enough ECM for the c202. The c204s can have some more while we wait for polynomials. Thanks Ryan!
Forum: CADO-NFS 2022-04-25, 17:34
Replies: 58
Views: 3,003
Posted By charybdis
A=28 should probably have a slightly lower qmin -...

A=28 should probably have a slightly lower qmin - maybe 7M? - as you'll be sieving a smaller range of Q. We'll see what Curtis says.
Forum: NFS@Home 2022-04-24, 20:27
Replies: 138
Views: 15,551
Posted By charybdis
QUEUED AS 2_2822M 2,2822M c202 from the...

QUEUED AS 2_2822M

2,2822M c202 from the Cunningham project is a GNFS candidate for 16e-small. Thanks to Gimarel for finding the polynomial.

n:...
Forum: Msieve 2022-04-24, 14:14
Replies: 2,208
Views: 215,442
Posted By charybdis
Thanks guys! Managed to compile v5-16e, now...

Thanks guys! Managed to compile v5-16e, now test-sieving.
Forum: CADO-NFS 2022-04-24, 01:21
Replies: 58
Views: 3,003
Posted By charybdis
Unfortunately I don't think that's something you...

Unfortunately I don't think that's something you can figure out by test-sieving, because A=28 should have a lower duplication rate. The crossover point for "time to find rels_wanted raw relations" is...
Forum: Msieve 2022-04-22, 22:34
Replies: 2,208
Views: 215,442
Posted By charybdis
Poly looks good enough to me. As I suggested this...

Poly looks good enough to me. As I suggested this number I'm happy to test-sieve it, as long as someone points me to the correct version of the 16e binary that's used by NFS@Home.
Forum: CADO-NFS 2022-04-22, 10:51
Replies: 58
Views: 3,003
Posted By charybdis
Haven't done any big GNFS jobs myself for a...

Haven't done any big GNFS jobs myself for a while, but larger lims on the 2LP side definitely sieve better for the big SNFS jobs I've been doing instead. I think we used larger lims on the 2LP side...
Forum: CADO-NFS 2022-04-22, 02:05
Replies: 58
Views: 3,003
Posted By charybdis
Are you sure that swapping the lims won't improve...

Are you sure that swapping the lims won't improve yield? I thought larger lim on the 2LP side was pretty well established by now. Too lazy to dig up an old polynomial and test-sieve it myself.
Forum: Information & Answers 2022-04-21, 16:27
Replies: 2
Views: 173
Posted By charybdis
Factors of 2^p-1 must be of the form 2kp+1, see...

Factors of 2^p-1 must be of the form 2kp+1, see here (https://primes.utm.edu/notes/proofs/MerDiv.html). Therefore for p=1277 there are over 200000 times as many potential factors between 2^67 and...
Forum: Factoring 2022-04-20, 23:36
Replies: 27
Views: 1,264
Posted By charybdis
Going straight to SNFS would look silly if, say,...

Going straight to SNFS would look silly if, say, a 52-digit factor turned up that could have been found by an average desktop in a week. Rules of thumb exist for a reason: the relevant one here is...
Forum: Factoring 2022-04-20, 21:25
Replies: 27
Views: 1,264
Posted By charybdis
I say keep going even if someone does want to run...

I say keep going even if someone does want to run GPU curves - nothing wrong with more than one person running ECM! Just make sure you move up to the t55 level.
Showing results 1 to 25 of 702

 
All times are UTC. The time now is 15:38.


Mon May 23 15:38:20 UTC 2022 up 39 days, 13:39, 1 user, load averages: 1.73, 1.60, 1.73

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.

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