0

# How to find prime number.

4 Answers

+ 8

Basically you check if a number x is a prime, by iterating through a loop from 2 to the square root of x and checking if the remainder (modulo) of a division of x by the iterated number is zero. If you find at least one such a case, the number is not prime.

+ 2

A prime number is a number greater than 1, whose only two whole-number factors are 1 and itself.
there is a lot of algorithm to find prime number ..
https://code.sololearn.com/cfq7NMFgUeyp/#cpp

0

a number that is divisible only by itself and 1 (e.g. 2, 3, 5, 7, 11)

0

Ok tnx from all my friends