mersenneforum.org Presentation and doubts with the application and competition of 100000000 prime digits
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2022-05-01, 23:26   #12
apzyx

May 2022

1112 Posts
I'm going crazy

Quote:
 Originally Posted by Prime95 Welcome aboard. Prime95 can do a *probable* prime test on numbers of the for k*b^n+c where k,b,n,c are all "small". There are other programs that may or may not be able to prove those numbers prime depending on the values of k,b,n,c. There are no programs that can prove an arbitrary 100,000,000 digit number prime.
Is there an easy way to use the API for the k*b^n+c expression? I'm reading how to do it but it's crazy parameters, isn't there something like the Assignments section with these parameters on the web www.mersenne.org?

2022-05-01, 23:40   #13
paulunderwood

Sep 2002
Database er0rr

2·11·191 Posts

Quote:
 Originally Posted by apzyx Is there an easy way to use the API for the k*b^n+c expression? I'm reading how to do it but it's crazy parameters, isn't there something like the Assignments section with these parameters on the web www.mersenne.org?
There is no API for 100,000,000 digit k*b^n+c candidates. There is only an interface for 2^p-1.

For k*b^n+c you have to write your own. What k,b,n and c are you trying to test?

Last fiddled with by paulunderwood on 2022-05-01 at 23:41

 2022-05-02, 10:21 #14 kruoli     "Oliver" Sep 2017 Porta Westfalica, DE 20058 Posts You can manually enter something like PRP=N/A,7,17,112108343,17 into worktodo.txt. This will test $$7\cdot{}17^{112{,}108{,}343}+17$$. So the format is PRP=N/A,k,b,n,c. Last fiddled with by kruoli on 2022-05-02 at 10:21 Reason: Fixed formula.
2022-05-02, 10:50   #15
paulunderwood

Sep 2002
Database er0rr

2×11×191 Posts

Quote:
 Originally Posted by kruoli You can manually enter something like PRP=N/A,7,17,112108343,17 into worktodo.txt. This will test $$7\cdot{}17^{112{,}108{,}343}+17$$. So the format is PRP=N/A,k,b,n,c.
I can say that number is not prime by doing the calculations in my head.

c must be -1 or +1 for any sizable number to be provable.

The real point here is that testing should be done by using the 2^p-1 server. Trial factoring will have been done and sometimes P-1.

The chance of claiming the prize money for a 100,000,000 digit prime is very small. It s far better for a new comer to join the herd and crunch a wavefront number -- "World Record Prime" -- and hope for a lesser monetary prize yet plenty of fame.

 2022-05-02, 11:00 #16 kruoli     "Oliver" Sep 2017 Porta Westfalica, DE 102910 Posts Of course it is divisible by 17. It was only an example. Yes, this way we can only prove compositeness, and yes, for reaching the goal of a 100 million digit prime, I would also suggest using the PrimeNet assignment system and according candidates. Yes, I would also recommend our "normal" wavefront work, but we can only suggest things and do not force anyone.
 2022-05-03, 00:51 #17 apzyx     May 2022 7 Posts Today this possible prime number can not be validated in prime95, it has an n of more than one integer, there I leave it for the future or for someone who knows how to check this numbers =) The possible prime is: (2^3486784401) + 3486784401 I have a theory that: 2^3 + 3 = 11 is prime 2^(3^4) + (3^4) = 2^81 + 81 = 2417851639229258349412433 is prime 2^((3^4)^5) + ((3^4)^5) = (2^3486784401) + 3486784401 = ? or 2^(3^(4^5)) + (3^(4^5)) = 2^373391848741020043532959754184866588225409776783734007750636931722079\ 04061726525122999368893880397722046876506543147515810872705459216085858\ 13513369828091873141917485942625809388070199519564042855718180410466812\ 88797402925517668012340617298396574731619152386723046235125934896058590\ 58828465479354050593620237654780744273058214452705898875625145281779341\ 33521419207446230275187291854328623757370639854853194764169262638199728\ 87006907013899256524297198527698749274196276811060702333710356481 + 37339184874102004353295975418486658822540977678373400775063693172207904\ 06172652512299936889388039772204687650654314751581087270545921608585813\ 51336982809187314191748594262580938807019951956404285571818041046681288\ 79740292551766801234061729839657473161915238672304623512593489605859058\ 82846547935405059362023765478074427305821445270589887562514528177934133\ 52141920744623027518729185432862375737063985485319476416926263819972887\ 006907013899256524297198527698749274196276811060702333710356481 = ? This theory is complicated to prove hahahahah Pérez Sánchez, Pablo apzyx@yahoo.com 03/05/2022 Last fiddled with by retina on 2022-05-03 at 01:00 Reason: Pointless long numbers chopped into manageable segments
2022-05-03, 02:50   #18
mathwiz

Mar 2019

277 Posts

Quote:
 Originally Posted by apzyx Today this possible prime number can not be validated in prime95, it has an n of more than one integer, there I leave it for the future or for someone who knows how to check this numbers =) The possible prime is: (2^3486784401) + 3486784401 I have a theory that: 2^3 + 3 = 11 is prime 2^(3^4) + (3^4) = 2^81 + 81 = 2417851639229258349412433 is prime 2^((3^4)^5) + ((3^4)^5) = (2^3486784401) + 3486784401 = ?
Your number is roughly a billion decimal digits. And not of a form that can be efficiently tested, like 2^n-1.

Your theory has no mathematical basis, other than that the progression is true for 2 terms.

As such, I doubt you'll find much interest here in trying to test it.

2022-05-03, 03:35   #19
charybdis

Apr 2020

10111011002 Posts

Quote:
 Originally Posted by apzyx The possible prime is: (2^3486784401) + 3486784401
Doesn't look very prime to me, it has two 7-digit factors:
Code:
gp > forprime(p=2,10^7,if(Mod(2,p)^3486784401+3486784401==0,print(p)))
1454521
4965049

2022-05-05, 10:40   #20
LaurV
Romulan Interpreter

"name field"
Jun 2011
Thailand

9,973 Posts

Quote:
 Originally Posted by kriesel At the time I had posted that, his post count was shown...
[offtopic]
You were not seeing things, that's a long time known joke from Mike, for the new users before their first posts being approved or so, the numbers of posts being shown is an arbitrary large number. After that, the counting resumes properly. I think Unc knows that, but she is playing with you
[/offtopic]

Last fiddled with by LaurV on 2022-05-05 at 10:49

2022-05-05, 10:45   #21
LaurV
Romulan Interpreter

"name field"
Jun 2011
Thailand

100110111101012 Posts

Quote:
 Originally Posted by kruoli Of course it is divisible by 17. It was only an example.
Oh... I though is even, as you add two odds

2022-05-05, 11:10   #22
kruoli

"Oliver"
Sep 2017
Porta Westfalica, DE

3·73 Posts

Quote:
 Originally Posted by LaurV Oh... I though is even, as you add two odds
Man sieht den Wald vor lauter Bäumen nicht.

 Similar Threads Thread Thread Starter Forum Replies Last Post Thecmaster GPU to 72 6 2019-03-22 07:21 Tamay82 Information & Answers 3 2018-09-08 16:34 paramveer Information & Answers 32 2012-01-15 06:05 ixfd64 Factoring 9 2010-09-21 19:39 ixfd64 Lounge 2 2004-11-05 23:42

All times are UTC. The time now is 05:25.

Tue Jun 28 05:25:43 UTC 2022 up 75 days, 3:27, 1 user, load averages: 0.94, 1.31, 1.21

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.

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