mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2009-08-16, 21:24   #1
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

2·3·23·61 Posts
Default Challenge

if you look at wikipedia the double mersenne primes go:

7, 127, 2147483647, 170141183460469231731687303715884105727
first all of them end in 7
next if you look at the table for mersenne primes they have:

p Mp
3 7
7 127
127 170141183…884105727

If I'm right in assuming the last Mp is the last in this series and this pattern continues( the pattern is Mp becomes the next p) then the next one in this sub series( or what ever you want to call it) is:

p
170141183460469231731687303715884105727

Mp
2^170,141,183,460,469,231,731,687,303,715,884,105, 727-1


if this is true it smashes all records as the biggest prime to date and biggest mersenne prime is 2^46 million and something this is 2^ 170 Undecillion and something.

I left gimps as it took to much time for me. but can anyone confirm this pattern or try it out if so it would be the biggest known prime.
science_man_88 is offline   Reply With Quote
Old 2009-08-16, 21:26   #2
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

100000111000102 Posts
Default

Oh by the way it might take 21 tera tera tera bytes to write in binary form but anyone willing to try ?
science_man_88 is offline   Reply With Quote
Old 2009-08-16, 21:34   #3
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

2×3×23×61 Posts
Default

oh if you look at it the pattern would be
(2^3)-1,(2^7)-1,(2^2^7)-1,(2^2^2^7)-1,(2^2^2^2^7)-1,..........................................................................................................
science_man_88 is offline   Reply With Quote
Old 2009-08-16, 21:38   #4
lfm
 
lfm's Avatar
 
Jul 2006
Calgary

1A916 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
if you look at wikipedia the double mersenne primes go:

7, 127, 2147483647, 170141183460469231731687303715884105727
first all of them end in 7
next if you look at the table for mersenne primes they have:
No one knows if the 3rd exponent yields a prime let alone the 4th. This is just someone's wild speculation.
lfm is offline   Reply With Quote
Old 2009-08-16, 21:45   #5
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

2×3×23×61 Posts
Default

actually it's a pattern I saw as a possibility in the table but if you don't want to find out if M170,141,183,460,469,231,731,687,303,715,884,105,727 is prime

Last fiddled with by science_man_88 on 2009-08-16 at 21:45
science_man_88 is offline   Reply With Quote
Old 2009-08-16, 21:52   #6
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

841810 Posts
Default

2^3 = 8-1 = 7
2^7 = 128-1=127
2^127(messed up before) = 170141183460469231731687303715884105728-1=170141183460469231731687303715884105727
2^170141183460469231731687303715884105727-1 ?

Last fiddled with by science_man_88 on 2009-08-16 at 21:56
science_man_88 is offline   Reply With Quote
Old 2009-08-16, 21:58   #7
Dougal
 
Dougal's Avatar
 
Jan 2009
Ireland

18610 Posts
Default

it is impossible to confirm with todays technology.the only thing that can be done is confirm it is not prime.this can be done by trial factoring it with a program such as factor 5.it has already been trial factored up to around 170 bits without a factor.
Dougal is offline   Reply With Quote
Old 2009-08-16, 22:01   #8
lfm
 
lfm's Avatar
 
Jul 2006
Calgary

52×17 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
2^3 = 8-1 = 7
2^7 = 128-1=127
2^127(messed up before) = 170141183460469231731687303715884105728-1=170141183460469231731687303715884105727
2^170141183460469231731687303715884105727-1 ?
We would like to know I suppose but we are not going to find out any time soon without some breakthrough in the math. It is simply too large to test with any known method of testing primes.

The record is 2^43112609 - 1 that was discovered last year by the GIMPS projects.
lfm is offline   Reply With Quote
Old 2009-08-16, 22:04   #9
lfm
 
lfm's Avatar
 
Jul 2006
Calgary

42510 Posts
Default

Quote:
Originally Posted by Dougal View Post
it is impossible to confirm with todays technology.the only thing that can be done is confirm it is not prime.this can be done by trial factoring it with a program such as factor 5.it has already been trial factored up to around 170 bits without a factor.
I think it is too large for factor5 too. I suppose it could be tested for factors with some relatively simple new software but it doesn't realy seem worth the effort at this time.
lfm is offline   Reply With Quote
Old 2009-08-16, 22:10   #10
Dougal
 
Dougal's Avatar
 
Jan 2009
Ireland

101110102 Posts
Default

M170141183460469231731687303715884105727,MM127 can be tested with factor5.he also mentions MM31,i thought there was a factor found for it?
Dougal is offline   Reply With Quote
Old 2009-08-16, 22:18   #11
flouran
 
flouran's Avatar
 
Dec 2008

72·17 Posts
Thumbs down

Does science_man_88 = ? I am not sure yet, as I have not had much experience with the and related creatures.
Anyone agree/beg to differ?
If so, I vote that this thread should be moved to Miscellaneous Math.

Last fiddled with by flouran on 2009-08-16 at 22:24
flouran is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
A Challenge on the net devarajkandadai Miscellaneous Math 0 2012-05-31 05:17
When I was your age.....CHALLENGE petrw1 Lounge 14 2009-11-23 02:18
rsa-640 challenge ValerieVonck Factoring 58 2005-10-24 15:54
Another challenge R.D. Silverman Programming 24 2005-07-27 21:08
Who is Challenge? JuanTutors PrimeNet 2 2004-07-22 12:56

All times are UTC. The time now is 15:21.


Sat Nov 26 15:21:23 UTC 2022 up 100 days, 12:49, 1 user, load averages: 0.70, 1.08, 1.03

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.

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