olymmath

RO-NMO 2007 Problem 94

  • Grade 9

Given a set AA and a function f:A→Af: A\rightarrow A , denote by f1(A)=f(A)f_{1}(A)=f(A) , f2(A)=f(f1(A))f_{2}(A)=f(f_{1}(A)) , f3(A)=f(f2(A))f_{3}(A)=f(f_{2}(A)) , and so on, ( fn(A)=f(fn−1(A))f_{n}(A)=f(f_{n-1}(A)) , where the notation f(B)f(B) means the set {f(x) : x∈B}\{ f(x) \ : \ x\in B\} of images of points from BB ). Denote also by f∞(A)=f1(A)∩f2(A)∩…=⋂n≥1fn(A)f_{\infty}(A)=f_{1}(A)\cap f_{2}(A)\cap \ldots = \bigcap_{n\geq 1}f_{n}(A) .

a) Show that if AA is finite, then f(f∞(A))=f∞(A)f(f_{\infty}(A))=f_{\infty}(A) .

b) Determine if the above is true for A=N×NA=\mathbb{N}\times \mathbb{N} and the function f((m,n))={(m+1,n)if n≥m≥1(0,0)if m>n(0,n+1)if n=0.f\big((m,n)\big)=\begin{cases}(m+1,n) & \text{if }n\geq m\geq 1 (0,0) & \text{if }m>n (0,n+1) & \text{if }n=0. \end{cases}

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 ro-nmo/2007/p94 · Tag RCM7DH0XPY · Edit this page on GitHub · Keys: j next, k previous