Challenge #79: Find the Closest Prime Number

[JoeM]

View last week's challenge HERE.

This week's challenge is simple to grasp, but more difficult to execute. This week, let's make an application that finds the closest prime number to a users input.

 

A prime number is a number that has two positive divisors - 1 and itself.

Without the use of a lookup table, please build an app that takes a user-entered number and returns the closest prime number to the entered number.

Fun fact:  this post went live on 07/31/2017 - a very prime day indeed!

[Hitch]

Apologies. Please ignore previous post the attachment was incomplete.

This time I've attached a package which includes the macro!

[michael_leoni]

Please see my solution below. 

[tammybrown_tds]

Challenge 79

[mikeprice17]

Could have built in additional functionalities but It was my 4th challenge of the day so just happy to wrap up haha.

[Tokimatsu]

Solved.

Spoiler

 

[Tyro_abc]

Spoiler

[clmc9601]

My solution. I am getting much more comfortable with generate rows!

[BeginnerMindset]

Spoiler

Spoiler

[duartepimentel]

Solution attached! Interesting one

[Sashikumar]

I solved but I used the solution for my understanding.

Spoiler