Snippets tagged gcd
-
Project Euler #182
The RSA encryption is based on the following procedure: Generate two distinct primes p and q. Compute n=pq and phi=(p-1)(q-1). Find an integer e, 1
Like the snippet!Posted: 13 years ago by Natallie Baikevich
-
Enumerating the Rationals
How to enumerate the rational numbers without duplication using a Calkin–Wilf tree.
4 people like this
Like the snippet!Posted: 5 years ago by Brian Berns