Challenge #79: Find the Closest Prime Number

[Watermark]

Decided to make an app where you enter any number less than 100k

Spoiler

 

[TonyAndriani]

Reposting under my new user ID.

[Rwebber1991]

I may have taken the long way with two iterative macros but we got it done!

[binuacs]

solution attached

[SylwiaDragon]

I started with challenge 187 first, and it helped a lot with solving this one :)

[mmontgomery]

Challenge #79

[scoles0617]

My solution:

[ddiesel]

Super fun challenge!

My solution:

Spoiler

As I was building this I knew it was wildly inefficient... but it works. Now I'm going to RUN to go read all the brilliant submissions to this challenge.

I set the limit arbitrarily to a maximum of 10,000. If a number is equal distance from two prime numbers, it will return both.

[DataNath]

My solution for #79. Not fully dynamic as it adopts the 6n +/- 1 approach, but a little strapped for time. In reality could just generate a full list of divisors based on generating rows from 1 to n where n is the number in question, and counting the number of times the number/divisor is 1.

Spoiler

[aiahwieder]

PRIIIIIIIIIIIIIIIIIIIIIIIIIIME