Check out my new course Learn you some Lambda best practice for great good! and learn the best practices for performance, cost, security, resilience, observability and scalability.
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
let isEvenlyDivided(n, m) = n % m = 0 let isEvenlyDividedByAll(n, numbers) = numbers |> Seq.forall (fun x -> isEvenlyDivided(n, x)) let findSmallestCommonMultiple(numbers) = let max = Array.max(numbers) Seq.unfold (fun x -> Some(x, x + 1)) max |> Seq.filter (fun x -> isEvenlyDividedByAll(x, numbers)) |> Seq.head let commonMultiplier = findSmallestCommonMultiple [|1..20|]
Again, I build two functions to handle the logic of checking whether a number can be evenly divided by all the numbers in a supplied list. I have used another new function Seq.forall (I can’t find the MSDN doc for this function, but see List.forall instead) which tests each element in the list with the supplied predicate.
In order to find the smallest common multiple for all the numbers from 1 to 20, I first generated a sequence of all the natural numbers equal or greater than 20:
Seq.unfold (fun x –> Some(x, x + 1)) max // max is resolved to 20 by Array.max(numbers)
Then for each number I applied the predicate isEvenlyDividedByAll to see if it can be evenly divided by each of the numbers from 1 to 20, and finally, Seq.head returns the first element that matches the predicate and that’s our answer!
One last thing though, when you run this code you’ll see that it takes a rather long time to return. So to improve on the performance of this logic, you can add a small and yet effective step to only test numbers which are multiples of the largest number (20 in our case) in the list:
let findSmallestCommonMultiple(numbers) = let max = Array.max(numbers) Seq.unfold (fun x -> Some(x, x + 1)) 1 |> Seq.map (fun x -> x * max) |> Seq.filter (fun x -> isEvenlyDividedByAll(x, numbers)) |> Seq.head
Run the new findSmallestCommonMultiple function again and it now returns much much quicker :-)
I specialise in rapidly transitioning teams to serverless and building production-ready services on AWS.
Are you struggling with serverless or need guidance on best practices? Do you want someone to review your architecture and help you avoid costly mistakes down the line? Whatever the case, I’m here to help.
Check out my new course, Learn you some Lambda best practice for great good! In this course, you will learn best practices for working with AWS Lambda in terms of performance, cost, security, scalability, resilience and observability. Enrol now and enjoy a special preorder price of £9.99 (~$13).
Are you working with Serverless and looking for expert training to level-up your skills? Or are you looking for a solid foundation to start from? Look no further, register for my Production-Ready Serverless workshop to learn how to build production-grade Serverless applications!
Here is a complete list of all my posts on serverless and AWS Lambda. In the meantime, here are a few of my most popular blog posts.
- Lambda optimization tip – enable HTTP keep-alive
- You are thinking about serverless costs all wrong
- Many faced threats to Serverless security
- We can do better than percentile latencies
- I’m afraid you’re thinking about AWS Lambda cold starts all wrong
- Yubl’s road to Serverless
- AWS Lambda – should you have few monolithic functions or many single-purposed functions?
- AWS Lambda – compare coldstart time with different languages, memory and code sizes
- Guys, we’re doing pagination wrong