mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2017-05-04, 06:49   #1
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

33×113 Posts
Default Reserved for MF - Sequence 276

The intention of creating my pages at rieselprime.de 10 years ago was to collect data spreaded over the whole forum and display a condensed version of those information and to easily find all related stuff.

So for the old 15k-search project those days to say a special k-val was searched up to a given n-val, without looking dozens of post or thread in here.

As there're many projects working on such problems it's no managable anymore like I did a long time.

I saw the possibility of a Wiki software to give users the chance to update those page by themselves.
The problem is you have to know how to edit and that's in my opinion to many users reason enough not doing so.

The page at MersenneWiki is an example how this could be done more userfriendly without knowing much about the Wiki interna.

It would also help to collect and summarize information about users doing their own searches but haven't their own page to dislpay them.

For ALQs Zimmerman, Clavier and seqs reserved by others than yoyo could put their data in there, too, so things like 276 won't be missed then.

Whishful thinking I know, but the internet was started because someone had an idea to make work easier.
kar_bon is offline   Reply With Quote
Old 2017-05-04, 06:51   #2
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

283016 Posts
Default Sequence 276

As we used to say, every kick in the butt is a step ahead...

This is good opportunity for Ryan to step in...
LaurV is offline   Reply With Quote
Old 2017-05-04, 18:39   #3
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

22·3·5·11 Posts
Default

For the sequence 276, does it make sense to run ecm to 65 digits (B1=850M)?
yoyo is offline   Reply With Quote
Old 2017-05-04, 19:15   #4
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

7×829 Posts
Default

For a C201, I would run about 25% of a T65 at 850M, and then a couple thousand curves at 3e9 (say, 0.2T65 worth). I have no justification- that's merely what I would choose to acheive roughly half a T65.

I'd like to see what the Bayesian tool has to say!
VBCurtis is online now   Reply With Quote
Old 2017-05-04, 21:04   #5
swellman
 
swellman's Avatar
 
Jun 2012

32×443 Posts
Default

Quote:
Originally Posted by Dubslow View Post
I agree there's a lot of fragmentation, but unfortunately there's no real good solution.

Incidentally, do we the forum want to take on 276 (perhaps at the expense of 4788)? It should be mostly doable except for linear algebra. That would require significant resources that maybe not even Tom can bring to bear (even if he were willing).
Ryan took back 4788 in late March, though progress has slowed since.

I'm willing to help with AS276, though yoyo would be the logical player for ECM. Can this effort fit into the 15e siever? It's a daunting task!
swellman is online now   Reply With Quote
Old 2017-05-04, 22:48   #6
wombatman
I moo ablest echo power!
 
wombatman's Avatar
 
May 2013

26·29 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
For a C201, I would run about 25% of a T65 at 850M, and then a couple thousand curves at 3e9 (say, 0.2T65 worth). I have no justification- that's merely what I would choose to acheive roughly half a T65.

I'd like to see what the Bayesian tool has to say!
Bayesian gives the following, assuming 48000 curves at B1=260e6 (a t60):
Code:
 7900 curves with B1 =   2.9e9
Note that this assumes only 1 thread of ECM running, so it's going to underestimate somewhat, but that gives you some idea of what's optimal.
wombatman is offline   Reply With Quote
Old 2017-05-05, 12:49   #7
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

22·3·5·11 Posts
Default

I will run 20000 curves with B1=850M on it.
Don't know if this is sufficient?

I can run also much more, even on higher B1.
yoyo is offline   Reply With Quote
Old 2017-05-05, 14:27   #8
swellman
 
swellman's Avatar
 
Jun 2012

32×443 Posts
Default

As a suggestion, how about a total of 40000 curves @B1=85e7 and then 8000 curves @B1=29e8? It's probably a bit of overkill but should certainly provide proper due diligence in the preprocessing stage.

Thoughts?
swellman is online now   Reply With Quote
Old 2017-05-05, 16:51   #9
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

16AB16 Posts
Default

In the spirit of the Bayesian tool, I like doing effort similar to what you suggest, but with more at 29e8 and less at 85e7. How about 20k at 85e7 for now, then 10k (or 15k) at 29e8?

Some forumites can do some 29e8 curves while yoyo tackles the 85e7 set; or can his network do the big-bound curves too?

The CADO root-opt tools seem to take about a digit of difficulty off, compared to 2014-15 msieve. Scores have been 10-15% better than most msieve best-polys for each digit length above 160; if that holds at 200, that "free" digit should really help the matrix step.
VBCurtis is online now   Reply With Quote
Old 2017-05-05, 18:22   #10
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

22·3·5·11 Posts
Default

My Minion network can run also 29e8 on this C201.
yoyo is offline   Reply With Quote
Old 2017-05-05, 21:33   #11
swellman
 
swellman's Avatar
 
Jun 2012

76238 Posts
Default

Quote:
Originally Posted by yoyo View Post
My Minion network can run also 29e8 on this C201.
So 20000 curves @B1=85e7, followed by 10000 curves @B1=29e8. I like it.

Anyone else?
swellman is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Reserved for MF - Sequence 4788 schickel Aliquot Sequences 3158 2023-05-03 13:32
Reserved for MF - Sequence 3366 RichD Aliquot Sequences 559 2023-02-26 10:02
A new sequence devarajkandadai Miscellaneous Math 3 2020-12-01 22:08
Primes in n-fibonacci sequence and n-step fibonacci sequence sweety439 sweety439 17 2017-06-13 03:49
80M to 64 bits ... but not really reserved petrw1 Lone Mersenne Hunters 82 2010-01-11 01:57

All times are UTC. The time now is 01:51.


Sun Jun 4 01:51:42 UTC 2023 up 289 days, 23:20, 0 users, load averages: 1.09, 0.96, 0.89

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, 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.

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