Yan Cui
I help clients go faster for less using serverless technologies.
Problem
The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.
Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.
Solution
Note: the source code for both solutions are available on github here.
Brute Force
This solution runs in just over 29 seconds on my machine, not great, but within the 1 minute rule for Euler solutions.
Using Set intersections
Here’s an alternative solution, using set intersections.
This solution is slightly more efficient, running in just over 17 seconds on my machine.
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.