A command-line Windows utility to generate prime numbers up to several hundred trillion (tested), via the segmented sieve method. In many ways, this is an upgrade of the BrainWave GetPrimeNumbers utility, and also functions as a CPU integer benchmark that can exercise from 1 to all of the CPU cores (tested up to 32 cores).
-q, --quiet ............... Hide the "Please Wait" message for large tests.
-b, --banner .............. Display banner information on each program execution.
-t, --strict-eval ......... Generate an error for invalid numbers, rather than going with the default (250000).
-s, --show-primes ......... Show all prime numbers found. (USE CAUTION HERE)
-x, --hexadecimal ......... Show found primes in hexadecimal.
-d, --debug-mode .......... Generates prime numbers using all processing modes.
-a, --always-segmented .... Use Segmented Sieve (rather than Simple Sieve) even for totals less than 20000.
-n, --no-count ............ Do not count the number of primes found (overrides -s and -d).
-p, --parallel ............ Use parallel processing routines, selecting from 2 to 16 threads.
-f, --force ............... Force parallel processing mode even if only ONE thread is selected (-P:1).
--isprime ............. Determine if the selected number is a prime number.
--factors ............. Print the list of factors of the selected number.
--primefactors ........ Indicate which factors are prime factors (implies --factors).
--benchmark ........... Time the execution of a single CPU plus a full processor load against a single number.
For more details, see:
PRIMEPLUS /??
Tested on Windows XP, 7, 8, 8.1, 10, and 11 (both x86 and x64)
Tested on Windows 2003, 2008-R2, 2012-R2, 2016, 2019, and 2022 (both x86 and x64)
Comments