Challenge #79: Find the Closest Prime Number

[Nicholas_Bignell]

https://youtu.be/e9cXnn81vZU

[Simonvm9114]

Here's my solution

スポイラ

[johnemery]

I really enjoyed this challenge. The "mathy" ones are always fun for me.

There are three potential cases here:

1. The given number is prime → outputs the same number.
2. The closest primes above and below the number are different distances from the number → output the closest.
3. The closest primes above and below the number are the same distance from the number → concatenate both into a comma-separated list.

スポイラ

Like most others, I built an iterative macro. It starts at the given number and counts one step up and down per iteration, checking each new value for primality. This could certainly be made much more efficient by paying attention to the parity of the given number, storing previously known primes from prior iterations, and so on.

[dashakir1]

Thanks JoeM.

[LindaLo]

Check out my solution!

It has one constraint that I only check numbers up 10000

And it allows to output more than one closest prime number to the input in case the difference between previous/ next Prime and Input is the same. 

[atcodedog05]

On a spree to binge complete weekly challenges
Adrenaline rush

I solved it using python tool

スポイラ

This is my solution
Check the workflow flow for the python code

[AndrewS]

#79

スポイラ

AppResult

[Jonathan-Sherman]

Challenge 79 is done!

スポイラ

So i went with an two iterative macro solution...and gave the option for the user to see both numbers or just the closest!

Interface:


Workflow:


Macro:


Iterative Macro:

[AngelosPachis]

My solution for challenge #79

スポイラ

[AlexC2]

solution attached.