1 /* Classify numbers as probable primes, primes or composites.
2 With -q return true if the following argument is a (probable) prime.
4 Copyright 1999, 2000, 2002, 2005 Free Software Foundation, Inc.
6 This program is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free Software
8 Foundation; either version 3 of the License, or (at your option) any later
11 This program is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
13 PARTICULAR PURPOSE. See the GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License along with
16 this program. If not, see http://www.gnu.org/licenses/. */
26 print_usage_and_exit ()
28 fprintf (stderr, "usage: %s -q nnn\n", progname);
29 fprintf (stderr, "usage: %s nnn ...\n", progname);
34 main (int argc, char **argv)
42 print_usage_and_exit ();
46 if (argc == 3 && strcmp (argv[1], "-q") == 0)
48 if (mpz_set_str (n, argv[2], 0) != 0)
49 print_usage_and_exit ();
50 exit (mpz_probab_prime_p (n, 5) == 0);
53 for (i = 1; i < argc; i++)
56 if (mpz_set_str (n, argv[i], 0) != 0)
57 print_usage_and_exit ();
58 class = mpz_probab_prime_p (n, 5);
59 mpz_out_str (stdout, 10, n);
61 puts (" is composite");
63 puts (" is a probable prime");