Scribd
Upload
11 views

Ch_01_Ex_01.1

The document provides exercises and solutions related to Euclid's division algorithm and its applications in finding the highest common factor (HCF) of pairs of integers. It also proves that any positive odd integer can be expressed in specific forms and demonstrates how the squares and cubes of positive integers relate to certain modular forms. The exercises include practical examples and proofs, illustrating the concepts of divisibility and remainders.

Uploaded by

maheshmarathi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Ch_01_Ex_01.1

The document provides exercises and solutions related to Euclid's division algorithm and its applications in finding the highest common factor (HCF) of pairs of integers. It also proves that any positive odd integer can be expressed in specific forms and demonstrates how the squares and cubes of positive integers relate to certain modular forms. The exercises include practical examples and proofs, illustrating the concepts of divisibility and remainders.

Uploaded by

maheshmarathi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Chapter – 1

Real Numbers

Exercise- 1.1
Q. 1 Use Euclid’s division algorithm to find the HCF of:
(i) 135 and 225

IS
(ii) 196 and 38220

D
(iii) 867 and 255

A N
Solutions: Concept used:

A O y
To obtain the HCF of two positive integers, say c and d, with c > d,

T I
we follow the steps below:

R p
Step 1: Apply Euclid’s division lemma, to c and d. So, we find whole

P CA Co
numbers, q and r such that c = dq + r, 0 ≤ r < d.
Step 2 : If r = 0, d is the HCF of c and d. If r ≠ 0, apply the division

© U t
lemma to d and r.

D o
Step 3 : Continue the process till the remainder is zero. The divisor at
this stage will be the required HCF.

E N
(i) We know that,

o
= 225>135

D
Applying Euclid’s division algorithm:
(Dividend = Divisor × Quotient + Remainder)
225 = 135 ×1+90
Here remainder = 90,
So, Again Applying Euclid’s division algorithm
135 = 90×1+45
Here remainder = 45,
So, Again Applying Euclid’s division algorithm
90 = 45×2+0
Remainder = 0,
Hence, HCF of (135, 225) = 45
(ii) We know that,
38220>196

S
So, Applying Euclid’s division algorithm

D I
38220 = 196×195+0 (Dividend = Divisor × Quotient + Remainder)
Remainder = 0

A N
Hence, HCF of (196, 38220) = 196

A O y
I
(iii)We know that,

R T p
867>255

P CA Co
So, Applying Euclid’s division algorithm

© U t
867 = 255×3+102 (Dividend = Divisor × Quotient + Remainder)
Remainder = 102

D o
So, Again Applying Euclid’s division algorithm

E N
255 = 102×2+51

o
Remainder = 51
So, Again Applying Euclid’s division algorithm

D
102 = 51×2+0
Remainder = 0
Hence,
(HCF 0f 867 and 255) = 51
Q. 2 Show that any positive odd integer is of the form 6q + 1, or 6q +
3, or 6q + 5, where q is some integer.
To Prove: Any Positive odd integer is of the form 6q + 1, 6q + 3, 6q +
5
Proof: To prove the statement by Euclid's lemma we have to consider
divisor as 6 and then find out the possible remainders when divided by
6 By taking,’ a’ as any positive integer and b = 6.

S
Applying Euclid’s algorithm
a=6q+r

D I
As divisor is 6 the remainder can take only 6 values from 0 to 5

A N
Here, r = remainder = 0, 1, 2, 3, 4, 5 and q ≥ 0

A O y
I
So, total possible forms are 6q + 0, 6q + 1, 6q + 2, 6q + 3, 6q + 4 and

R T p
6q + 5

P CA Co
6q + 0, (6 is divisible by 2, its an even number)
6q + 1, (6 is divisible by 2 but 1 is not divisible by 2, its an odd number)

© U t
6q + 2, (6 and 2 both are divisible by 2, its an even number)

