Scribd
Upload
74 views5 pages

Assignment 1

The document summarizes the proofs of 4 mathematical problems: 1) Proving that 4 - (n^2 + 2) is divisible by 4 for any integer n. It considers even and odd cases for n. 2) Proving that the harmonic number H2n is greater than or equal to 1 + n^2 for n ≥ 1, using mathematical induction. 3) Proving the formula for the sum of squares from 1 to n using mathematical induction. 4) Determining the minimum number of students needed in a class to ensure at least 6 receive the same grade, if there are 5 possible grades, using the pigeonhole principle.

Uploaded by

Prajwal Khatiwada
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
74 views5 pages

Assignment 1

The document summarizes the proofs of 4 mathematical problems: 1) Proving that 4 - (n^2 + 2) is divisible by 4 for any integer n. It considers even and odd cases for n. 2) Proving that the harmonic number H2n is greater than or equal to 1 + n^2 for n ≥ 1, using mathematical induction. 3) Proving the formula for the sum of squares from 1 to n using mathematical induction. 4) Determining the minimum number of students needed in a class to ensure at least 6 receive the same grade, if there are 5 possible grades, using the pigeonhole principle.

Uploaded by

Prajwal Khatiwada
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/ 5

Assignment 1

Prajwal Khatiwada
September 12 2016

Prove that for any integer n, 4 - (n2 + 2)

.
Let us assume 4 | (n2 + 2) then ,
n2 + 2
=k
4

where

kI

Case I: if n is even, n = 2p where p I


4p2 + 1 = 4k
4k = 4p2 + 1
1
k = p2 +
4
k =m+

1
4

where

So

mI

[ pI

k =m+

1
k 6 I
4

so

p2 I

which contradicts with our assumption that k I where k =

n2 +2
4

Case II: if n is odd, n=2p+1 where p I


(2p + 1)2 + 2
=k
4
or,

4p2 + 4p + 3 = 4k
4p2 + 4p + 3
4
3
k = p2 + p +
4

k=

k =m+

3
4

where

mI
1

[ pI

so

p2 I

3
k 6 I
4
which contradicts with our assumption that k I where k =
So

k =m+

n2 +2
4

So 4 - (n2 + 2) for any integer n.

The harmonic number Hj , j = 1, 2, 3, . . . are defined by Hj = 1 + 12 + 13 + . . . + 1j . Use mathematical induction to prove H2n 1 + n2
Let P(n) be H2n 1 + n2 , (n 1)
Basic Step: P(1) is true.
1
2

H21 = 1 +

Inductive Step:
Assume P(k) is true i.e. H2k 1 + k2
We need to show P(k+1) is also true. i.e. H2( k+1) 1 +
H2K+1 = H22k = 1 +
=1+

1
2

= (1 +

1
2

+ ... +

1
2

+ ... +

1
2k

+ ... +

= H2k + ( 2k1+1 +

1
)
2k

1
22k

1
2k +1

1
2k +2

+ ( 2k1+1 +

1
2k +2

+ ... +

+ ... +

1
2k +2

1
2k +2k

+ ... +

1
)
2k +2k

1
)
2k +2k

1
1
Each term from 2k+1
to 2k+1
is less than or equal to
are 2k terms, so the above equation can be written as

H2k+1 H2k + 2k

k+1
2

1
2k+1

and there

1
2k+1

1+

k
2

+ 2k

1
2k +2k

1+

k
2

+ 2k

1
22k

1+

k
2

1+

k+1
2

H2k+1 1 +

k+1
2

[ H2k 1 +

1
2

k
2

and inequality still is valid ]

Use mathematical
induction to
n
P
prove
i2 = 16 n(n + 1)(2n + 1).
i=1

Let,P(n) be

n
P

i2

i=1

Basic Step: P(2)= 16 2 (2 + 1)(2 2 + 1) = 5 which is true


Inductive Step:
Assume P(k) is true i.e. P(k) be

k
P
i=1

i2 = 61 k(k + 1)(2k + 1)

We need to show P (k + 1) = 16 (k + 1)((k + 1) + 1)(2(k + 1) + 1)


= 16 (k + 1)(k + 2)(2k + 3)
P (k + 1) = 12 + 22 + 32 + . . . + (k + 1)2
= 12 + 22 + 32 + . . . + k 2 + (k + 1)2
= (12 + 22 + 32 + . . . + k 2 ) + (k + 1)2
= P (k) + (k + 1)2
= 16 k(k + 1)(2k + 1) + (k + 1)2
= (k + 1)[ 2k

+7k+6
]
6

]
= (k + 1)[ (2k+3)(k+2)
6
=

(k+1)(2k+3)(k+2)
]
6

= 16 (k + 1)((k + 1) + 1)(2(k + 1) + 1)

P (k + 1) = 61 (k + 1)((k + 1) + 1)(2(k + 1) + 1) which is in the required

form and hence P(k+1) is shown to be true.

What is the minimum number of students required in a class to be sure that at least six
will receive the same grade, if there are five
possible grades, A,B,C,D, and F?
The above stated problem can be solved using pigeon hole principle which
can be put as
If N objects are placed into k boxes, then there is at
N
e objects
least one box containing at least d K
So here supposing grades as holes (k) and students as pigeons(N) we have
to calculate the minimum value of N so that at least six students will
receive same grade.
N
e=6
k
For lowest possible value of N, we can write the equation as
i.e. d

or,

N = k(6 1) + 1

or,

N = 5(6 1) + 1

[ k = 5]

N = 26
So minimum number of students required is 26

How many ways are there for eight men and


five women to stand in a line so no two women
stand next to each other?(Hint: first position
the men and then consider possible positions
for the women)
The problem can be solved using the product rule
The men can be first arranged as below
M

So total no of ways men can be arranged is given by 8P 8 = 8!


Now the women can be adjusted anywhere in the blank space i.e.in 9
places so that they would not be sitting next to each other.
So the total number of ways the women can be put is given by 9P 5 =
So by the product rule we have total ways as 8P 8 9P 5 = 8!

9!
(95)!

9!
(95)!

=4032015120
=609638400
So they can be arranged in 609638400 ways.

References

1)https://artofproblemsolving.com/wiki/index.php?titlePigeonhole
Principle
2)Concrete Mathematics: A Foundation for Computer Science (2nd Edition)
2nd Edition by Ronald L. Graham (Author), Donald E. Knuth (Author),
Oren Patashnik (Author) 4.6

You might also like