Problems

Age
Difficulty
Found: 877

The equations \[ax^2 + bx + c = 0 \tag{1}\] and \[- ax^2 + bx + c \tag{2}\] are given. Prove that if \(x_1\) and \(x_2\) are, respectively, any roots of the equations (1) and (2), then there is a root \(x_3\) of the equation \(\frac 12 ax^2 + bx + c\) such that either \(x_1 \leq x_3 \leq x_2\) or \(x_1 \geq x_3 \geq x_2\).

Prove that if \(x_0^4 + a_1x_0^3 + a_2x_0^2 + a_3x_0 + a_4\) and \(4x_0^3 + 3a_1x_0^2 + 2a_2x_0 + a_3 = 0\) then \(x^4 + a_1x^3 + a_2x^2 + a_3x + a_4\) is divisible by \((x - x_0)^2\).

A table of \(4\times4\) cells is given, in some cells of which a star is placed. Show that you can arrange seven stars so that when you remove any two rows and any two columns of this table, there will always be at least one star in the remaining cells. Prove that if there are fewer than seven stars, you can always remove two rows and two columns so that all the remaining cells are empty.

Prove that in a group of 11 arbitrary infinitely long decimal numbers, it is possible to choose two whose difference contains either, in decimal form, an infinite number of zeroes or an infinite number of nines.

At what value of \(k\) is the quantity \(A_k = (19^k + 66^k)/k!\) at its maximum?

In draughts, the king attacks by jumping over another draughts-piece. What is the maximum number of draughts kings we can place on the black squares of a standard \(8\times 8\) draughts board, so that each king is attacking at least one other?

The number \(n\) has the property that when it is divided by \(q^2\) the remainder is smaller than \(q^2 / 2\), whatever the value of \(q\). List all numbers that have this property.