Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #9917
| From | David Brown <david.brown@hesbynett.no> |
|---|---|
| Newsgroups | comp.programming |
| Subject | Re: Where can I find maximum primes < 2^n |
| Date | 2019-05-15 14:03 +0200 |
| Organization | A noiseless patient Spider |
| Message-ID | <qbgv6f$uft$1@dont-email.me> (permalink) |
| References | <qbgm2j$h9$1@news.albasani.net> |
On 15/05/2019 11:27, Bonita Montero wrote: > I need the largest prime that fits in a unsigned 64 bit integeger > to build hash-keys. Can anyone tell me a source for such primes > in the net? 10 seconds of googling gives: <https://primes.utm.edu/lists/2small/0bit.html>
Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Where can I find maximum primes < 2^n Bonita Montero <Bonita.Montero@gmail.com> - 2019-05-15 11:27 +0200 Re: Where can I find maximum primes < 2^n David Brown <david.brown@hesbynett.no> - 2019-05-15 14:03 +0200 Re: Where can I find maximum primes < 2^n Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-05-15 23:23 +0100
csiph-web