mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2023-01-16, 01:53   #45
charybdis
 
charybdis's Avatar
 
Apr 2020

92910 Posts
Default

Quote:
Originally Posted by charybdis View Post
Invoking the "Assumption of Ignorance" would give a default answer of each of the p values of 2*k (mod p) being equally likely. Of course, this might also apply to (Mp - 1)/p (mod p). Choosing the value 0 (mod p) would then indicate that there "should" be about log(log(X)) (base-2) Wieferich primes up to X. However, the numerical data does not seem to support this. The largest known (base-2) Wieferich prime is 3511, and the search bound is at least of order 1015 and may be higher by now.
Why would the log log be to base 2? We're just summing 1/p, right?

The search limit is at least 2^64 now, but log log 2^64 = 3.79 so it's not that surprising we've only found 2.
charybdis is offline   Reply With Quote
Old 2023-01-16, 13:10   #46
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

23×19×41 Posts
Default

Quote:
Originally Posted by charybdis View Post
Why would the log log be to base 2? We're just summing 1/p, right?
I meant Wieferich primes to the base 2. Sorry I wasn't clear.
Quote:
The search limit is at least 2^64 now, but log log 2^64 = 3.79 so it's not that surprising we've only found 2.
You're right about the numerical evidence. It's sometimes hard to keep in mind how very slow-growing log(log(x)) really is.

I should have checked the value of log(log(10^15)) before posting.

I realized this some hours after I'd posted.
Dr Sardonicus is offline   Reply With Quote
Old 2023-01-19, 00:31   #47
Andrew Usher
 
Dec 2022

3548 Posts
Default

That unknown cofactor, M281903623, has now been taken to 2^80 and P-1 to mersenne.ca bounds, and is therefore ready for PRP should anyone care enough.
Andrew Usher is offline   Reply With Quote
Old 2023-01-19, 02:04   #48
alpertron
 
alpertron's Avatar
 
Aug 2002
Buenos Aires, Argentina

3×499 Posts
Default

I'm running P-1 on the cofactor with B1 = 10M, B2 = 300M. At this moment the computer is running step 1 which is 67.28% complete. At this rate, step 2 will start on Friday.
alpertron is offline   Reply With Quote
Old 2023-01-19, 23:33   #49
Andrew Usher
 
Dec 2022

22·59 Posts
Default

This is well beyond what anyone could expect - even though I asked the question I didn't expect much computational effort put into it, and I'd consider this factor of interest only if shown PRP. But I'd have to say that B2 should be higher if you are going to do P-1 to extra length.

You are running 30.8, and limiting the B2 manually is rarely a good idea with the new algorithm, in which B2 increases faster than linearly with time. If you must set it manually I'd expect it should be at least 100:1, as I tried to achieve even with the old algorithm in such cases.
Andrew Usher is offline   Reply With Quote
Old 2023-01-20, 01:46   #50
alpertron
 
alpertron's Avatar
 
Aug 2002
Buenos Aires, Argentina

101110110012 Posts
Default

The speed-up of the second step depends not only on the amount of RAM but also on the exponent being considered. If you worked with a 7-digit exponent the ratio B2/B1 could be a lot larger.

At this moment step 1 is 86.11% complete.
alpertron is offline   Reply With Quote
Old 2023-01-20, 07:41   #51
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

163178 Posts
Default

Quote:
Originally Posted by alpertron View Post
The speed-up of the second step depends on
more precisely I think, the integer number of fft-length size buffers that will fit in the allowed ram. It's not a continuous function of ram/exponent. Fft length is a stepwise function of exponent. So it is a "staircase".

And there could be more to it. I don't recall whether the new prime95 algorithm also has a requirement similar to one that Mlucas P-1 has, that the buffer count be an integer multiple of 24 or 40.

Last fiddled with by kriesel on 2023-01-20 at 07:45
kriesel is offline   Reply With Quote
Old 2023-01-21, 00:59   #52
Andrew Usher
 
Dec 2022

22·59 Posts
Default

I can't answer that last - it should be in the source - but yes, of course it's discrete. Even the old algorithm has discrete 'relative primes', and FFT sizes are discrete. It's just that continuous functions are much nicer approximations, and generally close enough for this work.

But we all know it depends on allocated RAM and on exponent. My supposition was that it also depended on B2, so the optimal B2/B1 (holding memory and exponent fixed) should be increasing with B1. The stage 2/stage 1 runtime ratio for alpertron's runs on this exponent would immediately show whether I'm right (if roughly constant, as with the old algorithm, then I'm wrong). The actual values used by others on small exponents seem to support this.
Andrew Usher is offline   Reply With Quote
Old 2023-01-21, 14:00   #53
alpertron
 
alpertron's Avatar
 
Aug 2002
Buenos Aires, Argentina

3·499 Posts
Default

I changed B2 to 1G. Now the computer is running step 2 of P-1.

It appears that it will finish on Wednesday.
alpertron is offline   Reply With Quote
Old 2023-01-28, 11:57   #54
alpertron
 
alpertron's Avatar
 
Aug 2002
Buenos Aires, Argentina

3·499 Posts
Default

No prime factor was found using P-1 with the bounds noted above.
alpertron is offline   Reply With Quote
Old 2023-01-29, 02:42   #55
Andrew Usher
 
Dec 2022

22·59 Posts
Default

So we're done with this now? I'm guessing you are tired of it by now and content to leave it there, as am I as my question has been gone over quite sufficiently, and I gratefully accept your contribution to it.

I am still curious about my conjecture on P-1, though.
Andrew Usher is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
factors of Mersenne numbers bhelmes Number Theory Discussion Group 21 2021-09-15 02:07
Mersenne factors 2*k*p+1 ATH Miscellaneous Math 7 2020-10-09 11:09
factors of Mersenne numbers bhelmes Miscellaneous Math 8 2020-09-14 17:36
Distribution of Mersenne Factors tapion64 Miscellaneous Math 21 2014-04-18 21:02
Known Mersenne factors CRGreathouse Math 5 2013-06-14 11:44

All times are UTC. The time now is 14:52.


Wed Feb 8 14:52:35 UTC 2023 up 174 days, 12:21, 1 user, load averages: 0.68, 0.76, 0.82

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.

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