Challenge #79: Find the Closest Prime Number

[JamesCharnley]

Spoiler

This will be far from the most efficient solution but it's fully dynamic as far as I can tell. One macro is doing the higher primes and the other is doing lower, before comparing.

[rachel_lynch]

Use a macro, or use an analytic app. Take your pick! :)

Spoiler

[RobertZiegl]

Spoiler

 

[Abiramm1]

N.B. I reckon I made this challenge a lot harder than I needed to

Spoiler

I used 2 iterative macros (1 to check if the number was prime and if not add 1 to it, and the other to do the same but -1 from it). This gave me the closest higher and lower prime numbers, then I subtracted them from the original number and took the one with the lowest difference as the final output (if they have the same difference then both are counted)

[ExploreMore]

Spoiler

  

[bkclaw113]

Used a combination of an iterative macro to keep looping until I found a solution with a batch macro nested inside which check each increasingly distance number from the starting point to see if it was prime.

[davidhardister]

Spoiler

[ahsanaali]

Spoiler

Spoiler

[Brian32]

Challenge Solution:

Spoiler

[grazitti_sapna]

Here is my solution.