Difference between revisions of "2014 OIM Problems/Problem 6"

(Created page with "== Problem == Given a set <math>X</math> and a function <math>f: X \to X</math>, we say that for each <math>x \in X</math>, <math>f^1(x)=f(x)</math>, and for each <math>j \ge...")
 
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
 
Given a set <math>X</math> and a function <math>f: X \to X</math>, we say that for each <math>x \in X</math>, <math>f^1(x)=f(x)</math>, and for each <math>j \ge 1</math>, <math>f^{j+1}=f(f^j(x))</math>.  We say that <math>a \in X</math> is a fixed point of <math>f</math> if <math>f(a) = a</math>. For each real number <math>x</math>, we define <math>\pi (x)</math> as the number of smaller positive primes less or equal to <math>x</math>. Given a positive integer <math>n</math>, we say that <math>f : {1, 2, \cdots , n} \to {1, 2, c\dots , n}</math>
 
Given a set <math>X</math> and a function <math>f: X \to X</math>, we say that for each <math>x \in X</math>, <math>f^1(x)=f(x)</math>, and for each <math>j \ge 1</math>, <math>f^{j+1}=f(f^j(x))</math>.  We say that <math>a \in X</math> is a fixed point of <math>f</math> if <math>f(a) = a</math>. For each real number <math>x</math>, we define <math>\pi (x)</math> as the number of smaller positive primes less or equal to <math>x</math>. Given a positive integer <math>n</math>, we say that <math>f : {1, 2, \cdots , n} \to {1, 2, c\dots , n}</math>
it's "''catracha''" if <math>f^{f(k)}(k)=k for all </math>k \in {1,2,\cdots,n}$
+
it's "''catracha''" if <math>f^{f(k)}(k)=k</math> for all <math>k \in {1,2,\cdots,n}</math>
  
 
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
 
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Revision as of 15:18, 14 December 2023

Problem

Given a set $X$ and a function $f: X \to X$, we say that for each $x \in X$, $f^1(x)=f(x)$, and for each $j \ge 1$, $f^{j+1}=f(f^j(x))$. We say that $a \in X$ is a fixed point of $f$ if $f(a) = a$. For each real number $x$, we define $\pi (x)$ as the number of smaller positive primes less or equal to $x$. Given a positive integer $n$, we say that $f : {1, 2, \cdots , n} \to {1, 2, c\dots , n}$ it's "catracha" if $f^{f(k)}(k)=k$ for all $k \in {1,2,\cdots,n}$

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions