Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #9918
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | comp.programming |
| Subject | Re: Where can I find maximum primes < 2^n |
| Date | 2019-05-15 23:23 +0100 |
| Organization | A noiseless patient Spider |
| Message-ID | <87y337jr0r.fsf@bsb.me.uk> (permalink) |
| References | <qbgm2j$h9$1@news.albasani.net> |
Bonita Montero <Bonita.Montero@gmail.com> writes: > 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? That's been answered, but there are also many programs that can tell you. For example, it's common for computer maths programs to have next and previous prime functions. For example, GP/PARI reports ? precprime(2^64 - 1) %1 = 18446744073709551557 as does Maxima. -- Ben.
Back to comp.programming | Previous | Next — Previous 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