Yan Cui
I help clients go faster for less using serverless technologies.
This article is brought to you by
Don’t reinvent the patterns. Catalyst gives you consistent APIs for messaging, data, and workflow with key microservice patterns like circuit-breakers and retries for free.
Problem
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.
Solution
open System.Numerics
// for each d, get the number of proper fractions that lie between 1/3 and 1/2
let getFractionsCount d =
[1I..d-1I]
|> 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] |> List.map getFractionsCount |> List.sum
Whenever you’re ready, here are 3 ways I can help you:
- Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for quickly levelling up your serverless skills.
- I help clients launch product ideas, improve their development processes and upskill their teams. If you’d like to work together, then let’s get in touch.
- Join my community on Discord, ask questions, and join the discussion on all things AWS and Serverless.