How many integers are there from 0 to 999999, in the decimal notation of which there are no two identical numbers next to each other?
In what number system is the equality \(3 \times 4 = 10\) correct?
Reception pupil Peter knows only the number 1. Prove that he can write a number divisible by 1989.
Is it possible to find 57 different two digit numbers, such that no sum of any two of them was equal to 100?
Prove that for any number \(d\), which is not divisible by \(2\) or by \(5\), there is a number whose decimal notation contains only ones and which is divisible by \(d\).
Reception pupil Peter knows only the number 1. Prove that he can write a number divisible by 2001.
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.
When we write 137 in decimal, we mean \(1 \cdot 10^2 + 3 \cdot 10 + 7 \cdot 1\). If we write it instead using powers of 2, we have \(137 = 1 \cdot 2^7 + 0 \cdot 2^6 + 0 \cdot 2^5 + 0 \cdot 2^4 + 1 \cdot 2^3 + 0 \cdot 2^2 + 0 \cdot 2^1 + 1 \cdot 2^0\). To tell apart binary representation from decimals, we can use the following notation: \(137 = (10001001)_2\).
What is the number 273 in binary?