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”.

Four numbers (from 1 to 9) have been used to create two numbers with four-digits each. These two numbers are the maximum and minimum numbers, respectively, possible. The sum of these two numbers is equal to 11990. What could the two numbers be?

It is known that \(AA + A = XYZ\). What is the last digit of the product: \(B \times C \times D \times D \times C \times E \times F \times G\) (where different letters denote different digits, identical letters denote identical digits)?

Replace the letters with numbers (all digits must be different) so that the correct equality is obtained: \(A/ B/ C + D/ E/ F + G/ H/ I = 1\).

Replace the question marks with the appropriate letters or words:

a) r, o, y, g, b, ?, ?;

b) a, c, f, j, ?, ?;

c) one, three, five, ?,

d) A, H, I, M, O, T, U, ?, ?, ?, ?;

e) o, t, t, f, f, s, s, e, ?, ?.

In the rebus in the diagram below, the arithmetic operations are carried out from left to right (even though the brackets are not written).

For example, in the first row "\(** \div 5 + * \times 7 = 4*\)" is the same as "\(((** \div 5) +*) \times 7 = 4*\)". Each number in the last row is the sum of the numbers in the column above it. The result of each \(n\)-th row is equal to the sum of the first four numbers in the \(n\)-th column. All of the numbers in this rebus are non-zero and do not begin with a zero, however they could end with a zero. That is, 10 is allowed but not 01 or 0. Solve the rebus.

Decode this rebus: replace the asterisks with numbers such that the equalities in each row are true and such that each number in the bottom row is equal to the sum of the numbers in the column above it.

King Hattius has three prisoners and gives them the following puzzle. He will put a randomly coloured hat on each of their heads: red, blue or green. He’ll then give them \(10\) seconds for them to each guess their own hat’s colour at the same time.

However! Each prisoner can only see the other two prisoners’ hats, not their own. There are no mirrors in the prison, and they are not allowed to take off their hat, nor talk, mouth, use sign-language, or otherwise communicate with the other two prisoners during those ten seconds.

Hattius tells them that he’ll release them all if at least one correctly guesses their hat’s colour. He gives them an hour to come up with a strategy - what should their strategy be?

Two aliens want to abduct two humans, but aren’t paying attention, so instead run after pigs. They’re all on squares of a \(3\times6\) rectangle, as seen below. On the first move, the aliens move one square horizontally or vertically. Then on the second move, the pigs move horizontally or vertically. The third move is for the aliens, the fourth move is for the pigs, and so on. If an alien lands on a square with a pig on it, then they’ve succeeded. Show that no matter what the pigs do, they’re doomed.

In the diagram below, there are nine discs - each is black on one side, and white on the other side. Two have black face-up right now. Your task is to remove all of the discs by making a series of the following moves. Each move includes choosing a black disc, flipping over its neighbours\(^*\) and removing that black disc. Discs are ‘neighbours’ if they’re adjacent at the beginning - removing a disc creates a gap, so that at later stages, a disc may have two, one or even zero neighbours left. \[\circ\circ\circ\bullet\circ\circ\circ\circ\bullet\] Show that this task is impossible.