Date: Wed, 30 Apr 1997 11:47:07 -0700 (MST) From: Terry Lambert <terry@lambert.org> To: narvi@haldjas.folklore.ee (Narvi) Cc: ponds!rivers@dg-rtp.dg.com, hackers@freebsd.org Subject: Re: namei & hash functions Message-ID: <199704301847.LAA02492@phaeton.artisoft.com> In-Reply-To: <Pine.BSF.3.95.970430101620.17281A-100000@haldjas.folklore.ee> from "Narvi" at Apr 30, 97 10:35:02 am
next in thread | previous in thread | raw e-mail | index | archive | help
> Nice? Well, there are *lots* of prime numbers one off from 2^n: > > 1, 2, 3, 5, 7, 17, 31, 61, 127, 257, 8191, 65537, 131072, 524287, etc. Heh. I'm wondering how you get an integer out of log2(n) for: 60/62 and 131071/131073 I also kind of wonder why the prime number 131072 has been so long undiscovered... Terry Lambert terry@lambert.org --- Any opinions in this posting are my own and not those of my present or previous employers.
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199704301847.LAA02492>