10th Maths 1.1
NCERT Class 10th solution of Exercise 1.2
NCERT Class 10th solution of Exercise 1.3
NCERT Class 10th solution of Exercise 1.4
NCERT Class 10th Maths Projects
Exercise 1.1
Q1. Use Euclid's division algorithm to find the HCF of:
i) 135135 and 225225 ii) 196196 and 3822038220 iii) 867867 and 255255
Sol.
By Euclid's division algorithm
a = bq + ra = bq + r
where
a = 225,a = 225,
b =135,b =135,
q = quotient and r = remainderq = quotient and r = remainder
225=135×1+90225=135×1+90
135=90×1+45135=90×1+45
90=45×2+090=45×2+0
Answer:
The HCFHCF of 135135 and 225225 is 4545.
ii)
By Euclid's division algorithm
a = bq + ra = bq + r
where
a = 38220,a = 38220,
b = 196,b = 196,
q = quotient and r = remainderq = quotient and r = remainder
38220=196×195+038220=196×195+0
Answer:
The HCFHCF of 196196 and 3822038220 is 196196.
iii)
By Euclid's division algorithm
a = bq + ra = bq + r
where
a = 867,a = 867,
b = 225,b = 225,
q = quotient and r = remainderq = quotient and r = remainder
867=225×3+102867=225×3+102
225=102×2+51225=102×2+51
102=51×2+0102=51×2+0
Answer:
The HCFHCF of 867867 and 225225 is 5151.
☝
Like, Share, and Subscribe.
Q2. Show that any positive odd integer is of the form 6q+16q+1, or 6q+36q+3, or 6q+56q+5, where q is some integer.
Sol.
Let aa and bb be positive integers.
By Euclid's division algorithm
a = bq + ra = bq + r
where
a = positive integer,a = positive integer,
b = 6 and r is remainder (0≤r<6)b = 6 and r is remainder (0≤r<6)
Therefore possible r=0,1,2,3,4,and5r=0,1,2,3,4,and5
6×q+0=6q6×q+0=6q
6×q+1=6q+16×q+1=6q+1
6×q+2=6q+26×q+2=6q+2
6×q+3=6q+36×q+3=6q+3
6×q+4=6q+46×q+4=6q+4
6×q+5=6q+56×q+5=6q+5
However since aa is odd aa cannot be 6q6q, 6q+26q+2 and 6q+46q+4 because these numbers are divisible by 22, these are even numbers.
Therefore, any positive odd integer is of the form 6q+1,6q+3,6q+56q+1,6q+3,6q+5
Proved.
Q3. An army contingent of 616616 members is to march behind an army band of 3232 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?
Sol.
To find maximum number of columns means we find HCF (616,32)HCF (616,32) by applying Euclid's algorithm,
a = bq + ra = bq + r
616=32×19+8616=32×19+8
32=8×4+032=8×4+0
Answer:
Thus, the required maximum number of column is 88.
Q4. Use Euclid's divisions lemma to show that the square of any positive integer is either of the form 3m3m or 3m+13m+1 for some integer mm.
Sol.
Let xx be any positive integer then it is of the form 3q,3q+1,3q+23q,3q+1,3q+2.
(3q)2=9q2(3q)2=9q2
(3q)2=3(3q)2(3q)2=3(3q)2
(3q)2=3m(3q)2=3m, where m is any positive integer.
(3q+1)2=9q2+6q+1
(3q+1)2=3q(3q+2)+1
(3q+1)2=3m+1, where m=q(3q+2) is a positive integer.
(3q+2)2=9q2+12q+4
(3q+2)2=9q2+12q+3+1
(3q+2)2=3(3q2+4q+1)+1
(3q+2)2=3(3q+1)(q+1)+1
(3q+2)2=3m+1, where m=(q+1)(3q+1) is a positive integer.
Thus, the square of any positive integer is either of the form 3m or 3m+1.
Proved.
Q5. Use Euclid's division lemma to show that the cubes of any positive integer is of the form 9m,9m+1 or 9m+8.
Sol.
Let x be any positive integer then it is the form 3q,3q+1,3q+2, where q is a positive integer.
(3q)3=27q3
(3q)3=9(3q3)
(3q)3=9m, where m=3q3 is a positive integer.
(3q+1)3=27q3+27q2+9q+1
(3q+1)3=9q(3q2+3q+1)+1
(3q+1)3=9m+1, where m=q(3q2+3q+1) is a positive integer.
(3q+2)3=27q3+54q2+36q+8
(3q+2)3=9q(3q2+6q+4)+8
(3q+2)3=9m+8, where m=q(3q2+6q+4) is a positive integer.
Thus, the cube of any positive integer is of the form 9m, 9m+1, 9m+8.
Proved.
Comments