Russian Olympiad problems are known for their "unconventional" nature, often focusing on logic and proof rather than rote calculation. Russian Mathematical Olympiad Problems | PDF - Scribd
Let ( t = x^2 + x + 1 \ge \frac34 ). Then ( Q(t) = Q(x)^2 ). Iterating: For ( x_0 \in \mathbbR ), define ( x_n+1 = x_n^2 + x_n + 1 ). Then ( Q(x_n+1) = Q(x_n)^2 ). If ( |Q(x_0)| > 1 ), then ( |Q(x_n)| ) grows without bound as ( n\to\infty ), but ( x_n ) is bounded only if ( x_0 ) is in some finite range — actually ( x_n \to \infty ) for ( x_0 \ge 0 ) or ( x_0 \le -2 ) maybe. Standard solution: Only constant solutions work. Check ( Q \equiv 0 ) ⇒ ( P \equiv -1/2 ). Check ( Q \equiv 1 ) ⇒ ( P \equiv 1/2 ). Check ( Q(x) = x^m ) impossible because degree doesn’t match. Also ( Q(x) = 0 ) or 1 for all ( x ) in the set of iterates forces ( Q ) constant. So ( P(x) = c ) with ( c^2 + c = c ) ⇒ ( c=0 ) or ( c=-1/2 ) from original eq? Wait, original: ( P(t) = P(x)^2 + P(x) ) constant ⇒ ( c = c^2 + c ) ⇒ ( c^2 = 0 ) ⇒ ( c=0 ). So only ( P\equiv 0 ) works? But check: ( P\equiv 0 ) ⇒ ( 0 = 0+0 ) OK. ( P\equiv -1/2 ) ⇒ ( -1/2 = (1/4) + (-1/2) = -1/4 ) — false. So only ( P\equiv 0 ). russian math olympiad problems and solutions pdf verified