Who can write a program in least number of steps to check if a number is prime or not??Tell me quickly and write the logic.

Question

lets see who wins...

Answer 1

Here's my try:

https://code.sololearn.com/cdN85QmcpCae/?ref=app

Answer 2

nice try man but it will take n 'type' steps ,that means n+-k.

Answer 3

can anyone solve it in √n/2 steps??but the actual answer is much smaller.

Answer 4

This is my code, it uses only other prime numbers and the square root of n as a limit
https://code.sololearn.com/cn1cz2EdhtBP/?ref=app