mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2011-02-22, 09:20   #1
Lee Yiyuan
 

50716 Posts
Default Assorted formulas for exponents of Mersenne primes

I have found a 39-digit exponent (which obviously cannot be revealed to any member of the public) but because of the 10-digit integer float of Prime95, it is not recognized as a prime number and hence i cannot submit. I have also found a Mersenne Prime generating function as well. Please reply to me so that i can submit my findings.

Thank you so much.
  Reply With Quote
Old 2011-02-22, 09:26   #2
Lee Yiyuan
 
Feb 2011
Singapore

1000112 Posts
Default 39 Digit exponent that could not be submitted.....

I have found a 39-digit exponent but i cannot submit it in Prime95 because of the 10 digit integer floating limitation which causes it to be recognized as a non-prime. I have also found a Mersenne Prime generating function, which i am sure you would be interested to know.

I hope you can reply to me via email or any other means ASAP. Thanks.
Lee Yiyuan is offline   Reply With Quote
Old 2011-02-22, 09:31   #3
Lee Yiyuan
 
Feb 2011
Singapore

5·7 Posts
Default

Does this program support exponents more than 10 digits? I have found an exponent that is 39 digits long. I have also found out a Mersenne prime generating formula.
Lee Yiyuan is offline   Reply With Quote
Old 2011-02-22, 11:08   #4
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

10010111001102 Posts
Default

Quote:
Originally Posted by Lee Yiyuan View Post
Does this program support exponents more than 10 digits? I have found an exponent that is 39 digits long. I have also found out a Mersenne prime generating formula.
It doesn't at the moment. But if you let me know your exponent via PM (private messaging) or email, I can set a trial-factor session with my program to double-check your assumption.

Luigi
ET_ is offline   Reply With Quote
Old 2011-02-22, 13:21   #5
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

203008 Posts
Default

Quote:
Originally Posted by Lee Yiyuan View Post
I have found a 39-digit exponent (which obviously cannot be revealed to any member of the public) but because of the 10-digit integer float of Prime95, it is not recognized as a prime number and hence i cannot submit. I have also found a Mersenne Prime generating function as well. Please reply to me so that i can submit my findings.

Thank you so much.
can you prove that the formula hold weight ?
science_man_88 is offline   Reply With Quote
Old 2011-02-22, 13:25   #6
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22×5×373 Posts
Default

Quote:
Originally Posted by Lee Yiyuan View Post
I have found a 39-digit exponent but i cannot submit it in Prime95 because of the 10 digit integer floating limitation which causes it to be recognized as a non-prime. I have also found a Mersenne Prime generating function, which i am sure you would be interested to know.

I hope you can reply to me via email or any other means ASAP. Thanks.
Just what we don't need: Another Crank
R.D. Silverman is offline   Reply With Quote
Old 2011-02-22, 13:36   #7
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

838410 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
Just what we don't need: Another Crank
like I've said before if you didn't want us here you'd be smart enough to make an test to stop us getting in.
science_man_88 is offline   Reply With Quote
Old 2011-02-22, 17:03   #8
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

10,259 Posts
Default

Quote:
Originally Posted by Lee Yiyuan View Post
I have also found a Mersenne Prime generating function as well. Please reply to me so that i can submit my findings.
Please post a copy of your method here (as a pdf, txt, or doc attachment.) That way it will placed a public place and no one can then claim that they did it first.
Also, if you have found a prime that is very large, can you please at least tell us the following:
  • What hardware did you use to run your test?
  • Did you write your own software?
  • Did you check your number by trial division up to at least 85 bits?
  • Did you run P-1 factoring or ECM on the number? (If so at what bounds?)
  • How does your program perform the L-L test? (FFT's and such)
  • If your test program does not perform a Lucas test, why not?

Last fiddled with by Uncwilly on 2011-02-22 at 17:49 Reason: spelling
Uncwilly is offline   Reply With Quote
Old 2011-02-22, 17:29   #9
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by Uncwilly View Post
Please post a copy of your method here (as a pdf, txt, or doc attachement.) That way it will placed a public place and no one can then claim that they did it first.
Also, if you have found a prime that is very large, can you please at least tell us the following:
  • What hardware did you use to run your test?
  • Did you write your own software?
  • Did you check your number by trial division up to at least 85 bits?
  • Did you run P-1 factoring or ECM on the number? (If so at what bounds?)
  • How does your program perform the L-L test? (FFT's and such)
  • If your test program does not perform a Lucas test, why not?
I've heard it all before and thought what uncwilly said was a joke but I get why they say it because, by putting it out there first it's almost like claiming a copyright. I myself have interest in seeing your formula because i myself have played around quite a bit with mersenne prime exponents and haven't found much that could help.
science_man_88 is offline   Reply With Quote
Old 2011-02-22, 23:26   #10
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

10000101011112 Posts
Default

[nitpick ahead]
Quote:
Originally Posted by Uncwilly View Post
  • Did you check your number by trial division up to at least 85 bits?
Assuming it is a Mersenne number with a prime exponent (something cranks have trouble doing ) that has 39 digits, the potential factors would start at 128 bits in size, so 100% of candidates meeting these requirements can be factored to not just 85, but 127 bits without any factors. How about 35 bits beyond the minimum, or ~164 bits. Note that this only has a ~25% chance of finding at least one factor, even if the claim of primality is false, so it's not a strong 'negative' result even if no factor is found. If you were to then extend this from 164 to 180 bits, which would be MUCH harder than 0 to 164, would only have a 9% chance of finding a factor.

Using currently known methods, a Mersenne number with a 39 digit exponent can not be known to be prime. Besides Prime95's limitation, it would take years. Hundreds of years on the best computer you could find, at minimum. You could have a ~25% chance of proving it composite fairly easily, by TFing, and of course any Mersenne number with a composite exponent is trivially composite, but proving primality is far harder.

Last fiddled with by Mini-Geek on 2011-02-22 at 23:28
Mini-Geek is offline   Reply With Quote
Old 2011-02-22, 23:50   #11
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
I've heard it all before and thought what uncwilly said was a joke but I get why they say it because, by putting it out there first it's almost like claiming a copyright.
In fact, if like science_man_88 and myself, the OP lives in a Berne signatory state then just by writing it a copyright is created. But if taken to court you'd need to prove copyright, so your choices would be to either make it public somewhere that records dates (say, on the mersenne forums) or, better but more expensive, register a copyright. In my country, this can be as cheap as $35.
CRGreathouse is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sophie-Germain primes as Mersenne exponents ProximaCentauri Miscellaneous Math 15 2014-12-25 14:26
compendium of formulas related with primes ? skan Miscellaneous Math 6 2012-12-14 12:56
recurrent formulas to obtain primes Unregistered Information & Answers 2 2011-01-14 17:19
Mersenne Wiki: Improving the mersenne primes web site by FOSS methods optim PrimeNet 13 2004-07-09 13:51
Smooth polynomial formulas to produce all primes Cyclamen Persicum Math 10 2003-03-29 07:08

All times are UTC. The time now is 09:37.


Sat Jan 29 09:37:17 UTC 2022 up 190 days, 4:06, 1 user, load averages: 2.54, 2.21, 2.15

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.

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