New largest prime number dicovered

[duck]

Don't worry guys I've upgraded my calculator I can now calculate this accurately

[img]http://s.duck.me.uk/2013-02-05_22-57-57.png[/img]

[Krinkels]

[QUOTE=JohnnyMo1;39487239]By using a primality test like:

[url]http://en.wikipedia.org/wiki/Lucas%E2%80%93Lehmer_primality_test[/url][/QUOTE]

Cool.

[dark_console2]

Math is hard.

[Riller]

I've always wondered [I]why[/I] we search for the largest primes. What mathemathical significance do primes have that grant them this mysterious, white-whale sorta status for mathematicians, except for the whole division-by-itself-and-one thing. Do they do any other cool shit? Can I teach a prime to do a backflip?

[ZombieDawgs]

[QUOTE=Riller;39487570]I've always wondered [I]why[/I] we search for the largest primes. What mathemathical significance do primes have that grant them this mysterious, white-whale sorta status for mathematicians, except for the whole division-by-itself-and-one thing. Do they do any other cool shit? Can I teach a prime to do a backflip?[/QUOTE]

It's the common "it's not about why, it's about [I]why not![/I]"

[Riller]

I'm not a math person, but I understand why primes are unique and rare. I just don't understand why they matter much. I always hated them back in my school-days. God damn division by seven...

[editline]6th February 2013[/editline]

So why's it a big deal? It's not like we discovered Higgs Bosom all over again, is it?

[Lazor]

it's a small article on a website devoted to science and math. nobody is making it out to be a big deal like the higg bosom

[Riller]

Ah, right. It's just you guys goin' all cool beans over it. Sorry, I see now. Still neat, I suppose!

[Ryll]

[QUOTE=Riller;39487570]I've always wondered [I]why[/I] we search for the largest primes. What mathemathical significance do primes have that grant them this mysterious, white-whale sorta status for mathematicians, except for the whole division-by-itself-and-one thing. Do they do any other cool shit? Can I teach a prime to do a backflip?[/QUOTE]

No, but whoever discovers it gets a giant boost to their academic cock

[JohnnyMo]

I output a few hundred thousand digits with mathematica

I wonder how long it will take to do the whole thing

[editline]5th February 2013[/editline]

Great Odin's ravens. That is a number.

[editline]5th February 2013[/editline]

thanks mathematica that is handy:

[IMG]http://i46.tinypic.com/fm3lgo.png[/IMG]

[Froztshock]

[QUOTE=Shadaez;39487260]Brute force. I believe they basically try to divide it by all possible factors see if it has any factors. They probably have this method down very efficiently.[/QUOTE]

I think a friend who's way better at math than I showed me some method that's a bit more efficient than brute force.

Or maybe it was for something else, I can't remember how it was done regardless.

[Cheat_God]

[QUOTE]All prime numbers can only be divided by themselves and 1. The rare Mersenne primes all have the form 2[sup]p[/sup] - 1, where p is itself a prime number.[/QUOTE]

Couldn't we raise 2 to the new number we just found, and find some ridiculously large prime number? or is the condition variable, and it only sometimes gives a prime number? Or am I just completely misunderstanding this?

[Krinkels]

[QUOTE=Cheat_God;39487798]Couldn't we raise 2 to the new number we just found, and find some ridiculously large prime number? or is the condition variable, and it only sometimes gives a prime number? Or am I just completely misunderstanding this?[/QUOTE]

Not all 2^p - 1 are primes.
The smallest counterexample is the Mersenne number
M(11) = 2^11 − 1 = 2047 = 23 × 89.
The lack of any simple test to determine whether a given Mersenne number is prime makes the search for Mersenne primes a difficult task, since Mersenne numbers grow very rapidly.

[Hoob]

Something about the - 1 tickles me greatly.

It's such a simple thing attached to such a large and crazy number.

[Krinkels]

[QUOTE=TheBrokenHobo;39487827]Something about the - 1 tickles me greatly.

It's such a simple thing attached to such a large and crazy number.[/QUOTE]

If it were 2^x, it would be divisible by 2^n for n<x

[yawmwen]

[QUOTE=Shadaez;39487260]Brute force. I believe they basically try to divide it by all possible factors see if it has any factors. They probably have this method down very efficiently.[/QUOTE]

function primeFinder(i, x, prime) {
     x = //whatever number you want to evaluate
     i=2;
     prime = true;
     while(i<=Math.sqrt(x)) {
          if(x%i===0){
               prime=false;
               break;
          }
          else {
               i++;
          }
     }
     document.write(prime);
}

