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
Spoiler
This one was fun.
I didn't go with the macro route. I just made the assumption that the prime number would occur within 11 plus or minus the given number. I then add a row for each number below that set of numbers and find the ones where the module is 0 only once. Then to find the closest, I take the difference between that list and the given number and keep only the lowest difference.
P.S. the community page isn't letting me post the .yxwz file so I had to export it before attaching to this post.
I didn't go with the macro route. I just made the assumption that the prime number would occur within 11 plus or minus the given number. I then add a row for each number below that set of numbers and find the ones where the module is 0 only once. Then to find the closest, I take the difference between that list and the given number and keep only the lowest difference.
P.S. the community page isn't letting me post the .yxwz file so I had to export it before attaching to this post.
