summaryrefslogtreecommitdiff
path: root/games/primes/primes.h
diff options
context:
space:
mode:
authorJens Schweikhardt <schweikh@FreeBSD.org>2003-01-01 18:49:04 +0000
committerJens Schweikhardt <schweikh@FreeBSD.org>2003-01-01 18:49:04 +0000
commit9d5abbddbf03791c777fed86500976ea3dd19245 (patch)
treef412dafc7d29429919e8770cdefeb37441fc1299 /games/primes/primes.h
parent3724136741436462897ae060c5547c43f8953e54 (diff)
downloadsrc-test-9d5abbddbf03791c777fed86500976ea3dd19245.tar.gz
src-test-9d5abbddbf03791c777fed86500976ea3dd19245.zip
Notes
Diffstat (limited to 'games/primes/primes.h')
-rw-r--r--games/primes/primes.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/games/primes/primes.h b/games/primes/primes.h
index f4a90fa1fd85b..fde2b83f3fa90 100644
--- a/games/primes/primes.h
+++ b/games/primes/primes.h
@@ -63,7 +63,7 @@ extern const ubig *const pr_limit; /* largest prime in the prime array */
/*
* To avoid excessive sieves for small factors, we use the table below to
- * setup our sieve blocks. Each element represents a odd number starting
+ * setup our sieve blocks. Each element represents an odd number starting
* with 1. All non-zero elements are factors of 3, 5, 7, 11 and 13.
*/
extern const char pattern[];