this is how i find prime numbers

[Shadaez]

[QUOTE=yawmwen;39488017]

function primeFinder(i, x, prime) {
     x = //whatever number you want to evaluate
     i=2;
     prime = true;
     while(i<=Math.sqrt(x)) {
          if(x%i===0){
               prime=false;
               break;
          }
          else {
               i++;
          }
     }
     document.write(prime);
}

this is how i find prime numbers[/QUOTE]

def primeCheck(n):
    primeList = []
    while n >= 1:
        x = int(n**.5)
        if n%2 != 0:
            if n%10 == 5:
                n -= 2
            while x > 1:
                if n%x == 0:
                    break
                x -= 1
            else:
                primeList.append(n)
        n -= 1
    else:
        return primeList

python, euler 5

[backwardspy]

[QUOTE=Riller;39487570]I've always wondered [I]why[/I] we search for the largest primes. What mathemathical significance do primes have that grant them this mysterious, white-whale sorta status for mathematicians, except for the whole division-by-itself-and-one thing. Do they do any other cool shit? Can I teach a prime to do a backflip?[/QUOTE]
Prime numbers are used in encryption, and bigger primes are better.
There's a whole lot more to it than that of course, and if you're interested then I highly recommend reading up on it. It's cool stuff!

[yawmwen]

[QUOTE=Chris220;39488107]Prime numbers are used in encryption, and bigger primes are better.
There's a whole lot more to it than that of course, and if you're interested then I highly recommend reading up on it. It's cool stuff![/QUOTE]

thanks to quantum computers that might not be true for much longer though. Shor's algorithm would supposedly turn our most secure encryptions into a triviality from what i'v read.

[editline]5th February 2013[/editline]

i'm no mathematician though... i like to make computers do all the math for me.

[backwardspy]

[QUOTE=yawmwen;39488159]thanks to quantum computers that might not be true for much longer though. Shor's algorithm would supposedly turn our most secure encryptions into a triviality from what i'v read.

[editline]5th February 2013[/editline]

i'm no mathematician though... i like to make computers do all the math for me.[/QUOTE]
I am fairly sure that is correct, the power that quantum computers are supposed to have is monumental. It wouldn't surprise me if they invalidate all our current encryption schemes.

[evilweazel]

Oh golly this thread makes me wish I could be interested in math somehow :v:

[Eltro102]

[QUOTE=Shadaez;39487260]Brute force. I believe they basically try to divide it by all possible factors see if it has any factors. They probably have this method down very efficiently.[/QUOTE]

only dividing it by the factors below it's square root, but there are a ton of other methods which can find if something is probably prime (maybe (possibly (hopefully)))

[booster]

This all kind of reminds me from the book "Contact" where they search for a message inside Pi by using supercomputers.

[sp]They find a circle made out of 0's and 1's, they call it the "artist's signature" IIRC. Amazing book.[/sp]

[Eltro102]

[QUOTE=Chris220;39488183]I am fairly sure that is correct, the power that quantum computers are supposed to have is monumental. It wouldn't surprise me if they invalidate all our current encryption schemes.[/QUOTE]

they still can't break the old one-time-pad though, and with quantum crypto-rape we'll probably get much safer quantum-based communications

[JohnnyMo]

[QUOTE=Baboo00;39487344]Not an expert, but I believe this 57,885,161 bits, so 14,471,291 bytes or 13.8 mb.[/QUOTE]

Came out to 16.6mb on my hard drive in .rtf so that's probably about right.

[editline]5th February 2013[/editline]

Who wants me to upload the number to filesmelt or somewhere? :v:

[Paintry]

[QUOTE=JohnnyMo1;39488270]Came out to 16.6mb on my hard drive in .rtf so that's probably about right.

[editline]5th February 2013[/editline]

Who wants me to upload the number to filesmelt or somewhere? :v:[/QUOTE]
I do!

I'm curious as to how long it'll take me to scroll through

[JohnnyMo]

[QUOTE=Jellyman;39488303]I do!

I'm curious as to how long it'll take me to scroll through[/QUOTE]

Link added to the OP.

[yawmwen]

73 pages of numbers on openoffice

[JohnnyMo]

[QUOTE=yawmwen;39488410]73 pages of numbers on openoffice[/QUOTE]

That must have been truncated. It's over 4,000 pages in Word for me.

[editline]5th February 2013[/editline]

17,425,170 digits. :v:

[yawmwen]

oh wow yea it was truncated. i don't feel like scrolling down to get all the pages so i'll assume it's similar to word