. NIMMERS
EXERCISY 1.1
Use Euclid's division algorithm to find the HCF of
() 135 and 225
(1) 196 and 3220
Sh
Answers
Answered by
0
Step-by-step explanation:
a is an integer & b=3
a=3p+r where r=(0,1,2)
case1 : a=3p+0
a3=(3p)3
=27p3=9(3p3)+0;m=3p3
a3=9m
case 2 : a=3p+1
a3=(3p+1)3
=27p3+1+27p2+9p
=9(3p3+3p2+p)+1
=9m+1 where (m=3p3+3p2+p)
case 3 : a=3p+2
a3=(3p+2)2
=27p3+8+27p2+9p
=9(3p3+3p2+p)+8
=9m+8 wherem=3p3+3p2+p
hence proved
Answered by
0
Chapter 1 exercise 1.1 questions
1 135 and 225
Similar questions