From 30ef9631c5eac7f8254bd3d7ad274d34d9f518b8 Mon Sep 17 00:00:00 2001 From: rgrimes Date: Tue, 30 May 1995 03:37:36 +0000 Subject: Remove trailing whitespace. --- games/primes/pattern.c | 4 ++-- games/primes/pr_tbl.c | 2 +- games/primes/primes.c | 6 +++--- 3 files changed, 6 insertions(+), 6 deletions(-) (limited to 'games/primes') diff --git a/games/primes/pattern.c b/games/primes/pattern.c index 5d65dab..14eb721 100644 --- a/games/primes/pattern.c +++ b/games/primes/pattern.c @@ -45,8 +45,8 @@ static char sccsid[] = "@(#)pattern.c 8.1 (Berkeley) 5/31/93"; * * chongo /\oo/\ * - * To avoid excessive sieves for small factors, we use the table below to - * setup our sieve blocks. Each element represents a odd number starting + * To avoid excessive sieves for small factors, we use the table below to + * setup our sieve blocks. Each element represents a odd number starting * with 1. All non-zero elements are factors of 3, 5, 7, 11 and 13. */ diff --git a/games/primes/pr_tbl.c b/games/primes/pr_tbl.c index b7b8d04..dcad3aa 100644 --- a/games/primes/pr_tbl.c +++ b/games/primes/pr_tbl.c @@ -45,7 +45,7 @@ static char sccsid[] = "@(#)pr_tbl.c 8.1 (Berkeley) 5/31/93"; * * chongo /\oo/\ * - * We are able to sieve 2^32-1 because this table has primes up to 65537 + * We are able to sieve 2^32-1 because this table has primes up to 65537 * and 65537^2 > 2^32-1. */ diff --git a/games/primes/primes.c b/games/primes/primes.c index 706576b..a402be2 100644 --- a/games/primes/primes.c +++ b/games/primes/primes.c @@ -86,15 +86,15 @@ char table[TABSIZE]; /* Eratosthenes sieve of odd numbers */ /* * prime[i] is the (i-1)th prime. * - * We are able to sieve 2^32-1 because this byte table yields all primes + * We are able to sieve 2^32-1 because this byte table yields all primes * up to 65537 and 65537^2 > 2^32-1. */ extern ubig prime[]; extern ubig *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 + * To avoid excessive sieves for small factors, we use the table below to + * setup our sieve blocks. Each element represents a odd number starting * with 1. All non-zero elements are factors of 3, 5, 7, 11 and 13. */ extern char pattern[]; -- cgit v1.1