Problem 72 - Counting fractions

 - use a sieve algorithm to generate phi(n) for n in 1..1000000
 - faray length is then sum of phi - 1
Problem 73 - Counting fractions in a range

 - use recursive mediant counting method
 - Feels like a Phi function could be used here...