wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Prove that a positive integer n is prime number, if no prime p less than or equal to n divides n.

Open in App
Solution

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<ab
an and bn
Let p be a prime factor of a. Then pan 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.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Validity of Statements
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon