Finding_prime_number

#1

inside bool function in else condition please explain the cocept i*I<=n

#2

i * i <=n is same as i<= squareroot(n)
To find the factors of a number…you just have to iterate from 2 to squareroot(n)…all factors after this till n will be the repeated ones and will already be considered in the first case. Watch the video again. It is very clear in that.