Difference between revisions of "2024 IMO Problems/Problem 6"
Codemaster11 (talk | contribs) |
Stewpidity (talk | contribs) m (→Video Solution 3，中文版，subtitle in English) |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 4: | Line 4: | ||
==Video Solution== | ==Video Solution== | ||
https://youtu.be/7h3gJfWnDoc | https://youtu.be/7h3gJfWnDoc | ||
| + | |||
| + | ==Video Solution 2== | ||
| + | https://youtu.be/ydnmT8B68Co | ||
| + | |||
| + | ==Video Solution 3，中文版，subtitle in English== | ||
| + | https://youtu.be/2V1ogM-VBq4 | ||
==See Also== | ==See Also== | ||
{{IMO box|year=2024|num-b=5|after=Last Problem}} | {{IMO box|year=2024|num-b=5|after=Last Problem}} | ||
Latest revision as of 21:53, 14 November 2024
Let 
be the set of rational numbers. A function 
is called 
if the following property holds: for every 
,
![\[f(x+f(y)) = f(x) + y \quad \text{or} \quad f(f(x)+y) = x + f(y).\]](http://latex.artofproblemsolving.com/9/d/b/9db4cc2a779c712b20aac279c97fbd66e821fe2a.png)
Show that there exists an integer 
such that for any aquaesulian function 
there are at most different rational numbers of the form 
for some rational number 
, and find the smallest possible value of .
Video Solution
Video Solution 2
Video Solution 3，中文版，subtitle in English
See Also
| 2024 IMO (Problems) • Resources | ||
| Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Problem |
| All IMO Problems and Solutions | ||
