mersenneforum.org Search Results
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 25 of 1000 Search took 0.41 seconds. Search: Posts Made By: paulunderwood
 2022-07-01, 10:55 Replies: 184 Views: 11,380 Posted By paulunderwood In stage one is says "Step [X]: xxxxx bits". The... In stage one is says "Step [X]: xxxxx bits". The number of bits is also printed in stage 2. A good start would be to learn about the arithmetic of rational points on elliptic curves:...
 2022-07-01, 06:19 Replies: 184 Views: 11,380 Posted By paulunderwood I do it like this. If the current number of bits... I do it like this. If the current number of bits is for example 3/4 of the starting number of bits, then it has left (3/4)^4 == 3^4/4^4 = 81/256 about 1/3 to go. Note also each step is about 70...
 2022-06-30, 19:02 Replies: 184 Views: 11,380 Posted By paulunderwood The factors of N+-1 don't matter for a test... The factors of N+-1 don't matter for a test number. I could have equally said 2^4253-1.
 Forum: XYYXF Project 2022-06-30, 17:13 Replies: 57 Sticky: Leyland Primes: ECPP proofs Views: 16,515 Posted By paulunderwood sweety439 fails to mention the 30% of KP and... sweety439 fails to mention the 30% of KP and 25%+epsilon of CGH. Also, Primo is currently old hat and people are using FastECPP/CM.
 Forum: XYYXF Project 2022-06-30, 17:07 Replies: 57 Sticky: Leyland Primes: ECPP proofs Views: 16,515 Posted By paulunderwood You understood correctly: (3892,765) is shorthand... You understood correctly: (3892,765) is shorthand notation herein for 3892^765+765^3892.
 Forum: XYYXF Project 2022-06-30, 16:47 Replies: 57 Sticky: Leyland Primes: ECPP proofs Views: 16,515 Posted By paulunderwood This is prime hunting 101. The number 91 is 3-PRP... This is prime hunting 101. The number 91 is 3-PRP yet factors into 7*13. To be 100% sure of primality we need to follow a method that actually proves the number prime -- in this case ECPP is used for...
 2022-06-30, 12:24 Replies: 184 Views: 11,380 Posted By paulunderwood Those are accumulative times. Each step is... Those are accumulative times. Each step is quicker than the last. It runs at O(log(n)^4) meaning a number twice in length takes 16 times as long to compute. So as each of the two stages finish it...
 Forum: XYYXF Project 2022-06-28, 13:56 Replies: 566 Views: 125,524 Posted By paulunderwood mtsieve... mtsieve (https://sourceforge.net/projects/mtsieve/) + OpenPFGW (https://sourceforge.net/projects/openpfgw/) is my guess :smile:
 Forum: XYYXF Project 2022-06-26, 17:31 Replies: 566 Views: 125,524 Posted By paulunderwood http://factordb.com/index.php?showid=1100000003609... http://factordb.com/index.php?showid=1100000003609777732
 Forum: Soap Box 2022-06-25, 00:14 Replies: 161 Views: 12,389 Posted By paulunderwood bzVHjg3AqIQ bzVHjg3AqIQ
 Forum: Hardware 2022-06-24, 23:33 Replies: 248 Views: 51,084 Posted By paulunderwood I understand the distraction to your key skills... I understand the distraction to your key skills of coding but there are a few more things you should try with the PSU+Motherboard+CPU: Step 0. Make sure the pump and radiator fans are plugged into...
 Forum: Miscellaneous Math 2022-06-24, 22:28 Replies: 32 Views: 755 Posted By paulunderwood :lol: For my next tricks, I have forgotten how to... :lol: For my next tricks, I have forgotten how to prove pi is transcendental, the proof of Prime Number Theorem and have never quite figured out the proof of Riemann's Hypothesis.
 Forum: Miscellaneous Math 2022-06-24, 21:46 Replies: 32 Views: 755 Posted By paulunderwood I have forgotten how to prove e is... I have forgotten how to prove e is transcendental. Intuitively, it cannot be written algabraically. Without me referring to my Spivak book, can you explain how it is proven transcendental? e^11 is...
 Forum: Miscellaneous Math 2022-06-24, 21:22 Replies: 32 Views: 755 Posted By paulunderwood I think it does converge. The terms approach 0 as... I think it does converge. The terms approach 0 as n goes to infinity. I can quite make subsets of terms be bounded and making the subset sum less then some bound which clearly is by experimentation...
 Forum: Software 2022-06-24, 14:04 Replies: 5 Views: 219 Posted By paulunderwood Not really. I can run with (P,1) with min P:... Not really. I can run with (P,1) with min P: Jacobi(P^2-4,n)==-1. Will that do for you sir? Here are the results as they come in: echo 'print((57*11^62668-7)/10)' | gp -q |...
 Forum: Software 2022-06-24, 13:28 Replies: 5 Views: 219 Posted By paulunderwood No. PFGW does not run a strong Lucas PRP test. It... No. PFGW does not run a strong Lucas PRP test. It could if you altered the source code. If you really want to strong Lucas test these numbers you could run the GMP program...
 2022-06-24, 06:03 Replies: 164 Views: 36,247 Posted By paulunderwood AFAIK factorDB lacks the ability to verify both... AFAIK factorDB lacks the ability to verify both KP and CHG proofs.
 Forum: Miscellaneous Math 2022-06-24, 05:57 Replies: 32 Views: 755 Posted By paulunderwood I think you meant 11^N/(N!). :smile: I think you meant 11^N/(N!). :smile:
 Forum: MattcAnderson 2022-06-23, 20:34 Replies: 5 Views: 119 Posted By paulunderwood 10^2^k+1 is a Generalized Fermat Number. There... 10^2^k+1 is a Generalized Fermat Number. There are very few Fermat Numbers that are prime. There will be fewer base 10 GFN primes is my guess.
 2022-06-23, 11:40 Replies: 164 Views: 36,247 Posted By paulunderwood It is ranked now. Try adding a comment. It is ranked now. Try adding a comment.
 2022-06-23, 11:17 Replies: 164 Views: 36,247 Posted By paulunderwood The database re-ranks primes every 30 mins. The database re-ranks primes every 30 mins.
 2022-06-22, 19:19 Replies: 184 Views: 11,380 Posted By paulunderwood The ultimate Ver_6 has been uploaded to post 148... The ultimate Ver_6 has been uploaded to post 148 (https://mersenneforum.org/showpost.php?p=606916&postcount=148). It uses functions and a neat piece of code to calculate odd d for n-1=d*2^r thanks to...
 2022-06-22, 18:58 Replies: 164 Views: 36,247 Posted By paulunderwood It's a bit involved. I think you have enter the... It's a bit involved. I think you have enter the whole number as a "blob" and give it the label: "tau(47^4176)". However if it does not have more than 26,709 digits as of today it is inadmissible to...
 Forum: Miscellaneous Math 2022-06-21, 23:29 Replies: 10 Views: 350 Posted By paulunderwood If you have found a new Mersenne prime please... If you have found a new Mersenne prime please email :woltman: If it is not a Mersenne prime, please tell us what it is and we can best advise you where it might be put. The bonus for a Mersenne...
 2022-06-20, 23:45 Replies: 184 Views: 11,380 Posted By paulunderwood Attached is a version that uses a quick gwswap()... Attached is a version that uses a quick gwswap() rather than a slow gwcopy(). I have added the corresponding Ver_5 code to post 148 (https://mersenneforum.org/showpost.php?p=606916&postcount=148).
 Showing results 1 to 25 of 1000

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

Sun Jul 3 01:53:57 UTC 2022 up 79 days, 23:55, 0 users, load averages: 1.85, 1.75, 1.64

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.

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