Prove that the number of all arrangements of the largest possible amount of peaceful bishops (figures that move on diagonals and don’t threaten each other) on the \(8\times 8\) chessboard is an exact square.
Jane wrote another number on the board. This time it was a two-digit number and again it did not include digit 5. Jane then decided to include it, but the number was written too close to the edge, so she decided to t the 5 in between the two digits. She noticed that the resulting number is 11 times larger than the original. What is the sum of digits of the new number?
a) Find the biggest 6-digit integer number such that each digit, except for the two on the left, is equal to the sum of its two left neighbours.
b) Find the biggest integer number such that each digit, except for the rst two, is equal to the sum of its two left neighbours. (Compared to part (a), we removed the 6-digit number restriction.)
In the following puzzle an example on multiplication is encrypted with the letters of Latin alphabet: \[{BAN}\times {G}= {BOOO}.\] Different letters correspond to different digits, identical letters correspond to identical digits. The task is to solve the puzzle.
Kate is playing the following game. She has 10 cards with digits “0”, “1”, “2”, ..., “9” written on them and 5 cards with “+” signs. Can she put together 4 cards with “+” signs and several “digit” cards to make an example on addition with the result equal to 2012?
Note that by putting two (three, four, etc.) of the “digit” cards together Kate can obtain 2-digit (3-digit, 4-digit, etc.) numbers.
A six-digit number starts with the digit \(1\). If this digit is relocated to the rightmost position, the number becomes \(3\) times bigger. What is the number?
Upon the installation of a keypad lock, each of the 26 letters located on the lock’s keypad is assigned an arbitrary natural number known only to the owner of the lock. Different letters do not necessarily have different numbers assigned to them. After a combination of different letters, where each letter is typed once at most, is entered into the lock a summation is carried out of the corresponding numbers to the letters typed in. The lock opens only if the result of the summation is divisible by 26. Prove that for any set of numbers assigned to the 26 letters, there exists a combination that will open the lock.
To transmit messages by telegraph, each letter of the Russian alphabet () ( and are counted as identical) is represented as a five-digit combination of zeros and ones corresponding to the binary number of the given letter in the alphabet (letter numbering starts from zero). For example, the letter is represented in the form 00000, letter -00001, letter -10111, letter -11111. Transmission of the five-digit combination is made via a cable containing five wires. Each bit is transmitted on a separate wire. When you receive a message, Cryptos has confused the wires, so instead of the transmitted word, a set of letters is received. Find the word you sent.