![]() |
![]() |
#1 |
23·191 Posts |
![]()
Hi, I have a question about work types. I wanted to make P-1 factoring, but the 50M size that the server often assignes me uses too many memory in the stage 2 for my PC. Then, in my status page, I tried to set my CPU to make P-1 on small numbers, but I saw that I will be able to do this only in the future. However in the result page I saw that some users is able to make this kind of P-1. Can someone write me what do I have to set to do this work. Thanks
|
![]() |
![]() |
#2 | |
"Forget I exist"
Jul 2009
Dumbassville
838410 Posts |
![]() Quote:
1) minimum memory for P-1 stage 2 is 300 MB if I recall 2)manual assignment might get past the small numbers limitation but not sure why you'd want to. |
|
![]() |
![]() |
![]() |
#3 |
Jun 2003
7×167 Posts |
![]()
The minimum amount of memory to get P-1 assignments is 300MB. If you cannot allow this much, then your machine is not suitable for this kind of work.
If you are willing to allow 300MB or more, but the amount the machine is actually takes is more than you want, then you can reduce this by changing the setting under Options/CPU. People who do P-1 on small numbers do not recieve these as assignments. Rather they trawl the database for exponents which have either never had P-1 done, or done to inadiquate bounds. This kind of work is best left to the experts. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Why is TFing small numbers harder? | casmith789 | Information & Answers | 4 | 2014-12-21 16:23 |
Use Msieve NFS for small numbers? | skan | Msieve | 8 | 2013-02-26 20:35 |
ECM on small Mersenne Numbers | Erich | PrimeNet | 16 | 2012-09-29 23:08 |
Strong Law of Small Numbers? | Christenson | Information & Answers | 36 | 2011-02-16 04:29 |
A new Strong Law of Small Numbers example | cheesehead | Math | 7 | 2009-02-06 20:49 |