Yan Cui
I help clients go faster for less using serverless technologies.
This article is brought to you by
Save money on RDS by moving your dev environments to Neon serverless Postgres, with instant scaling, scaling to zero (and only 500ms cold start!), and the ability to branch your database as easily as creating a Git branch.
Problem
Consider all integer combinations of ab for $latex 2 \leq a \leq 5 $ and $latex 2 \leq b \leq 5$:
22=4, 23=8, 24=16, 25=32
32=9, 33=27, 34=81, 35=243
42=16, 43=64, 44=256, 45=1024
52=25, 53=125, 54=625, 55=3125
If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
How many distinct terms are in the sequence generated by ab for $latex 2 \leq a \leq 100$ and $latex 2 \leq b \leq 100$?
Solution
1 2 3 4 5 6 7 8 | let getCombos a b = [2I..a] |> List.collect (fun x -> [2..b] |> List.map (fun y -> (x, y)))let answer = getCombos 100I 100 |> List.map (fun (a, b) -> pown a b) |> List.sort |> Seq.distinct |> Seq.length |
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.