Professional Documents
Culture Documents
So we can write it as
102 = 51*2+ 0
As there is no remainder so deviser 51 is our answer
2. Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is
some integer.
Let take a as any positive integer and b = 6.
Then using Euclids algorithm we get a = 6q + r here r is remainder and value of q is
more
than or equal to 0 and r = 0, 1, 2, 3, 4, 5 because 0 r < b and the value of b is 6
So total possible forms will 6q+0 , 6q+1 , 6q+2,6q+3,6q+4,6q+5
6q+0 6 is divisible by 2 so it is a even number
6q+1 6 is divisible by 2 but 1 is not divisible by 2 so it is a odd number
6q+2 6 is divisible by 2 and 2 is also divisible by 2 so it is a even number
6q+3 6 is divisible by 2 but 3 is not divisible by 2 so it is a odd number
6q+4 6 is divisible by 2 and 4 is also divisible by 2 it is a even number
6q+5 6 is divisible by 2 but 5 is not divisible by 2 so it is a odd number
So odd numbers will in form of 6q + 1, or 6q + 3, or 6q + 5
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?
To get the maximum number column here we always find HCF and for minimum number
we find LCM
So can use Euclids algorithm to find the HCF.
Here 616> 32 so always divide greater number with smaller one
When we divide 616 by 32 we get quotient 19 and remainder 8
So we can write it as
616 = 32 * 19 + 8
Now divide 32 by 8 we get quotient 4 and no remainder
So we can write it as
32 = 8 * 4 + 0
As there are no remainder so our HCF will 8
So that maximum number of columns in which they can march is 8.
4. Use Euclids 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 take a as any positive integer and b = 3.
Then using Euclids algorithm we get a = 3q + r here r is remainder and value of q is
more
than or equal to 0 and r = 0, 1, 2 because 0 r < b and the value of b is 3 So our
possible
values will 3q+0 , 3q+1 and 3q+2
Now find the square of values
Use the formula (a+b)^2 = a^2 + 2ab +b^2 to open the square bracket
(3q)^2
(3q+2)^2
Now divide by 9 we get quotient = 81q^3 + 27q^2b + 3qb^2 and remainder is b^3
So we have to consider the value of b^3
b=0
we get 9m+0 = 9m
b=1
b=2
b=3
b=4
b=5
b=6
b=7
b=8