Scribd
Upload
3 views

Tutorial 5

Uploaded by

b23cs1025
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
3 views

Tutorial 5

Uploaded by

b23cs1025
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/ 2

Maths for Computing

Tutorial 5
Note: Using strong induction for problems from 1 to 6 may make proof simpler.

1. Let a0 = 0, and an = a0 + a1 + a2 + … + an−1 + n, if n ≥ 1. Prove that for all non-


negative integers n, an = 2n − 1.

2. Prove that every amount of postage of 12 rupees or more can be formed using Rs. 4 and Rs. 5
stamps.

3. Suppose you begin with a pile of n ≥ 2 stones and split this pile into n piles of one stone each
by successively splitting a pile of stones into two smaller piles. Each time you split a pile you
multiply the number of stones in each of the two smaller piles you form, so that if these piles have
r and s stones in them, respectively, you compute rs. Show that no matter how you split the piles,
the sum of the products computed at each step equals n(n − 1)/2.

4. Prove that in the game of Chomp if the 2nd player does not have a winning strategy then the
1st player must have.

5. Consider a game in which two players take turns removing any positive number of matches
they want from one of two piles of matches. The player who removes the last match wins the
game. Show that if the two piles contain the equal number of matches initially, then the second
player can always guarantee a win.

6. Prove that for all positive integers n, it is possible to organise a round-robin tournament of n
football teams in
a) n − 1 rounds if n is even,
b) n rounds if n is odd.
A round is a set of games in which each team plays one opponent if n is even, and there is only
one idle team if n is odd. A round-robin tournament is a tournament in which any pair of teams
meet exactly once. Use strong induction.

1 3 2n − 1 1
7. Suppose we want to prove that . .…. < for all positive integers n.
2 4 2n 3n
a) Try to prove this inequality using mathematical induction. If you are stuck in the inductive step,
see b).
b) Show that mathematical induction can be used to prove the stronger inequality
1 3 2n − 1 1
. .…. < for all integers greater than 1, which, together with a
2 4 2n 3n + 1
veri cation of the original inequality for n = 1, establishes the weaker inequality we originally
fi
tried to prove using mathematical induction.

8. Prove that the union of countably many countable sets is countable.

9. Prove that the set of real numbers containing no other digits apart from a nite number of 1s in
their decimal representation is countable.

10. Prove that if A is countable but B is not, then B∖A is uncountable.

fi

You might also like