...But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases:
31213 which is 7 * 7 * 7 * 7 * 13
336141 which is 3 * 3 * 13 * 13 * 13 * 17
Who can explain, why?
Fast and more random implementations of java.util.Random.
...Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations.
Requires Java 5 or later.
Also available on github since 2015/12/13:
https://github.com/jeffhain/jafaran
Principal classes:
- Implementations using Mersenne-Twister algorithm (good pseudo-randomness):
MTSyncRNG
MTSeqRNG
- Implementations using Marsaglia Xor-Shift (fast):
MXSIntSeqRNG (32 bits)
MXSLongSeqRNG (64 bits) (nextLong() faster, larger period)
- Ziggurat: Random-based implementation of Ziggurat algorithm.
VB and JavaScript code which validates 10 and 13 digit ISBN, and converts between ISBN-10 and ISBN-13 (only ISBN-13 beginning with 978 can be converted to ISBN-10). May be useful during the January 2007 world-wide changeover to ISBN-13.
It software decodes EAN-13 bar code picture by image processing. And a GUI is ship together with it, which can take picture from web camera. So the only thing you need to recognise barcode apart you computer is a webcam.
Full-stack observability with actually useful AI | Grafana Cloud
Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.
Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.