Problems

Is there a sequence of natural numbers in which every natural number occurs exactly once, and for any \(k = 1, 2, 3, \dots\) the sum of the first \(k\) terms of the sequence is divisible by \(k\)?

Author: A.K. Tolpygo

An irrational number \(\alpha\), where \(0 <\alpha <\frac 12\), is given. It defines a new number \(\alpha_1\) as the smaller of the two numbers \(2\alpha\) and \(1 - 2\alpha\). For this number, \(\alpha_2\) is determined similarly, and so on.

a) Prove that for some \(n\) the inequality \(\alpha_n <3/16\) holds.

b) Can it be that \(\alpha_n> 7/40\) for all positive integers \(n\)?

Louise has an \(8\times 8\) chessboard with two opposite corners removes, just like in the picture below. She also has 31 \(2\times1\) dominoes. Can she tile this board with the dominoes she has?

There is a \(3 \times 3\) grid filled with zeros. Louise is allowed to add 1 to each small square inside any \(2\times2\) grid. Can she ever get the following table as a result of her actions?

A rectangular floor is to be covered by \(2 \times 2\) and \(1\times4\) tiles (everything is arranged). Unfortunately one tile got smashed, but we have one more tile of the other kind available. Can we retile the floor perfectly?

This academic year Harry decided not only to attend Maths Circles, but also to join his local Chess Club. Harry’s chess set was very old and some pieces were missing so he ordered a new one. When it arrived, he found out to his surprise that the set consisted of 32 knights of different colours. He was a bit upset but he decided to spend some time on solving the problem he heard on the last Saturday’s Maths Circle session. The task was to find out if it is possible to put more than 30 knights on a chessboard in such a way that they do not attack each other. Do you think it is possible or not?

After listening to Harry’s complaints the delivery service promised him to deliver a very expensive chess set together with some books on chess strategies and puzzles. This week one of the tasks was to put 14 bishops on a chessboard so that they do not attack each other. Harry solved this problem and smiled hoping he is not getting 32 identical bishops this time. Can you solve it?

A boy is playing on a \(4\times10\) board. He is trying to put 8 bishops on the board so that each cell is attacked by one of the bishops. Finally he manages to solve this problem.

(a) Can you show a possible solution?

(b) Can you do the same thing with 7 bishops?

More problems about chessboard and chess pieces:

(a) Can it be true that there are only 8 knights on a \(4\times12\) board and each empty cell is attacked by at least one of the knights?

(b) Put some number of knights on a chessboard in such a way that each knight attacks exactly three other knights.

This academic year Harry decided not only to attend Maths Circles, but also to join his local Chess Club. Harry’s chess set was very old and some pieces were missing, so he ordered a new one. When it arrived, he found out to his surprise that the set consisted of 32 knights of different colours. He was a bit upset but he decided to spend some time on solving the problem he heard on the last Saturday’s Maths Circle session. The task was to find out if it is possible to put more than 30 knights on a chessboard in such a way that they cannot attack each other. Do you think it is possible or not?