Challenge #79: Find the Closest Prime Number

[DanielG]

Solved

[aaziz2]

solution attached

[tristank]

I just did a prime number challenge so I added some logic and made it into an app :D

Spoiler

[Tgigs]

My solution attached.

Used two iterative macros, one that checks the numbers up 1000 and one that checks the numbers down 1000.

Checks include sum of digits divisible by 3, and difference in sum of alternating digits divisible by 11, and divisibility by 2 and 5.

Not perfect approach but gets the job done

[sknman92]

my solution! created two iterative macros to find closest prime preceding and succeeding the input number. then batched

[snbandi]

My solution - Implemented using two macros. Nice exposure to all types of macros.

[Rob-Silk]

Solution attached below:

Spoiler

Opted to use the double iterative macro approach so that the looping can end early if a prime number is found rather than using a Generate Row based approach

Main app workflow:


First (outer) iterative macro:


Second (inner) iterative macro:


App input and output:

[Mikeimbi]

Challenge 79

[H_a_n_g_C_h_e_n__x3]

I find this fun