Benchmark AI / Public workspace

OlympiadBench / 1687 / Determine all pairs (f,g) of functions from the set of positive integers to…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

answer type

Expression

is multiple answer

false

language

English

question

Determine all pairs (f,g)(f, g) of functions from the set of positive integers to itself that satisfy fg(n)+1(n)+gf(n)(n)=f(n+1)g(n+1)+1 f^{g(n)+1}(n)+g^{f(n)}(n)=f(n+1)-g(n+1)+1 for every positive integer nn. Here, fk(n)f^{k}(n) means $\underbrace{f(f(\ldots f}_{k}(n) \ldots))$.
Plain-text mathematical notation (without MathML)
Determine all pairs (f,g) of functions from the set of positive integers to itself that satisfy

f^(g(n)+1)(n)+g^(f(n))(n)=f(n+1)−g(n+1)+1

for every positive integer n. Here, f^(k)(n) means $\underbrace{f(f(\ldots f}_{k}(n) \ldots))$.
Original LaTeX notation
Determine all pairs $(f, g)$ of functions from the set of positive integers to itself that satisfy

$$
f^{g(n)+1}(n)+g^{f(n)}(n)=f(n+1)-g(n+1)+1
$$

for every positive integer $n$. Here, $f^{k}(n)$ means $\underbrace{f(f(\ldots f}_{k}(n) \ldots))$.

question type

Open-ended

subject

Math

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import