Lines Matching defs:factor
208 ubig factor; /* index and factor */
244 for (p = &prime[0], factor = prime[0];
245 factor < stop && p <= pr_limit; factor = *(++p)) {
246 if (factor >= start) {
247 printf(hflag ? "%" PRIx64 "\n" : "%" PRIu64 "\n", factor);
263 * factor out 3, 5, 7, 11 and 13
266 factor = (start%(2*3*5*7*11*13))/2; /* starting copy spot */
267 memcpy(table, &pattern[factor], pattern_size-factor);
269 for (fact_lim=pattern_size-factor;
279 /* note highest useful factor and sieve spot */
288 factor = 17; /* 17 is first prime to use */
291 /* determine the factor's initial sieve point */
292 mod = start%factor;
294 q = &table[(factor-mod)/2];
296 q = &table[mod ? factor-(mod/2) : 0];
298 /* sive for our current factor */
299 for ( ; q < tab_lim; q += factor) {
302 factor = *p++;
303 } while (factor <= fact_lim);