Project Euler – Problem 73 Solution


Consider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.

If we list the set of reduced proper fractions for d <= 8 in ascending order of size, we get:

1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8

It can be seen that there are 3 fractions between 1/3 and 1/2.

How many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for d ? 12,000?

Note: The upper limit has been changed recently.


open System.Numerics

// for each d, get the number of proper fractions that lie between 1/3 and 1/2
let getFractionsCount d =
    |> Seq.skipWhile (fun n -> n * 3I <= d)
    |> Seq.takeWhile (fun n -> n * 2I < d)
    |> Seq.filter (fun n -> BigInteger.GreatestCommonDivisor(n, d) = 1I)
    |> Seq.length

// ignoring 1-4, get the number of desired fractions for each dand add them up
let answer = [4I..12000I] |> getFractionsCount |> List.sum

Enjoy what you’re reading? Subscribe to my newsletter and get more content on AWS and serverless technologies delivered straight to your inbox.

Yan Cui

I’m an AWS Serverless Hero and the author of Production-Ready Serverless. I have run production workload at scale in AWS for nearly 10 years and I have been an architect or principal engineer with a variety of industries ranging from banking, e-commerce, sports streaming to mobile gaming. I currently work as an independent consultant focused on AWS and serverless.

You can contact me via Email, Twitter and LinkedIn.

Hire me.

Check out my new course, Complete Guide to AWS Step Functions.

In this course, we’ll cover everything you need to know to use AWS Step Functions service effectively. Including basic concepts, HTTP and event triggers, activities, design patterns and best practices.

Get Your Copy