| http://www.w3.org/ns/prov#value | - Here it is:#!/usr/local/bin/io/* * Find prime numbers. See usage for more information. * * Author: JJ Behrens * Date: Sat Nov 5 19:50:21 PST 2005 * Copyright: (c) JJ Behrens * Description: * * The algorithm used to determine if a given number, n, is prime is to keep a * list of pairs (p, mc) where each p is a prime less than n and each mc is n * % p. If n is prime, then no mc is 0. The effe
|
