Advertisements
Discrete semiprime m=pq=c2-r, where p<q are odd primes and c is the Ceiing Root of m: ceil(sqrt(m)) in Perl with POSIX library.
I decided to graph p/q vs. r/(2c) for various randomly-generated discrete semiprimes m.
“Clarice, doesn’t this random scattering of sites seem desperately random – like the elaborations of a bad liar?” – from The Silence of the Lambs
Leave a ReplyCancel reply