Date: Thu, 1 May 1997 00:22:18 +0300 (EEST) From: Narvi <narvi@haldjas.folklore.ee> To: Terry Lambert <terry@lambert.org> Cc: ponds!rivers@dg-rtp.dg.com, hackers@freebsd.org Subject: Re: namei & hash functions Message-ID: <Pine.BSF.3.95.970501001014.28347A-100000@haldjas.folklore.ee> In-Reply-To: <199704301847.LAA02492@phaeton.artisoft.com>
next in thread | previous in thread | raw e-mail | index | archive | help
On Wed, 30 Apr 1997, Terry Lambert wrote: > > 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... Well, as 131072 is obviously not one of from 2^n so it obviously must have been a typo and the prime number indeed is 131071. :-) (Damn all the typos.) I hope I didn't introduce any new errors just now - shouldn't be answering mails on the moment, there is Volber (Volgberg nacht (?) in German) out there. Sander > > > 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?Pine.BSF.3.95.970501001014.28347A-100000>