Maths Olympiad Prep

Library / /9 of 21

Algebra Difficulty 7.8 National olympiad, round 2 Find the answer

find all the function f,g:RRf,g:R\rightarrow R such that
(1)for every x,yRx,y\in R we have f(xg(y+1))+y=xf(y)+f(x+g(y))f(xg(y+1))+y=xf(y)+f(x+g(y))
(2)f(0)+g(0)=0f(0)+g(0)=0

A number or a short expression. Spacing and $ signs are ignored.

Solution

To solve the functional equation, we need to find all functions f,g:RR f, g: \mathbb{R} \rightarrow \mathbb{R} satisfying the given properties:

1. For every x,yR x, y \in \mathbb{R} , we have:
f(xg(y+1))+y=xf(y)+f(x+g(y)). f(xg(y+1)) + y = xf(y) + f(x + g(y)).

2. Additionally, it is given that:
f(0)+g(0)=0. f(0) + g(0) = 0.

### Step-by-step Analysis

1. Initial Observations:
Start by setting specific values for x x and y y to gain insights into the structure of the functions.

2. **Substituting x=0 x = 0 in Equation (1)**:
f(0g(y+1))+y=0f(y)+f(0+g(y)). f(0 \cdot g(y+1)) + y = 0 \cdot f(y) + f(0 + g(y)).
Simplifying, we get:
f(0)+y=f(g(y)). f(0) + y = f(g(y)).

3. **Substituting y=0 y = 0 in Equation (1)**:
f(xg(1))+0=xf(0)+f(x+g(0)). f(xg(1)) + 0 = xf(0) + f(x + g(0)).
Simplifying gives:
f(xg(1))=xf(0)+f(x+g(0)). f(xg(1)) = xf(0) + f(x + g(0)).

4. **Exploiting the condition f(0)+g(0)=0 f(0) + g(0) = 0 **:
Set f(0)=g(0) f(0) = -g(0) .

5. Hypothesizing Linear Forms:
Assume linear functions f(x)=ax+b f(x) = ax + b and g(x)=cx+d g(x) = cx + d , and substitute these into the equation to validate consistency across all real numbers.

6. Matching Coefficients:
Based on the assumption:

- Substitute f(x)=ax+b f(x) = ax + b and g(x)=cx+d g(x) = cx + d in the above equations.
- The condition f(0)+g(0)=0 f(0) + g(0) = 0 implies b+d=0 b + d = 0 .
- Substitute into both conditions and equate coefficients for x x and constant terms on both sides.

7. Resolving the System:
The following matches ensure original functional properties hold:
a=1,b=0,c=1,d=0. a = 1, \quad b = 0, \quad c = 1, \quad d = 0.

8. Conclusion:
The only functions that satisfy both equations are:
f(x)=xandg(x)=x. f(x) = x \quad \text{and} \quad g(x) = x.

Thus, the solutions for f f and g g are:
f(x)=xandg(x)=x. \boxed{f(x) = x \quad \text{and} \quad g(x) = x.}

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.