If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.
I start with the example of N=150. The algorithm:
- Set sum to 0.
- Loop from n=1 to N.
- if n is divisible by 3 or 5, add n to sum.
Things to consider:
- Do I want to match the algorithm perfectly? Then there wouldn't be different colours or levels, just "Add" or "Ignore".