Challenge #79: Find the Closest Prime Number

[FrederikE]

Spoiler

[SkomantasTamulaitis]

Here's my solution.

Spoiler

[karlhansen]

Spoiler

This solution considers primes greater than the number.  Oh -- and "sum factors" should be "count factors".

Again, I did not build an app.  I will go do it, but I will not show it here.  This flow logic remains intact, even with an app. 

[BS_THE_ANALYST]

Fun challenge. First time I've used iterative macros within macros. Also, within the iterative macro there was a macro. Certainly not the cleanest, strung together method. But it was great fun whilst learning macros. If a number has primes of equal distance above and below it. It will find both. 

[kristiadiuisan]

Spoiler

[leonhekkert]

That took me very long. But proud that I got there :)

Spoiler

[ckelley0]

I went a different route. This is my first iterative Macro :)

Spoiler

spoiler alert

[alacoume]

At this stage, i find more useful to code in R than in Altéryx!

Spoiler

 

[Flo_P]

Spoiler

Didn't feel like making an app, but instead built it in Python and learned how to use the corresponding tool.

[Ladarthure]

my solution