+2 votes
in Mathematics by (21.1k points)
edited by
If p is a prime number, then prove that √p is irrational.

1 Answer

+5 votes
by (13.5k points)
selected by
Best answer

Let us assume, to the contrary, that √p is
So, we can find coprime integers a and b(b ≠ 0)
such that √p = a/b
=> √p b = a
=> pb2 = a2 ….(i) [Squaring both the sides]
=> a2 is divisible by p
=> a is divisible by p
So, we can write a = pc for some integer c.
Therefore, a2 = p2c2 ….[Squaring both the sides]
=> pb2 = p2c2 ….[From (i)]
=> b2 = pc2
=> b2 is divisible by p
=> b is divisible by p
=> p divides both a and b.
=> a and b have at least p as a common factor.
But this contradicts the fact that a and b are coprime.
This contradiction arises because we have
assumed that √p is rational.
Therefore, √p is irrational.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.