Problems

Age
Difficulty
Found: 2163

In the number \(a = 0.12457 \dots\) the \(n\)th digit after the decimal point is equal to the digit to the left of the decimal point in the number. Prove that \(\alpha\) is an irrational number.

Replace \(a, b\) and \(c\) with integers not equal to \(1\) in the equality \((ay^b)^c = - 64y^6\), so it would become an identity.

A row of 4 coins lies on the table. Some of the coins are real and some of them are fake (the ones which weigh less than the real ones). It is known that any real coin lies to the left of any false coin. How can you determine whether each of the coins on the table is real or fake, by weighing once using a balance scale?

With a non-zero number, the following operations are allowed: \(x \rightarrow \frac{1+x}{x}\), \(x \rightarrow \frac{1-x}{x}\). Is it true that from every non-zero rational number one can obtain each rational number with the help of a finite number of such operations?

Seven triangular pyramids stand on the table. For any three of them, there is a horizontal plane that intersects them along triangles of equal area. Prove that there is a plane intersecting all seven pyramids along triangles of equal area.

The function \(f (x)\) is defined and satisfies the relationship \((x-1) f((x=1)/(x-1)) - f (x) = x\) for all \(x \neq 1\). Find all such functions.

Prove that for any natural number \(a_1> 1\) there exists an increasing sequence of natural numbers \(a_1, a_2, a_3, \dots\), for which \(a_1^2+ a_2^2 +\dots+ a_k^2\) is divisible by \(a_1+ a_2+\dots+ a_k\) for all \(k \geq 1\).

Is there a sequence of natural numbers in which every natural number occurs exactly once, and for any \(k = 1, 2, 3, \dots\) the sum of the first \(k\) terms of the sequence is divisible by \(k\)?