10 ms·
48th Mersenne prime found
- deleted 14y ago[deleted]
- sikhnerd 14y agoGIMPS "why" page is an interesting read as well: http://primes.utm.edu/notes/faq/why.html http://primes.utm.edu/notes/faq/why.html
- crazcarl 14y agoI was wondering what the significance of these findings were. I was disappointed that it is mostly "fame and fortune".
- speeder 14y agoThe absurd amount of time that takes just to verify the thing, shows how much we have yet to improve our computing power to be able to do more and more precise and groundbreaking science.
- aartur 14y agoBut... numbers are an infinite, artificial construction, there always will be a number exceeding current computing powers by any wanted factor.
- gejjaxxita 14y agoMersenne primes may not be infinite ;)
- simias 14y agoWell, on the other hand, if you try to prove it using this kind of bruteforce exhaustive search you may be in for quite a long time :)
- gejjaxxita 14y agoA long time is an understatement! I was of course just being extremely pedantic.
- speeder 14y agoProving that would be quite hard ;)
- mkl 14y agoNot necessarily - proving there are infinite primes is easy. It could be hard or impossible, or it could be easy or moderately hard but either way no one's figured it out yet. (And yes it's sometimes possible to prove that something can't be proved.)
- gejjaxxita 14y ago1. It's a major unsolved problem in mathematics - definitely not "easy"! 2. In this case it hasn't been proved that it can't be proved.
- lutusp 14y ago> Mersenne primes may not be infinite ;) The argument can be made that, because there are an infinity of primes, then either (a) Mersenne primes are also infinite, or (b) a very strange effect prevents Mersenne primes above a certain size, while allowing an infinity of ordinary primes. Occam's razor suggests it's (a).
- gejjaxxita 14y agoOccam's razor doesn't really work that way.
- lutusp 14y agoI used Occam's razor on the basis that, because Mersenne primes continue to appear as number size increases, it's more likely that this trend will continue than to imagine a reason why it wouldn't. The tl;dr: a continuation of the Mersenne prime series is more likely than its abrupt end, so Occam's razor (only ever an assumption) is applicable.
- nandemo 14y agoOccam's razor in its simplest form and applied to math is something like this: Proof 1: assumptions (i), (ii) imply that there are infinitely many Mersenne primes. Proof 2: assumptions (i), (ii), (iii) imply that there are infinitely many Mersenne primes. Both make the same "predictions", which in math it means they prove the "same" theorem. Then we choose Proof 1, because its assumptions are simpler. That's all. Occam's razor doesn't apply when we are choosing between different theories that lead to different predictions. Of course one can always conjecture that there are infinitely many Mersenne primes based on "intuition", and then go on to prove other results which rely on that assumption. People do that for P=?NP, for instance. But there's no point in invoking Occam's razor for that.
- lutusp 14y ago> Occam's razor doesn't apply when we are choosing between different theories that lead to different predictions. Of course it does. If there are two or more possible outcomes, and one of them has a higher likelihood or represents a simpler solution, it's favored by the thinking behind Occam's razor. This can't be used to prove anything and it's only conjecture, but it's useful for sorting out questions that involve imperfect information.
- speeder 14y agoThis is why I mentioned calculating the proof, not finding a new one :)
- TallGuyShort 14y agoIt sounds the primary motivation behind this project is exactly that. The intention is to push our ability to compute to it's limit.
- antonb2011 14y agoHey, we should be thankful that primes have cardinality aleph_0, so we can have reasonable algos for exhaustive search at all! ;)
- VMG 14y agoThere always will be a calculation that takes an absurd amount of time.
- Simucal 14y agoI went to this university and took several of Professor Cooper's classes. He was a great guy and he seemed really passionate about his Mersenne project. One thing that was annoying however was the prime finding software was put on every lab computer possible. It was suppose to pause when a user got on a machine and resume when they got off. This seemed to never be the case though because they would all run terribly slow and when you checked the process list the prime software would be pegging the CPU. After reporting the problem several times I simply added a line in my bash file to kill it when I logged on.
- easytiger 14y agowhy on earth would they run it as you user?
- Simucal 14y agoSeveral of us had root access to the few Linux boxes in the CS computer lab.
- yock 14y agoWhat OS was this? Processes like these (Folding, Seti, etc) should be "niced" on *nix-like OSes to have the lowest possible priority. Not sure what this looks like on Windows, but I imagine it's possible.
- sp332 14y agoIn windows, each process has one of 6 priority levels, and each thread has one of 7 priority levels. The combination is looked up in a table and yields one of 22 values between 1 and 31. http://msdn.microsoft.com/en-us/library/windows/desktop/ms685100%28v=vs.85%29.aspx http://msdn.microsoft.com/en-us/library/windows/desktop/ms68... You can manually change priority levels by right-clicking a process in the Task Manager. Not sure how to do it automatically or on a command line. Edit: note the OS will "boost" priorities on certain processes or threads sometimes. http://msdn.microsoft.com/en-us/library/windows/desktop/ms684828%28v=vs.85%29.aspx http://msdn.microsoft.com/en-us/library/windows/desktop/ms68...
- sanxiyn 14y agoIf we meet aliens, we should exchange Mersenne primes.
- yesbabyyes 14y agoTo them, that would be like someone wants to exchange integers with us. - Fifteen THOUSAND! - Uuuh...
- gokhan 14y agoYou assume that they will be advanced enough to come to us. What if we find them in Europa or Titan?
- yesbabyyes 14y agoThen we will probably not ask them to exchange Mersenne primes with us either. :-)
- gesman 14y ago...or claim that "my prime is bigger than yours" :)
- NelsonMinar 14y agoGood for GIMPS, 2⁵⁷⁸⁸⁵¹⁶¹ - 1 has a nice ring to it! GIMPS is one of the largest distributed computations in the world and have been tooling away finding primes since 1996. SETI@Home gets most of the credit for popularizing this kind of distributed computing, but GIMPS has been at it for even longer and has delivered consistent results.
- falsestprophet 14y agoTo be fair, SETI@Home has delivered most consistent results.
- yread 14y agoyou mean "nothing" ?
- wikwocket 14y agoIf you want to run some distributed computing but don't like SETI@Home, give worldcommunitygrid.org a look. They run a number of projects aimed at curing stubborn diseases and working on clean energy and water. As a bonus, if you use it as your screensaver, the graphics for many of the projects are pretty cool.
- cryptoz 14y agoWhat? Don't be silly. If they delivered no results or "nothing" at all, the project would have been shut down years ago. SETI has consisently reported that they have searched through a very large amount of signal and found only natural noise. That data is extremely valuable and is absolutely not "nothing".
- shaurz 14y agoThe aliens are using subspace communication, no wonder we haven't found anything yet.
- 14y ago
- jpwagner 14y agothis is not scalable :P
- gesman 14y agoFinally! Now i can sleep well....
- sp332 14y agoThis part confuses me: "a 32-core server in 6 days" and "i7 CPU in 4.5 days" to do the same verification? Is the MLucas code really that much slower than GIMPS, or did the verification only use one core on the 32-core machine or what?
- shocks 14y agoThe article does not mention how powerful these 32 server cores are.
- masklinn 14y agoYes it seems very odd, especially as they also mention CUDALucas running in 3.7 and 7.7 days on two different NVidia GPUs (one a 560, the other one unnamed — maybe a Fermi board?)
- sp332 14y agoI have the 560 Ti mentioned in the article. It's a mid-to-high grade card, better than most $200 cards IMHO but if you're willing to spend the cash, it's not at all difficult to find a card with more horsepower. Dropping a cool kilodollar will net you a GTX 690 which seems to be the right relative speed. http://www.hwcompare.com/12683/geforce-gtx-560-ti-vs-geforce-gtx-690/ http://www.hwcompare.com/12683/geforce-gtx-560-ti-vs-geforce... Edit: since Dubslow's reply, here's the comparison for the GTX 580: http://www.hwcompare.com/9133/geforce-gtx-560-ti-vs-geforce-gtx-580/ http://www.hwcompare.com/9133/geforce-gtx-560-ti-vs-geforce-... It's also about $400.
- mkl 14y agoEach of these verifications would have been using different code and algorithms, otherwise it's not really verification. So different speeds are entirely expected.
- Dubslow 14y agoIt's a myriad of answers. The Mlucas run used a larger FFT than was necessary, partly due to multithreading reasons. The Mlucas code also only uses SSE2 instructions, where the overclocked i7-2600K using GIMPS' Prime95 program is fully AVX capable. I would also expect that the i7 runs at a higher frequency, with a higher IPC, than the server. The "main" CUDALucas run took around 90 hours on a GTX 580. We didn't even hear about the 560 Ti run by Gilchrist, that was on the side. Here are some links: http://www.mersenneforum.org/showpost.php?p=325878&postcount=12 http://www.mersenneforum.org/showpost.php?p=325878&postc... http://www.mersenneforum.org/showthread.php?p=325951#post325951 http://www.mersenneforum.org/showthread.php?p=325951#post325... http://www.mersenneforum.org/showpost.php?p=325995&postcount=38 http://www.mersenneforum.org/showpost.php?p=325995&postc... http://www.mersenneforum.org/showpost.php?p=326020&postcount=51 http://www.mersenneforum.org/showpost.php?p=326020&postc...
- stevenleeg 14y agoSo what's the application of finding these sorts of primes? (I don't mean to sound like a dick or anything, I'm genuinely curious what this kind of knowledge can help us with).
- jfrm 14y agohttp://primes.utm.edu/notes/faq/why.html http://primes.utm.edu/notes/faq/why.html
- ville 14y agoLarge primes are used in cryptographic algorithms as well. http://math.stackexchange.com/a/43120 http://math.stackexchange.com/a/43120
- ColinWright 14y agoNot Mersenne Primes, because they have a special structure that can create weaknesses.
- alexkus 14y agoAnd such encryption relies on the primes that are used remaining secret. Using any of the 'well known' primes would be a bad idea as it is easy to go through the 'well known' primes and test to see if they were used as a basis for the encryption.
- pbsd 14y agoWhile Mersenne primes make breaking discrete logs easier over prime fields, they're pretty OK to use as underlying field on elliptic curve groups (cf. p521).
- vilgax 14y agoIt's used in field of cryptography. http://www.claymath.org/posters/primes/ http://www.claymath.org/posters/primes/ http://primes.utm.edu/notes/faq/why.html http://primes.utm.edu/notes/faq/why.html
- mikecane 14y agoWolfram Alpha needs to update: http://www.wolframalpha.com/input/?i=what+is+the+largest+mersenne+prime+number%3F http://www.wolframalpha.com/input/?i=what+is+the+largest+mer...
- jrajav 14y agoWell it's not up to date, but it's not wrong either. It says "Largest known ... as of July 2012"
- undershirt 14y agoI first wondered they wouldn't just multiply all the prime numbers up to this new prime and then subtract one from it to get an even bigger prime number. But then I realized that they're not searching for them in sequence. I guess it's a very sparse table of primes once you get up there in the magnitudes.
- robterrell 14y agoOr, you could test that theory with some smaller primes and realize it wouldn't work.
- undershirt 14y agooops.
- cantos 14y agoIt will not necessarily be a larger prime. But it will always be divisible by a larger prime. See http://en.wikipedia.org/wiki/Euclids_theorem http://en.wikipedia.org/wiki/Euclids_theorem (Though not necessarily the next largest prime). The problem with this approach is that the product of the first n primes grows exponentially as the number of primes increases.
- ashleyblackmore 14y agoIf for whatever reason you want to download the number, there are a couple of links here: http://www.isthe.com/chongo/tech/math/digit/m57885161/prime-c.html#middle http://www.isthe.com/chongo/tech/math/digit/m57885161/prime-...
- rsiqueira 14y agoIn 2004, Liechtenstein issued a postage stamp with the 39th Mersenne prime number (2^13466917-1), this is the picture from a mathematical stamps collection: http://stamps.postbit.com/photos/math-stamps-collection/liechtenstein-math-stamp-2004-prime-number-mersenne.html http://stamps.postbit.com/photos/math-stamps-collection/liec...
- littledot5566 14y agoWhen dealing with numbers of such magnitude, how are they stored in memory?
- iand 14y agoEven naively 2^257885161-1 can be represented with 257885161 bits, or 30MB.
- kedean 14y agoI'm not sure how GIMPS does it, but if you're interested in how it CAN be done you could look into the GMP library for C.
- Dubslow 14y agoIt's definitely just a standard lots-of-bits. Every bit of information is needed, lose one and the whole test will be wrong. For current wavefront exponents, like 2^60,000,000-1, save files are around 8 MB, or ~60M bits -- exactly what you'd expect. Also Prime95 doesn't use GMP, its code is all hand-coded assembly, optimized specifically for the LL test and x86 architecture, written by one very dedicated George Woltman.
- shaurz 14y agoThey give the date to the nearest second but neglect to mention the year...
- hfsktr 14y agoJust imagine if we didn't have computers how many fewer primes would have been found. Even with computers I started wondering how they even go about testing these. I know there are multiple algorithms etc for verification. I meant in the sense of how to keep everything in memory and doing computations on it (I assume that numbers these large aren't trivial to work with). The history of mersenne primes was a an interesting read though. http://primes.utm.edu/mersenne/index.html http://primes.utm.edu/mersenne/index.html
- scythe 14y agoThe number's representation in binary can fit in RAM comfortably -- it's "only" 3 million bits or so. From there, the goal is to perform the Lucas-Lehmer test in as few operations as possible: http://en.wikipedia.org/wiki/Lucas-Lehmer_test_for_Mersenne_numbers http://en.wikipedia.org/wiki/Lucas-Lehmer_test_for_Mersenne_...
- pzxc 14y agoIn my freshman year of college, I discovered something neat about perfect numbers and Mersenne primes (verified by my math professor): The first perfect number, 6, written in binary is 110 The second, 28, in binary is 11100 The third, 496, in binary is 1111100 The fourth, 8128, in binary is 1111111000000 See the pattern? Its a number of ones equal to the mersenne prime that generates the perfect number, followed by one less number of zeroes. Just an interesting tidbit I discovered completely by accident in college that I always thought was cool. :) Of course it derives directly from the fact that mersenne primes (and perfect numbers) are based on powers of two, but I still thought it was cool (probably because I discovered it accidentally and independently without trying to)
- ctdonath 14y agoAwesome. I'll have to apply the binary notation approach to answering the question I just posted below.
- jnotarstefano 14y agoThis is in fact the consequence of a fact first proven by Euler: every even perfect number is of the form (2^(p-1)) * (2^p - 1) where 2^p - 1 is a prime. That is, it's p ones shifted left by p-1 zeroes.
- john_b 14y agoIn case anyone is curious, the explicit power of two formula for these perfect numbers can be found here: http://primes.utm.edu/mersenne/index.html#theorems http://primes.utm.edu/mersenne/index.html#theorems
- SagelyGuru 14y agoSurely then the third should be: 111110000, not 1111100. Looks like you are two zeroes short of perfect ;)
- ctdonath 14y agoI've long wondered: Is 2^(2^(2^(2^(2^(...(2)...)-1)-1)-1)-1)-1 prime for all levels of recursion?
- pndmnm 14y agoThose are the Catalan-Mersenne numbers, and it is unknown whether c_5 is prime: http://oeis.org/A007013 http://oeis.org/A007013
- ctdonath 14y agoMay be. Each value in the series is, in binary, all 1s with the quantity of digits equal to the previous value in the series. Someone took a stab at this theory: http://www.mail-archive.com/mersenne@base.com/msg06260.html http://www.mail-archive.com/mersenne@base.com/msg06260.html
- czzarr 14y agotl;dr version: The largest known prime number, 2^(57,885,161)-1, was discovered on January 25th 2013. It has 17,425,170 digits. The new prime number is a member of a special class of extremely rare prime numbers known as Mersenne primes... http://tldr.io/tldrs/51111f3dde23f15658000031/48th-known-mersenne-prime-discovered http://tldr.io/tldrs/51111f3dde23f15658000031/48th-known-mer...
- pkamb 14y ago> The discovery is eligible for a $3,000 GIMPS research discovery award. Missed opportunity. Award should be $3,571.113
- Yhippa 14y agoIs 2^57,885,161-1 Numberwang?
- ChrisClark 14y agoSorry, it was 3.
- barbs 14y agoLet's rotate the board!
- xy22y 14y agoIf you care what the number actually is, and you have gnu bc, : echo '(2^57885161)-1' | bc > prime.txt will yield a text file of 17,937,675 bytes, containing all the digits of the number, plus some overhead for newlines and continuation.
- iso8859-1 14y agoif you use a real Unix, you can use dc: »dc -e '2 57885161 ^ 1 - p'«
- deleted 14y ago[deleted]