primes.c (a3552326dc11215a0a3fe0fe50f7389847ab9fde) primes.c (526473251ee3dd5ab71975d6b9780e00a4660b64)
1/*
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Landon Curt Noll.
7 *
8 * Redistribution and use in source and binary forms, with or without

--- 41 unchanged lines hidden (view full) ---

50 * By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo
51 *
52 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
53 *
54 * usage:
55 * primes [-h] [start [stop]]
56 *
57 * Print primes >= start and < stop. If stop is omitted,
1/*
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Landon Curt Noll.
7 *
8 * Redistribution and use in source and binary forms, with or without

--- 41 unchanged lines hidden (view full) ---

50 * By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo
51 *
52 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
53 *
54 * usage:
55 * primes [-h] [start [stop]]
56 *
57 * Print primes >= start and < stop. If stop is omitted,
58 * the value 4294967295 (2^32-1) is assumed. If start is
59 * omitted, start is read from standard input.
58 * the value 18446744073709551615 (2^64-1) is assumed. If
59 * start is omitted, start is read from standard input.
60 *
61 * validation check: there are 664579 primes between 0 and 10^7
62 */
63
64#include <capsicum_helpers.h>
65#include <ctype.h>
66#include <err.h>
67#include <errno.h>

--- 262 unchanged lines hidden --- 		60 *
61 * validation check: there are 664579 primes between 0 and 10^7
62 */
63
64#include <capsicum_helpers.h>
65#include <ctype.h>
66#include <err.h>
67#include <errno.h>

--- 262 unchanged lines hidden ---