Let n be a positive integer such that no prime less then to √n divides n. Then, we have to prove that n is prime. Suppose n is not a prime integer. Then,We may write
n=ab where 1<a≤b
⇒a≤√n and b≥√n
Let p be a prime factor of a. Then p≤a≤√n and p | a
⇒ p | ab
⇒ p | n
⇒ a prime less than √n divides n
This contradicts our assumption that no prime less than √n divides n. So, our assumption is wrong. Hence, n is a prime.