Problems

In the rebus below, replace the letters with numbers such that the same numbers are represented with the same letter. The asterisks can be replaced with any numbers such that the equations hold.

An explanation of the notation used: the unknown numbers in the third and fourth rows are the results of multiplying 1995 by each digit of the number in the second row, respectively. These third and fourth rows are added together to get the total result of the multiplication \(1995 \times ***\), which is the number in the fifth row. This is an example of a “long multiplication table”.

Which five-digit numbers are there more of: ones that are not divisible by 5 or those with neither the first nor the second digit on the left being a five?

The digits of a 3 digit number \(A\) were written in reverse order and this is the number \(B\). Is it possible to find a value of \(A\) such that the sum of \(A\) and \(B\) has only odd numbers as its digits?

Let \(x\) be a 2 digit number. Let \(A\), \(B\) be the first (tens) and second (units) digits of \(x\), respectively. Suppose \(A\) is twice as large as \(B\). If we add the square of \(A\) to \(x\) then we get the square of a certain whole number. Find the value of \(x\).

Prove that amongst numbers written only using the number 1, i.e.: 1, 11, 111, etc, there is a number than is divisible by 1987.

Prove that there is a power of 3 that ends in 001.

How many six-digit numbers exist, the numbers of which are either all odd or all even?

Prove that the product of any three consecutive natural numbers is divisible by 6.

Prove that: \[a_1 a_2 a_3 \cdots a_{n-1}a_n \times 10^3 \equiv a_{n-1} a_n \times 10^3 \pmod4,\] where \(n\) is a natural number and \(a_i\) for \(i=1,2,\ldots, n\) are the digits of some number.

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?