is there only one Mersenne prime that ends in 3?

[T.Rex]

Originally Posted by ewmayer

Maybe we can get the crowd over at http://www.primegrid.com to try their hand at searching for the first-known Mersenne prime having the property that M(p) == 5 (modulo 10). *After* they've finished cracking RSA768 via brute-force trial division, naturally...

Have you noticed the "Ads by Goooooogle" at the bottom of their page, on the left ? Someone has found a technique for "Factoring primes" ! Interesting !
Can someone who masters English explain what this really mean ?
Tony

[xilman]

Originally Posted by T.Rex

Have you noticed the "Ads by Goooooogle" at the bottom of their page, on the left ? Someone has found a technique for "Factoring primes" ! Interesting !
Can someone who masters English explain what this really mean ?
Tony

It means one of two things, in my opinion.

It may mean that the person who wrote that does not have a clue when it comes to writing about integer factorization.

It may mean that the author and/or the editor responsible were not very good at finding an obviously omitted word. The phrase should be: Factoring into primes.


Paul

[fetofs]

Originally Posted by Greenbank

I notice their core is still hideously inefficient.

I wrote AND SENT THEM a 30 line GMP program which processed 1M candidate odd values in a matter of seconds (compared to theirs which took hours). They still aren't using it.

Anyway, a speed up of almost 5 orders of magnitude still does nothing when the size of the search space is up around 10^100.

But Greenbank, their main objective is not to factor integers (they aren't so stupid).
The main objective of the project is to test their programming skills(PerlBOINC). If they used your implementation there would be no sense at all in the project's existance.

[ewmayer]

Originally Posted by fetofs

But Greenbank, their main objective is not to factor integers (they aren't so stupid).
The main objective of the project is to test their programming skills(PerlBOINC). If they used your implementation there would be no sense at all in the project's existance.

I don't see why they couldn't hone their Perl or BOINC-related skills as they desire, while still making at least a small effort to not hideously waste their users' CPU cycles.

[Greenbank]

Exactly.

BOINC has a reasonable standing, by using it for something so futile, and not bothering to research an efficient implementation just puts BOINC in a bad light.

[Citrix]

Originally Posted by T.Rex

Have you noticed the "Ads by Goooooogle" at the bottom of their page, on the left ? Someone has found a technique for "Factoring primes" ! Interesting !
Can someone who masters English explain what this really mean ?
Tony

I think what he means is that he has found a way to factor primes ie. waste his CPU cycles like the people at "primegrid". Google really know where to put what ads

Anyway, I would recommend that the people at primegrid work on finding welfrich numbers or something like that. That way they can do some useful work and test their BOINC interface.


Citrix

[nibble4bits]

Is it the interface(compiler/interpeter) or the algorythm that's so slow? If it's the algorythm then they need to get cracking on translating yours.

[ColdFury]

Originally Posted by nibble4bits

Is it the interface(compiler/interpeter) or the algorythm that's so slow? If it's the algorythm then they need to get cracking on translating yours.

What's the point? We could speed it up a billion times and they're still not going to find anything.