MC120200988

Assignment 3 Of MTH202 (Spring 2012)

Maximum Marks: 15
Due Date: 12-06-2012
Question 1

Mark: 5

Find a common fraction for the recurring decimal 1.53 .

Solution 1:
1.53 = 1.53535353
= 1.53+0.0053+0.000053+0.00000053+
= 1+.53+0.0053+0.000053+0.00000053+
= 1+ (.53+0.0053+0.000053+0.00000053+) .. (1)
(.53+0.0053+0.000053+0.00000053+) This is infinite geometric series with
0.0053
a = 0.53, r
, r 0.01
0.53
a
Sum
1 r
0.53

1 0.01
0.53

0.99
53

99
53
1+
By using (1)
99
99 53

99
152

99
Question 2
Marks: 5
3
Prove by mathematical induction that n n is divisible by 2 for all positive integral
values of n.
Solution 2:
1. Basic Step:
For n =2
n3 n = 23 - 2 = 8 - 2 = 6

This is clearly divided by 2.

2. Inductive Step:
Suppose that the statement is true for n = k, i.e. k3 - k is divisible by 2 for all positive
integers. Then
k3 - k = 2.q (1) for some q positive Z
we need to prove that
(k+1)3 - (k+1) is divisible by 2
Now (k+1)3 - (k+1) = k3+3k2+3k+1 - (k+1)
= k3+3k2+3k+1 - k - 1
= k3+3k2+3k - k
= (k3 - k) +3k2+3k
= (k3 - k) +3k.(k+1)
= 2.q +3k.(k+1) using (1)
= 2.q +3k.(k+1) (2)
As k is an integer, so k.(k+1) is also an integer but it is the product of two consecutive
integers which is also even.
Let k.(k+1) = 2r where r Z
Now we can write (2) as
(k+1)3 - (k+1) = 2.q +3.2r
(k+1)3 - (k+1) = 2.q +2.3r
(k+1)3 - (k+1) = 2(q +3r) q, r Z
Hence by mathematical induction n3 - n is divisible by 2 where n is positive.
Question 3

Marks: 5

Use the Euclidean algorithm to calculate the greater common divisor of the following
pair of integers 504 and 396.
Solution 3:
1
396 504
396
108

3
108 396
324
72

1
72 108

2
36 72

72
36

72
0

Hence GCD (504, 396) = 36