D
6q + 3, (6 is divisible by 2 but 3 is not divisible by 2, its an odd number)

E N o
6q + 4, (6 and 4 both are divisible by 2, its an even number)
6q + 5, (6 is divisible by 2 but 5 is not divisible by 2, its an odd number)

o
Therefore, odd numbers will be in the form 6q + 1, or 6q + 3, or 6q+5

D
Hence, Proved.

Q. 3 An army contingent of 616 members is to march behind an army


band of 32 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?
Solution: Suppose, both groups are arranged in 'n' columns, for
completely filling each column,
The maximum no of columns in which they can march is the highest
common factor of their number of members. i.e. n = HCF(616, 32)
By using, Euclid’s division algorithm
616 = 32×19+8
Remainder ≠ 0

IS
So, again Applying Euclid’s division algorithm

D
32 = 8×4+0

A N
HCF of (616, 32) is 8.

O y
So, They can march in 8 columns each.

R A T I
Q. 4 Use Euclid’s division lemma to show that the square of any

p
positive integer is either of the form 3m or 3m + 1 for some integer m.

P CA Co
Solution:

© U t
To Prove: Square of any number is of the form 3 m or 3 m +1
Proof: to prove this statement from Euclid's division lemma, take any

D o
number as a divisor, in question we have 3m and 3m + 1 as the form

E N
So, By taking, ‘a’ as any positive integer and b = 3.
Applying Euclid’s algorithm a = bq + r.

D o
a = 3q + r
Here, r = remainder = 0, 1, 2 and q ≥ 0 as the divisor is 3 there can be
only 3 remainders, 0, 1 and 2.
So, putting all the possible values of the remainder in, a = 3q + r
a = 3q or 3q+1 or 3q+2
And now squaring all the values,
When a= 3qSquaring both sides we get,
a2 = (3q)2
a2 = 9q2
a2 =3 (3q2)
a2 = 3 k1
Where k1 = 3q2
When a = 3q+1Squaring both sides we get,a2 = (3q + 1)2

S
a2 = 9q2 + 6q + 1

D I
a2 =3( 3q2 + 2q )+ 1
a2 = 3k2 + 1

A N
Where k2 = 3q2 + 2q

A O y
I
When a = 3q+2

R T p
Squaring both sides we get, a2 = (3q + 2)2

P CA Co
a2 = 9q2 + 12q + 4

© U t
a2 = 9q2 + 12q + 3+1
a2 = 3(3q2 + 4q + 1) +1

D o
a2 = 3k3 + 1

E N
Where k3 = 3q2 + 4q + 1

o
Where k1, k2 and k3 are some positive integers

D
Hence, it can be said that the square of any positive integer is either of
the form 3m or 3m+1.

Q. 5 Use Euclid’s division lemma to show that the cube of any positive
integer is of the form 9m, 9m + 1 or 9m + 8.
Solution: Let a be any positive integer. Then, it is of the form 3q or,
3q + 1 or, 3q + 2.
We know that according to Euclid's division lemma:
a = bq + r So, we have the following cases:
Case I When a = 3q
In this case, we have
a3 = (3q)3 = 27q3 = 9(3q3 ) = 9m, where m = 3q3
Case II When a = 3q + 1

S
In this case, we have

D I
a3 = (3q + 1)3
⇒27q3 + 27q2 + 9q + 1

A N
⇒9q(3q2 + 3q + 1) + 1

A O y
I
⇒a3 = 9m + 1, where m = q(3q2 + 3q + 1)

R T p
Case III When a = 3q + 2

P CA Co
In this case, we have

© U t
a3 = (3q + 1)3
⇒27q3 + 54q2 + 36q + 8

D o
⇒9q(3q2 + 6q + 4) + 8

E N
⇒a3 = 9m + 8, where m = q(3q2 + 6q + 4)

o
Hence, a3 is the form of 9m or, 9m + 1 or, 9m + 8

You might also like