There is a scout group where some of the members know each other. Amongst any four members there is at least one of them who knows the other three. Prove that there is at least one member who knows the entirety of the scout group.
The distance between two villages equals \(999\) kilometres. When you go from one village to the other, every kilometre you see a sign on the road, saying \(0 \mid 999, \, 1\mid 998, \, 2\mid 997, ..., 999\mid 0\). The signs show the distances to the two villages. Find the number of signs that contain only two different digits. For example, the sign \(0\mid999\) contains only two digits, namely \(0\) and \(9\), whereas the sign \(1\mid998\) contains three digits, namely \(1\), \(8\) and \(9\).
Two players are playing a game. The first player is thinking of a finite sequence of positive integers \(a_1\), \(a_2\), ..., \(a_n\). The second player can try to find the first player’s sequence by naming their own sequence \(b_1\), \(b_2\), ..., \(b_n\). After this, the first player will give the result \(a_1b_1 + a_2b_2 + ...+a_nb_n\). Then the second player can say another sequence \(c_1\), \(c_2\), ..., \(c_n\) to get another answer \(a_1c_1+ a_2c_2 + ... +a_nc_n\) from the first player. Find the smallest number of sequences the second player has to name to find out the sequence \(a_1\), \(a_2\), ..., \(a_n\).
The letters \(A\), \(R\), \(S\) and \(T\) represent different digits from \(1\) to \(9\). The same letters correspond to the same digits, while different letters correspond to different digits.
Find \(ART\), given that \(ARTS+STAR=10,T31\).
On a \(10\times 10\) board, a bacterium sits in one of the cells. In one move, the bacterium shifts to a cell adjacent to the side (i.e. not diagonal) and divides into two bacteria (both remain in the same new cell). Then, again, one of the bacteria sitting on the board shifts to a new adjacent cell, either horizontally or vertically, and divides into two, and so on. Is it possible for there to be an equal number of bacteria in all cells after several such moves?
Let \(p\) and \(q\) be two prime numbers such that \(q = p + 2\). Prove that \(p^q + q^p\) is divisible by \(p + q\).
Explain why a position \(g\) is a winning position if there is a move that turns \(g\) into a losing position. On the other hand, explain why a position is a losing position if all moves turns it into a winning position.
A technique that can be used to completely solve certain games is drawing game graphs. Given a game \(G\), we draw an arrow pointing from a position \(g\) to a position \(h\) if there is a move taking the game from position \(g\) to position \(h\).
Draw the game graph of \(\text{Nim}(2,2)\). Is \(\text{Nim}(2,2)\) a winning position or losing position?
Is \(\text{Nim}(2,5)\) a winning position or a losing position?
Let \(x,y\) be nonnegative integers. Determine when \(\text{Nim}(x,y)\) is a losing position and when it is a winning position.