![]() |
|
|
#12 | |
|
Jun 2005
lehigh.edu
210 Posts |
Quote:
I spent some time on 17-or-bust, before it got bionc'd, and do recall that sieving's supposed to clear away composites; and can't actually settle one of the remaining how-ever-many are left (12? three being done on s-o-b; the rest on boinc/primegrid). I'm inclined towards a guess that while sieving can't settle one of the remaining main cases, if it is doing that by finding factors (of something; candidates and some other numbers of the same form) --- once-in-while one of the factors can be prime, yes? In any case, the main link on the primegrid Challenge reports that there were some 300 (prime?) factors found; one of my BOINCstats colleagues was saying that he had one, and now my account reports Code:
PrimeGrid PSP Sieve tasks Completed tasks 2396 Credit 70,817.71 Factors found 7 "PSP Sieve" (as instructed), but the factors found aren't classified as prime or composite. The boinc projects don't appear to be heavy on the maths (we try not to confuse our contributors on NFS@Home; Greg more successfuly than me). I was just wondering whether I could fish-out one of these "factors"; perhaps as an example for my intro crypto course this spring. -bdodson |
|
|
|
|
|
|
#13 | ||
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
10000101010112 Posts |
Quote:
Quote:
Of course. In fact, in a case like this, since you'll always have already sieved above the square root of a factor you're looking for, the factor will always be prime. But, we're not interested in whether the factors are prime or not. What we're interested in is what those factors (which'll be prime) divide. If they divide any of the numbers we're sieving, then when you run the sieve we'll know, and can eliminate that number from needing to be primality tested (e.g. LL test, LLR, Proth test, a PRP test, etc.). Sieving helps reduce the number of candidates that need full primality (or PRP) testing by finding factors, (which due to the method of searching and progress in something like the PSPsieve will always be prime) thereby proving the numbers (the candidates, not the factors) composite without a lengthy primality test. It's quite similar to TF for GIMPS and Mersenne numbers, if you're familiar with that. (in end results, i.e. factors or certainty that numbers have no factor below a certain point, not in other ways like the mathematical algorithm or the number of candidates searched at once) Both make the time to process a range much faster by looking for factors. There is one major difference: due to the fact that you can run an efficient TF on a single Mersenne number, (details are at http://mersenne.org/various/math.php if you're interested) it's better to test them one at a time (TFing) instead of in a large group (sieving). (Or at least I'm assuming so, since that's how everybody does it. )
Last fiddled with by Mini-Geek on 2009-11-16 at 13:13 |
||
|
|
|
|
|
#14 | |
|
Apr 2008
Oslo, Norway
3318 Posts |
Quote:
![]() EDIT: Got an answer from PG now... This is currently not a feature. Last fiddled with by opyrt on 2009-11-16 at 14:30 |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| PrimeGrid running a 3 day challenge on this Project | Joe O | Sierpinski/Riesel Base 5 | 1 | 2016-03-14 01:24 |
| It won't stop giving me ECM, help! | 137ben | PrimeNet | 5 | 2012-03-29 12:43 |
| The PrimeGrid Calendula Challenge | opyrt | Prime Sierpinski Project | 0 | 2010-09-21 21:20 |
| www.primegrid.com overloaded | nuggetprime | Twin Prime Search | 15 | 2007-03-18 05:41 |
| Anyone knows about primegrid | koders333 | Factoring | 8 | 2006-03-14 03:23 |