Searched refs:primes (Results 1 – 5 of 5) sorted by relevance
| /coreutils/src/ |
| D | make-prime-list.c | 119 output_primes (const struct prime *primes, unsigned nprimes) in output_primes() argument
138 unsigned int d8 = i + 8 < nprimes ? primes[i + 8].p - primes[i].p : 0xff; in output_primes()
141 printf ("P (%u, %u,\n (", primes[i].p - p, d8); in output_primes()
142 print_wide_uint (primes[i].pinv, 0, wide_uint_bits); in output_primes()
143 printf ("),\n UINTMAX_MAX / %u)\n", primes[i].p); in output_primes()
144 p = primes[i].p; in output_primes()
155 if (primes[i].p * primes[i].p > p) in output_primes()
157 if (p * primes[i].pinv <= primes[i].lim) in output_primes()
|
| D | local.mk | 69 src/primes.h \
532 BUILT_SOURCES += $(top_srcdir)/src/primes.h
533 $(top_srcdir)/src/primes.h:
|
| /coreutils/tests/factor/ |
| D | factor-parallel.sh | 24 primes() { LC_ALL=C sed 's/.*: //; / /d'; } function
30 nprimes=$(seq 1e6 | odd | split -nr/4 --filter='factor' | primes | wc -l)
|
| /coreutils/ |
| D | .gitignore | 200 /src/primes.h
|
| /coreutils/doc/ |
| D | coreutils.texi | 18952 product of the eighth and ninth Mersenne primes (approximately
18977 are the product of two large primes), other methods are far better.
|