diff options
| author | Jason McIntyre <jmc@cvs.openbsd.org> | 2006-11-17 21:19:13 +0000 |
|---|---|---|
| committer | Jason McIntyre <jmc@cvs.openbsd.org> | 2006-11-17 21:19:13 +0000 |
| commit | f16620276a19f28a6252ec652060774429ec7615 (patch) | |
| tree | baa74d046d9d51fecefd2076f278a97c57f583f9 /bin/md5 | |
| parent | e3e828a3152c7915a7e93fce7eece8d5903dae02 (diff) | |
`<' -> \*(Lt
Diffstat (limited to 'bin/md5')
| -rw-r--r-- | bin/md5/cksum.1 | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/bin/md5/cksum.1 b/bin/md5/cksum.1 index 50054336ec0..39671d4a6c7 100644 --- a/bin/md5/cksum.1 +++ b/bin/md5/cksum.1 @@ -1,4 +1,4 @@ -.\" $OpenBSD: cksum.1,v 1.9 2006/11/17 21:16:54 jmc Exp $ +.\" $OpenBSD: cksum.1,v 1.10 2006/11/17 21:19:12 jmc Exp $ .\" .\" Copyright (c) 1991, 1993 .\" The Regents of the University of California. All rights reserved. @@ -212,7 +212,7 @@ first. The smallest number of octets capable of representing this integer are used. .Pp M(x) is multiplied by x^32 (i.e., shifted left 32 bits) and divided by -G(x) using mod 2 division, producing a remainder R(x) of degree <= 31. +G(x) using mod 2 division, producing a remainder R(x) of degree \*(Lt= 31. .Pp The coefficients of R(x) are considered to be a 32-bit sequence. .Pp |