tyler o.,when I get pass you. John P. Myers will be next.
tyler o.,
Nice post and nice crunching on NFS, I have a UOTD for today at Numberfields that is factorization also, is there any difference between the several projects of number theory? Because they are so many, what is different the search, the method or any other thing?
Maybe you don't know either but I think someone inside the projects should know.
Friends are like diamonds and diamonds are forever
First reading, that project has nothing to do with factorization.
Factorization is to factor a integer into two or more prime factors. Example: 15 is equal to 3 x 5, correct? 3 and 5 are one digit integers, prime numbers, only divisible by 1 or by themselves.
See it was easy. So in spite of what is being told that the projects do the same work and are duplicating the crunching to do exactly the same, that is not true. The work is very different and the conclusions are different tools to use in difference sciences.
No work is lost, they are not opening new projects to do the same work, no matter what it seems to us we don't have the enough knowledge to distinguish, what for us are small differences are completely different projects from the inside point of view.
A question of perspective. Thanks Carlos that was very useful.
Friends are like diamonds and diamonds are forever
The only two math projects that I am aware of doing double work was GIMPS vs Mersenne@home, the latter is closed (it was a waste of energy due to lack of knowledge by crunchers side), and probably now http://oproject.goldbach.pl/index.php vs http://www.ieeta.pt/~tos/goldbach.html. In contact with our fellow Tomás Oliveira he can't tell me for sure if there's double work on the goldbach conjecture because the former project doesn't publish very well the results. So he has lots of doubts.
John P. Myers is down, next is theflux.
3 and 5 are prime, but being 1 digit isn't part of it. 6 is a 1 digit composite number (divisable by 3 and 2), but 11 is a 2 digit number which can't be factored, hence prime. Prime Grid would be looking for some very large prime numbers.Originally Posted by pinhodecarlos
As to the question asked, different math projects would be, testing different theories and the like. So no, they aren't all the same....
You didn't understand what I said. First I was giving a easy example to be understood and then I said breaking a composite integer into prime factors, 11 is already a prime factor that is actually proven as a prime. Prime factor is difference than only saying prime.
Take a look at the latest result: 3,637- factors
The composite cofactor of 3,637- was the product of 85-digit and 127-digit prime numbers:
85-digit prime factor:
24362371790048691036429470508868735523952360071637 25889114267732351631395223998169289
127-digit prime factor:
12956206377215132913440461501990192401304695432213 25214558795515080650922339897532747195922323001636 473409360593989593377975691
Thanks go to M. Vang for performing the postprocessing. The factors have been reported to the Cunningham project and have been recorded on Page 125.
Last edited by pinhodecarlos; 09-23-12 at 04:32 AM.
In a simple way:
Primegrid looks for primes of the form N = k*b^n +/- 1, so they use a primality proving program called LLR.
NFS@Home, for the Cunningham Project (example), seeks to factor the numbers b^n +- 1 for b = 2, 3, 5, 6, 7, 10, 11, 12, up to high powers n, by finding PRP's. A PRP is a probable prime number, a number that nobody knows how to prove or disprove its primality. A PRP could probably be proven prime using either Primo or a distributed version of ECPP.
Anyway, I posted a list of references where you can study this matter.
Posting Permissions
Reply With Quote