Home Competitions AUSTRIAN-POLISH 1999 Problem 3
AUSTRIAN-POLISH 1999 Problem 3
Given an integer n ≥ 2 n \ge 2 n ≥ 2 , find all sustems of n n n functions f 1 , . . . , f n : R → R f_1,..., f_n : R \to R f 1 , ... , f n : R → R such that for all x , y ∈ R x,y \in R x , y ∈ R { f 1 ( x ) − f 2 ( x ) f 2 ( y ) + f 1 ( y ) = 0 f 2 ( x 2 ) − f 3 ( x ) f 3 ( y ) + f 2 ( y 2 ) = 0... f n ( x n ) − f 1 ( x ) f 1 ( y ) + f n ( y n ) = 0 \begin{cases} f_1(x)-f_2 (x)f_2(y)+ f_1(y) = 0 f_2(x^2)-f_3 (x)f_3(y)+ f_2(y^2) = 0 ... f_n(x^n)-f_1 (x)f_1(y)+ f_n(y^n) = 0 \end {cases} { f 1 ( x ) − f 2 ( x ) f 2 ( y ) + f 1 ( y ) = 0 f 2 ( x 2 ) − f 3 ( x ) f 3 ( y ) + f 2 ( y 2 ) = 0... f n ( x n ) − f 1 ( x ) f 1 ( y ) + f n ( y n ) = 0
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 austrian-polish/1999/p3 · Tag 5XQ7RVBRFB · Edit this page on GitHub · Keys: j next, k previous