Skip to content
Philoid
Browse Saved
Back to chapter
Maths
1. Euclids Algorithm and Real Numbers
Home · Class 10 · Maths · Ref. Book · 1. Euclids Algorithm and Real Numbers
Prev
Next
Q4 of 128 Page 18

Prove that following numbers are irrational:

Let be a rational number.

Therefore,, where g. c. d(a, b) = 1 and a, b N.




Now, squaring both sides


……. eq (1)


5 | a2


5 | a


Now, let a = 5k, k N



So, b = 5k


5 | b



It is a contradiction as g. c. d (a, b) = 1


So, our assumption is wrong.


Therefore, is irrational.


More from this chapter

All 128 →
3

Find g. c. d. and l.c.m.. :

40, 60, 80

3

Find g. c. d. and l.c.m.. :

49, 42, 91

4

Prove that following numbers are irrational:

4

Prove that following numbers are irrational:

.

Questions · 128
1. Euclids Algorithm and Real Numbers
1 2 3 4 5 6 1 1 1 2 3 4 1 1 1 1 2 2 2 2 3 3 3 4 4 4 4 4 5 6 7 8 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43 43
Back to chapter
ADVERTISEMENT
About Contact Privacy Terms
Philoid · 2026
  • Home
  • Search
  • Browse
  • Quiz
  • Saved