A chess king was placed on a square of an board and made moves so that it visited all squares and returned to the starting square. At every moment, the distance from the center of the square the king was on to the center of the board was calculated. A move is called if this distance becomes smaller after the move. Find the maximum possible number of pleasant moves. (The chess king moves to a square adjacent either by side or by corner.)
Let be a positive integer. A positive integer is called a benefactor of if the positive divisors of can be partitioned into two sets and such that is equal to the sum of elements in minus the sum of the elements in . Note that or could be empty, and that the sum of the elements of the empty set is .
For example, is a benefactor of because .
Show that every positive integer has at least benefactors.
A square is divided into unit squares. Is it possible to fill each unit square with a number in such a way that, whenever one places the tile so that it fully covers nine unit squares, the tile will cover nine different numbers?
Let be a natural number. The numbers are written in a row in some order. For each pair of adjacent numbers, their greatest common divisor (GCD) is calculated and written on a sheet. What is the maximum possible number of distinct values among the GCDs obtained?
You have only proved that A is included in B. Now you need to prove that B is included in A. It is not very hard, but if you don't do it, you will lose half the points of this question.
You have only proved that A is included in B. Now you need to prove that B is included in A. It is not very hard, but if you don't do it, you will lose half the points of this question.