Find the smallest numbers a, b, and c such that: a^2 = 2b^3 = 3c^5 What can you say about other solutions to this problem?
How many divisors does factorial n (n!) have?
An introduction to the ideas of public key cryptography using small numbers to explain the process. In practice the numbers used are too large to factorise in a reasonable time.