Use Euclid’s division algorithm to find the HCF of: (i)135 and
zigya tab

Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8.


Let a and b be two positive integergs such that a is greater than b; then :

a = bq + r;

where q and r are positive integers 0 ≤ r < b.

Taking b = 3, we get

a = 3q + r ; where 0 ≤ r < 3.

⇒ Different values of integer a are 3q, 3q + 1 or 3q + 2.

Cube of 3q = (3q)3

= 27q3 = 9(3q3) = 9m ;

where m is some integer.

Cube of 3q + 1 = (3q + 1)3

= (3q + 3(3q)2 × 1 + 3(3q) × 12+ l3

[∵ (a + b)3 = a3 + 3a2b + 3ab2 + 1]

= 27q3 + 27q2 + 9q + 1

= 9(3q3 + 3q2 + q) + 1

= 9m + 1; where m is some integer.

Cube of 3q + 2 = (3q + 2)3

= (3q)3 + 3(3q)2 × 2 + 3 × 3q × 22 + 23

= 27q3 + 54q2 + 36q + 8

= 9(3q3 + 6q2 + 4q) + 8 = 9m + 8; where m is some integer.

∴ Cube of any positive integer is of the form 9m or 9m + 1 or 9m + 8.

3180 Views

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?


Given integers are 32 and 616.

Clearly 616 > 32. Therefore, applying Euclid’s division lemma to 616 and 32, we get


Given integers are 32 and 616.
Clearly 616 > 32. Therefore, apply

Since, the remainder 8 ≠ 0, we apply the division lemma, to get


Given integers are 32 and 616.
Clearly 616 > 32. Therefore, apply

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 8.

Therefore, the maximum number of columns in which both 616 members (army contingent) and 32 members (army band) can march is 8.

 

1139 Views

Advertisement

Use Euclid’s division algorithm to find the HCF of:

(i)135 and 225 (ii) 196 and 38220.


(i) Given integers are 135 and 225, clearly 225 > 135. Therefore, by applying Euclid’s division lemma to 225 and 135, we get


(i) Given integers are 135 and 225, clearly 225 > 135. Therefore,

If. Since, the remaindei 90 ≠ 0, we apply division lemma to 135 and 90, to ge.


(i) Given integers are 135 and 225, clearly 225 > 135. Therefore,
We consider the new divisor 90 and new remainder 45 and apply division lemma to get


(i) Given integers are 135 and 225, clearly 225 > 135. Therefore,

The remainder of this step is zero. So, the divisor at this stage or the remainder at the previous stage i.e., 45 is the HCF of 135 and 225.

(ii) Given integers are 196 and 38220. Therefore by applying Euclid’s division lemma to 196 and 38220, we get



(i) Given integers are 135 and 225, clearly 225 > 135. Therefore,

The remainder at this step is zero. So. our procedures stops and divisor at this stage i.e. 196 is the HCF of 196 and 38220.



3449 Views

Advertisement

Use Euclid’s division lemma to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.


Let a be any positive integer. Let q be the quotient and r be remainder. Then a = bq + r where q and r are also positive integers and 0 ≤ r < b

Taking b = 3, we get

a = 3q + r; where 0 ≤ r < 3

When, r = 0 = ⇒ a = 3q

When, r = 1 = ⇒ a = 3q + 1

When, r = 2 = ⇒ a = 3q + 2

Now, we have to show that the squares of positive integers 3q, 3q + 1 and 3q + 2 can be expressed as 3m or 3m + 1 for some integer m.

⇒ Squares of 3q = (3q)2

= 9q2 = 3(3q)2 = 3 m where m is some integer.

Square of 3q + 1 = (3q + 1)2

= 9q2 + 6q + 1 = 3(3q2 + 2 q) + 1

= 3m +1, where m is some integer

Square of 3q + 2 = (3q + 2)2

= (3q + 2)2

= 9q2 + 12q + 4

= 9q2 + 12q + 3 + 1

= 3(3q2 + 4q + 1)+ 1

= 3m + 1 for some integer m.

∴ The square of any positive integer is either of the form 3m or 3m + 1 for some integer m.

1156 Views

Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer.


Let a be any odd positive integer and b = 6. Let q be a quotient and r be remainder.

Therefore, applying division lemma, we have 


Let a be any odd positive integer and b = 6. Let q be a quotient and

1206 Views

Advertisement