Challenge #79: Find the Closest Prime Number
- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Mute
- Printer Friendly Page
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
When I first heard about this challenge during this year's Inspire conference, I honestly thought it sounded impossible. Happy to report that I completed the whole challenge without peeking at the posted solutions first! Sorry, a little braggy today.
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
Awesome exercise, excited and happy to share my comments as it is finished today. Slightly different approach but totally enjoyed achieving the expected results of app and macro outputs.
These exercises are the corner stone of my foundation in Alteryx. Long hours are worth the effort when there is a learning that involve more conceptual development. This was my first achievement wherein App and macro are paired together to achieve the output. Packaged workflow is attached for reference.
Thanks to all the SMEs. Always grateful to be part of this community.
Regards,
Pratik
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
It works, but not the best interface.
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
I created an application to check first the number given and then the number immediately before and after the given value. By generating rows I was able to identify all possible values and their divisor per value between 1 and the given value. Basically checking to see all the values between 1 and the given value where they are prime and then used a final formula tool to see which value is the closest prime. I used some final reporting tools to output a small table regarding the given value, if it was prime, and what is the closest prime value if it wasn't the selected value.
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator