Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEAI decided to take a more dynamic approach and used an iterative macro.
It works for checking numbers up to 1 million (it does 1000 iterations for this as that is the square root of 1 million).
Sam
Here's a relatively straightforward solution.
However, it's not very feasible if we were to start with a larger number (>10000).
For scaling up, a better solution might be to use a batch macro that tests the divisibility of each new number by previously found prime numbers. I'm not sure if that's possible though.