Scribd
Upload
4 views

Tutorial 4

The document outlines a tutorial on mathematical strategies and proofs related to games and combinatorial mathematics. It includes problems on winning strategies for the game of Chomp, mathematical induction proofs, and arrangements of numbers to avoid averages. Additionally, it addresses handshakes at a party and player rankings in a tennis tournament, emphasizing the use of induction in various proofs.

Uploaded by

bhaktrajvj
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
4 views

Tutorial 4

The document outlines a tutorial on mathematical strategies and proofs related to games and combinatorial mathematics. It includes problems on winning strategies for the game of Chomp, mathematical induction proofs, and arrangements of numbers to avoid averages. Additionally, it addresses handshakes at a party and player rankings in a tennis tournament, emphasizing the use of induction in various proofs.

Uploaded by

bhaktrajvj
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/ 1

Maths for Computing

Tutorial 4
1. Find a winning strategy for the 1st player in the game of Chomp when cookies are
2 × n, that is, 2 rows and n columns.

2. Find a winning strategy for the 1st player in the game of Chomp when cookies are
n × n.

3. Use mathematical induction to prove that 7n+2 + 82n+1 is divisible by 57 for every nonnegative
integer.

4. Let a1 = 5, and let an+1 = an2. Prove that the last n digits of an are the same as the last n digits
of an+1.

5. Show that it is possible to arrange the numbers 1,2,…, n in a row so that average of any two of
these numbers never appear between them. [Hint: Show that it su ces to prove this fact when n
is a power of 2. Then use mathematical induction to prove the result when is a power of 2. ]

6. In a party there are 2n participants, where n is a positive integer. Some participants shake
hands with other participants. It is known that there do not exist three participants who have
shaken hands with each other. Prove that the total number of handshakes is not more than n 2.

7. At a tennis tournament, there were 2n participants, where n is a positive integer, and any two of
them played against each other exactly one time. Prove that we can nd n + 1 players that can
form a line in which everybody has defeated all the players who are behind him in the line. [Hint:
Use induction and winner.]
ffi
fi

You might also like