Suppose you are a bellringer. Can you find the changes so that,
starting and ending with a round, all the 24 possible permutations
are rung once each and only once?
Let a(n) be the number of ways of expressing the integer n as an
ordered sum of 1's and 2's. Let b(n) be the number of ways of
expressing n as an ordered sum of integers greater than 1. (i)
Calculate a(n) and b(n) for n<8. What do you notice about these
sequences? (ii) Find a relation between a(p) and b(q). (iii) Prove
your conjectures.
The country Sixtania prints postage stamps with only three values 6 lucres, 10 lucres and 15 lucres (where the currency is in lucres).Which values cannot be made up with combinations of these postage stamps? Prove that all other values can be made up.
How many ways can the terms in an ordered list be combined by
repeating a single binary operation. Show that for 4 terms there
are 5 cases and find the number of cases for 5 terms and 6 terms.
Chris and Jo put two red and four blue ribbons in a box. They each pick a ribbon from the box without looking. Jo wins if the two ribbons are the same colour. Is the game fair?
Your partner chooses two beads and places them side by side behind a screen. What is the minimum number of guesses you would need to be sure of guessing the two beads and their positions?