Scribd
Upload
17 views3 pages

SLKGJLKFJ

Mathematical induction is a method for proving statements for all positive integers. It involves two steps: the base step, which proves the statement for n=1, and the induction step, which assumes the statement holds for some integer n and proves it holds for n+1. The document provides examples using induction to prove formulas for sums and handshakes. It also presents problems to prove other statements using induction.

Uploaded by

Anon
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
17 views3 pages

SLKGJLKFJ

Mathematical induction is a method for proving statements for all positive integers. It involves two steps: the base step, which proves the statement for n=1, and the induction step, which assumes the statement holds for some integer n and proves it holds for n+1. The document provides examples using induction to prove formulas for sums and handshakes. It also presents problems to prove other statements using induction.

Uploaded by

Anon
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/ 3

Mathematical Induction

Mathematical Induction
Mathematical Induction is a powerful method for solving problems. Suppose we want to
prove a result for all positive integers n. To do this, we need to demonstrate two steps:
Base Step: The result holds for n = 1.
Induction Step: If the result holds for some positive integer n, then it holds for n + 1 as well.
For example, let us use mathematical induction to show that for all positive integers n:
1 + 3 + . . . + (2n 1) = n2
Base Step: Suppose n = 1. Then the left side (LS) is 1 + . . . + 1 = 1, while the right side
(RS) is 12 = 1. Therefore LS = RS, and the base step is complete.
Induction Step: Suppose the result holds for some positive integer n, so that:
1 + 3 + . . . + (2n 1) = n2

(1)

We need to show the result holds for n + 1. We have:


1 + 3 + . . . + (2(n + 1) 1) = (1 + 2 + . . . + (2n 1)) + (2(n + 1) 1)
= n2 + (2(n + 1) 1)
using equation (1)
2
2
= n + 2n + 1 = (n + 1)
Therefore, the result holds for n + 1 as well, and the induction step is complete.
Hence by mathematical induction the result must hold for all positive integers n.
Here is another example. Supppose n people gather at a meeting, and every two of them
shake hands. How many handshakes take place?
Let us consider small cases and try to find a pattern. When we have one person, there are
obviously 0 handshakes. When person 2 comes along, he shakes hands with the first person,
so there are 1 handshakes total. On top of this, person 3 will shake hands with the first two
people, so with three people, there are 1 + 2 handshakes total. Person 4 will shake hands
with the first three people, so with four people, there are 1 + 2 + 3 handshakes total. You
can see the pattern now:
When there are n people, 1 + 2 + . . . + n 1 handshakes take place.
We have sort of demonstrated this result using small cases, but to prove the general result,
we will use induction.
Base Step: Suppose n = 1. Then 0 handshakes take place. Since 1 + . . . + (1 1) = 0, the
result holds for n = 1 and the base step is complete.
Induction Step: Suppose the result holds for some positive integer n, and we want to show
that it holds for n + 1 as well. Number the people from 1 to n. The order of the handshakes
1

Mathematical Induction
doesnt matter, so let us assume people 1, 2, . . . , n shake hands with each other before person
n + 1 shakes hands with anybody. Since the result holds for n, then during this first stage
1 + 2 + . . . + n 1 handshakes occur. Now, the only handshakes that are left are the ones
involving person n + 1. There must be n of them (since the person n + 1 shakes hands with
people 1, 2, . . . , n). Hence n more handshakes occur during this second stage. Hence in
total the number of handshakes is:
(1 + 2 + . . . + (n 1)) + n = 1 + 2 + . . . + n
Therefore, the result holds for n + 1 as well, and the induction step is complete.

Problems
1. Prove that for all positive integers n:
n(n + 1)
2
n(n
+ 1)(2n + 1)
(b) 12 + 22 + . . . + n2 =
6
1
1
1
1
(c)
+
+ ... +
=1
12 23
n (n + 1)
n+1
(a) 1 + 2 + . . . + n =

2. A sequence is defined by a1 = 1, and for n 1, an+1 = 2an + 1. What is a300 ?


3. (a) Show that for all positive integers n, the number 5n has 5 as its units digit.
(b) Show that for all integers n 2, the number 5n ends in 25.
(Note: The base step should start at n = 2, not n = 1).
4. Prove that for all integers n 4, we have n! > 2n .
5. Show that for all positive inetegers n, 8n 1 is divisible by 7.
6. Assume x > 1. For all positive integers n prove that (1 + x)n 1 + nx.

Some Harder Problems


1
1 3 5 . . . (2n 1)

2 4 6 . . . 2n
2n + 1
8. A sequence is defined by a1 = 1, a2 = 2, and for n 2, an+1 = an + 2an1 . What is
the value of a300 ?
Note: To solve this problem, you will need to use strong induction. This is the same
as regular induction, except in the induction step, you assume that the result holds for
all integers less than or equal to n, and not just for the integer n.
So in this problem, once you figure out a formula for an , to show it holds for an+1 in
the induction step, you would assume that it holds for both an and an1 .
7. Show that for all positive integers n:

Mathematical Induction
9. Bob comes into a grocery store and wants to buy a calculator for n dollars. He has
an infinite number of two-dollar coins and an infinite number of five-dollar bills. Show
that for every positive integer n 4, he will be able to pay for the calculator without
requiring any change.
n
10. Prove that for every positive integer n, 3(2 ) 1 is divisible by 2n+2 but not 2n+3 .
11. Stacy draws n lines on a sheet of paper, so that no two of them intersect. As a result
the lines split up the sheet into different regions. How many such regions are there?
1
12. Let x be a real number, such that x + is an integer. Prove that for every positive
x
1
n
integer n, x + n is an integer.
x

Hard Problems
13. (COMC 2013) Alphonse and Beryl play the following game. Two positive integers m
and n are written on the board. On each turn, a player selects one of the numbers
on the board, erases it, and writes in its place any (positive) divisor of this number as
long as it is different from any of the numbers previously written on the board. For
example, if 10 and 17 are written on the board, a player can erase 10 and write 2 in
its place (as long as 2 has not appeared on the board before). The player who cannot
make a move loses. Alphonse goes first.
(a) Suppose m = 240 and n = 351 . Who has the winning strategy, and why?
(b) Suppose m = 240 and n = 251 . Who has the winning strategy, and why?
14. Ler p be a prime number. Prove that if n is a positive integer not divisible by p, then
np1 gives a remainder of 1 when divided by p. (This result is known as Fermats Little
Theorem and is very useful in olympiad number theory problems).
Hint: Try to prove that np gives a remainder of n when divided by p.
15. Let n 4 be positive integer. Prove that for any positive real numbers x1 , . . . , xn the
following inequality holds:
x2
xn
x1
+
+ ... +
2
xn + x2 x1 + x3
xn1 + x1

You might also like