The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board for any value of n. How many ways can a knight do this on a 3 by 4 board?
You have two bags, four red balls and four white balls. You must
put all the balls in the bags although you are allowed to have one
bag empty. How should you distribute the balls between the two bags
so as to make the probability of choosing a red ball as small as
possible and what will the probability be in that case?
A standard die has the numbers 1, 2 and 3 are opposite 6, 5 and 4 respectively so that opposite faces add to 7? If you make standard dice by writing 1, 2, 3, 4, 5, 6 on blank cubes you will find there are 2 and only 2 different standard dice. Can you prove this ?