![]() |
|
|
#1 |
|
Jun 2003
1116 Posts |
Please
I have an AMD DURON 1.0 Giga, 128 MB RAM. I placed PRIME95 to use 30 MB of memory, but he does not use anymore than 2 MB. When I initiate PRIME95 he tells "Resuming Factoring M33518297 to 2^68". At the moment I am in 90% of 2^67. hitherto he did not carry anymore than 3 days. To do 2^67, he does every 9 minutes 0.45%. Whereby understood, he is going to work up to 2^68, have been dressing in the site that the search for a great number thus can carry much time, you can tell, do it whereby have you past how long should carry? Am I right? Is the program going to stop in 2^68? I am finding fast, regarding that was in the site, am finding very fast, at least hitherto I hope that is notmattered with my bad English. A hug. Moises Deangelo lewris@ig.com.br ICQ:89529510 |
|
|
|
|
|
#2 |
|
Aug 2002
Termonfeckin, IE
24×173 Posts |
Moises,
After the program factors to 2^68 it will do what is called a Lucas-Lehmer or LL test. The LL test will take a very long time. You have chosen to test a 10 million digit exponent which will take 3-4 months on a Duron. |
|
|
|
|
|
#3 |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22·3·641 Posts |
After Prime95 finishes trial-factoring (what the messages call just "Factoring") to 2^68, and if it did not find a factor before that limit, it will perform a second factoring run called "P-1".
The P-1 factoring limits will be something like B1=380000, B2=8645000 (or either of those numbers could be different, but B1 will probably be in the 300000-420000 range and B2 will probably be in the range of 3000000-12000000). P-1 factoring will have a Stage 1 and a Stage 2, and will take several days. During P-1 Stage 2, you will see Prime95 use that 30MB of memory you allowed it. At the end of P-1 Stage 1 and of P-1 Stage 2, there will be a short (an hour or less, probably) step called GCD. After the Stage 1 GCD, P-1 will start its Stage 2. Then after the Stage 2 GCD, and if Prime95 has not found a factor yet, THEN it will start the L-L test. So the sequence will be: Trial factoring ("Factoring") up to 2^68 P-1 stage 1 P-1 stage 1 GCD P-1 stage 2 (lots of memory use here) P-1 stage 2 GCD L-L test |
|
|
|
|
|
#4 | |
|
Feb 2003
2·3·13 Posts |
Quote:
|
|
|
|
|
|
|
#5 |
|
"GIMFS"
Sep 2002
Oeiras, Portugal
2×7×113 Posts |
Moises:
Em português nos entendemos... benvindo ao projecto GIMPS! Como foi dito, o programa tenta encontrar factores de várias maneiras antes de começar o teste de Lucas-Lehmer, que no caso de um expoente como o que escolheste pode levar muito tempo. Se se encontrar um factor, poupam-se dois testes: o original e o Double-check. O limite para o trial factoring varia conforme o expoente escolhido, para um 33M é 2^68. A 2ª fase do teste de P-1 será tanto mais eficaz (a probabilidade de se encontrar um factor aumenta) quanto mais memória se der ao programa para usar. Boa sorte! I apologize to everybody for having done this one in portuguese, but I couldn´t help it... ;) . And I´m sure that with a little effort you all will be able to figure out what´s in it! |
|
|
|
|
|
#6 | |
|
Jan 2003
North Carolina
111101102 Posts |
Quote:
No problem. My parents are Dutch, but I only know enough of the langauge to look a bit foolish in Holland. I love the joke my cousins have teased me with since we were teenagers. "Smart Europeans know four languages, average ones know three, dumb Europeans know only two languages, and Americans only know one." To which I come back saying "yeah, and we have all the great looking women." :D |
|
|
|
|
|
|
#7 |
|
Jun 2003
17 Posts |
Hi All.
I was glad with so much people helping me to solve that that little understand. Now that already I managed to understand a little am going to most double or to triple memoria quantity for the prime95. The only thing that would like to know, it if for all of these processes is I have to configure anything? Or does the program go automatically verify all this? And during P1, P2 or LL, if is the machine turned off her will continue of where stopped? A special gratefulness the: lycorn nomadicus nitro cheesehead garo Thanks. PS: Lycorn: Espero poder contar com você quando tiver dúvidas. Por respeito a maioria postei as mensagens em inglês. Inglês ruim, mas é. E obrigado por me ajudar, foi uma mão na roda sua explicação. Moises Deangelo lewris@ig.com.br ICQ:89529510 |
|
|
|
|
|
#8 | |||
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
769210 Posts |
Quote:
Quote:
Quote:
PS: I hope to visit Brazil sometime. :) |
|||
|
|
|
|
|
#9 | |
|
Feb 2003
10011102 Posts |
Quote:
|
|
|
|
|
|
|
#10 | |
|
Banned
"Luigi"
Aug 2002
Team Italia
5·7·139 Posts |
Quote:
We know no language at all, but have the most beautiful women from the other countries... ;) Luigi |
|
|
|
|
|
|
#11 | |
|
Jan 2003
North Carolina
111101102 Posts |
Quote:
That settles it. No more putting it off: I am going to Europe again next year. I'll visit around Holland, take you up on your offer to get together, we can go out for a couple of nights checking out the women from other countries. . . Right? :D Afterall, that's the only way I can verify your statement. ;) john |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| How long is too long? | ThomRuley | Msieve | 3 | 2013-11-30 04:52 |
| Using long long's in Mingw with 32-bit Windows XP | grandpascorpion | Programming | 7 | 2009-10-04 12:13 |
| I think it's gonna be a long, long time | panic | Hardware | 9 | 2009-09-11 05:11 |
| Carry on up the Khyber | davieddy | Soap Box | 1 | 2009-04-27 11:59 |
| How long is too long? | schickel | Lounge | 2 | 2009-02-22 12:31 |