ACT NOW: The Alteryx team will be retiring support for Community account recovery and Community email-change requests Early 2026. Make sure to check your account preferences in my.alteryx.com to make sure you have filled out your security questions.
Learn more here
Weekly Challenges
Solve the challenge, share your solution and summit the ranks of our Community!Also available in | Français | Português | Español | 日本語
IDEAS WANTED
Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEA
I 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).
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.
