olymmath

US-TST 2019 Problem 4

    We say a function f:Z≥0×Z≥0→Zf: \mathbb{Z}_{\geq 0} \times \mathbb{Z}_{\geq 0} \rightarrow \mathbb{Z} is great if for any nonnegative integers mm and nn, f(m+1,n+1)f(m,n)−f(m+1,n)f(m,n+1)=1f(m+1, n+1) f(m, n)-f(m+1, n) f(m, n+1)=1 If A=(a0,a1,…)A=\left(a_{0}, a_{1}, \ldots\right) and B=(b0,b1,…)B=\left(b_{0}, b_{1}, \ldots\right) are two sequences of integers, we write A∼BA \sim B if there exists a great function ff satisfying f(n,0)=anf(n, 0)=a_{n} and f(0,n)=bnf(0, n)=b_{n} for every nonnegative integer nn (in particular, a0=b0a_{0}=b_{0} ). Prove that if A,B,CA, B, C, and DD are four sequences of integers satisfying A∼BA \sim B, B∼CB \sim C, and C∼DC \sim D, then D∼AD \sim A.

    Dataset text NuminaMath olympiads. 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

    Locator us-tst/2019/p4 · Tag M3DVKTG1S9 · Edit this page on GitHub · Keys: j next, k previous