Newest Mersenne Prime

Thanks to Ward Harold for the heads up about UCLA's new mersenne prime discovery.

With Haskell's default unbounded Integer type, you can have a look at this beast with little effort. Here's the Haskell program to print the prime to stdout:

    main = print (2^43112609-1)

Compile and run this program:

    $ ghc -O2 --make A.hs
    $ time ./A > /tmp/prime.txt
    ./A > /tmp/prime.txt  34.14s user 0.23s system 99% cpu 34.462 total

And we get a 13M file containing 31647026933025592314 ... 78265780022181166697152511. Enjoy!

/home :: /haskell :: permalink :: rss

About

Real World Haskell

Archives

• September 2008
• August 2008
• July 2008
• June 2008
• May 2008
• November 2007
• October 2007
• July 2007
• June 2007
• May 2007
• April 2007
• March 2007
• January 2007
• December 2006
• November 2006
• October 2006
• September 2006
• August 2006

Recommended

• Working at a high altitude for low level performance
• Write Haskell as fast as C: exploiting strictness, laziness and recursion
• Haskell is a strict language
• Use those extra cores and beat C today!
• No monadic headaches: multi-core concurrency is easy in Haskell
• No more exceptions: debugging Haskell code with GHCi
• Run length encoding in Haskell
• xmonad: a success for pure functional data and QuickCheck
• Tracking focus with a Zipper
• Roll your own window manager
• The programmable semicolon: shell scripting and privilege separation
• Programming Haskell: argument handling
• Programming Haskell: string processing and concurrency
• Programming Haskell: introduction
• Roll your own IRC bot
• Simple unix tools

Blog Roll

• planet haskell
• the haskell sequence
• well-typed
• augustss
• tmoertel
• japple
• lennart
• ndm
• sigfpe
• ekidd
• bos
• creating passionate users

Syndicate

• rss