olymmath

RMM 2010 Problem 6

  • Day 2

Given a polynomial f(x)f(x) with rational coefficients, of degree d≥2d \ge 2 , we define the sequence of sets f0(Q),f1(Q),…f^0(\mathbb{Q}), f^1(\mathbb{Q}), \ldots as f0(Q)=Qf^0(\mathbb{Q})=\mathbb{Q} , fn+1(Q)=f(fn(Q))f^{n+1}(\mathbb{Q})=f(f^{n}(\mathbb{Q})) for n≥0n\ge 0 . (Given a set SS , we write f(S)f(S) for the set {f(x)∣x∈S})\{f(x)\mid x\in S\}) . Let fω(Q)=⋂n=0∞fn(Q)f^{\omega}(\mathbb{Q})=\bigcap_{n=0}^{\infty} f^n(\mathbb{Q}) be the set of numbers that are in all of the sets fn(Q)f^n(\mathbb{Q}) , n≥0n\geq 0 . Prove that fω(Q)f^{\omega}(\mathbb{Q}) is a finite set.

Dan Schwarz, Romania

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator rmm/2010/p6 · Tag A3Y7XGK950 · Edit this page on GitHub · Keys: j next, k previous