No products in the cart.

Prove that a positive integer n …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

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

  • 1 answers

Sia ? 4 years, 10 months ago

According to the question,we have to prove that a positive integer n is prime number, if no prime p less than or equal to {tex}\sqrt{n}{/tex} divides n.

Let n be a positive integer such that no prime less than or equal to {tex}\sqrt {n}{/tex} 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 {tex}\leq{/tex} b
{tex}\Rightarrow \quad a \leq \sqrt { n } \text { and } b \geq \sqrt { n }{/tex}
Let p be a prime factor of a. Then, {tex}p \leq a \leq \sqrt { n } {/tex} and p|a
{tex}\Rightarrow \quad p | a b{/tex}
{tex}\Rightarrow \quad p | n{/tex}
{tex}\Rightarrow{/tex} a prime less than {tex}\sqrt {n}{/tex} divides n.
This contradicts our assumption that no prime less than {tex}\sqrt {n}{/tex} divides n.
So, our assumption is is wrong. Hence, n is a prime.

http://mycbseguide.com/examin8/

Related Questions

3.11stques
  • 0 answers
What is homogeneous liner equation?
  • 0 answers
Ch 3 ex 3.3
  • 2 answers
a+b ka hool square
  • 1 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App