Stay ahead of learning milestones! Enroll in a class over the summer!

G
Topic
First Poster
Last Poster
k a May Highlights and 2025 AoPS Online Class Information
jlacosta   0
May 1, 2025
May is an exciting month! National MATHCOUNTS is the second week of May in Washington D.C. and our Founder, Richard Rusczyk will be presenting a seminar, Preparing Strong Math Students for College and Careers, on May 11th.

Are you interested in working towards MATHCOUNTS and don’t know where to start? We have you covered! If you have taken Prealgebra, then you are ready for MATHCOUNTS/AMC 8 Basics. Already aiming for State or National MATHCOUNTS and harder AMC 8 problems? Then our MATHCOUNTS/AMC 8 Advanced course is for you.

Summer camps are starting next month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have an enriching summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following upcoming events:
[list][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 1, 2025
0 replies
inequality
xytunghoanh   5
N a minute ago by lbh_qys
For $a,b,c\ge 0$. Let $a+b+c=3$.
Prove or disprove
\[\sum ab +\sum ab^2 \le 6\]
5 replies
xytunghoanh
4 hours ago
lbh_qys
a minute ago
Interesting inequality of sequence
GeorgeRP   0
a minute ago
Source: Bulgaria IMO TST 2025 P2
Let $d\geq 2$ be an integer and $a_0,a_1,\ldots$ is a sequence of real numbers for which $a_0=a_1=\cdots=a_d=1$ and:
$$a_{k+1}\geq a_k-\frac{a_{k-d}}{4d}, \forall_{k\geq d}$$Prove that all elements of the sequence are positive.
0 replies
GeorgeRP
a minute ago
0 replies
Parallel lines in incircle configuration
GeorgeRP   0
3 minutes ago
Source: Bulgaria IMO TST 2025 P1
Let $I$ be the incenter of triangle $\triangle ABC$. Let $H_A$, $H_B$, and $H_C$ be the orthocenters of triangles $\triangle BCI$, $\triangle ACI$, and $\triangle ABI$, respectively. Prove that the lines through $H_A$, $H_B$, and $H_C$, parallel to $AI$, $BI$, and $CI$, respectively, are concurrent.
0 replies
GeorgeRP
3 minutes ago
0 replies
Expensive n-tuples
jlammy   28
N 13 minutes ago by Jupiterballs
Source: EGMO 2017 P5
Let $n\geq2$ be an integer. An $n$-tuple $(a_1,a_2,\dots,a_n)$ of not necessarily different positive integers is expensive if there exists a positive integer $k$ such that $$(a_1+a_2)(a_2+a_3)\dots(a_{n-1}+a_n)(a_n+a_1)=2^{2k-1}.$$a) Find all integers $n\geq2$ for which there exists an expensive $n$-tuple.

b) Prove that for every odd positive integer $m$ there exists an integer $n\geq2$ such that $m$ belongs to an expensive $n$-tuple.

There are exactly $n$ factors in the product on the left hand side.


28 replies
jlammy
Apr 9, 2017
Jupiterballs
13 minutes ago
No more topics!
International FE olympiad P3
Functional_equation   22
N Apr 28, 2025 by jasperE3
Source: IFEO Day 1 P3
Find all functions $f:\mathbb R^+\rightarrow \mathbb R^+$ such that$$f(f(x)f(f(x))+y)=xf(x)+f(y)$$for all $x,y\in \mathbb R^+$

$\textit{Proposed by Functional\_equation, Mr.C and TLP.39}$
22 replies
Functional_equation
Feb 6, 2021
jasperE3
Apr 28, 2025
International FE olympiad P3
G H J
G H BBookmark kLocked kLocked NReply
Source: IFEO Day 1 P3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Functional_equation
530 posts
#1 • 4 Y
Y by Aritra12, Mathematicsislovely, ywq233, megarnie
Find all functions $f:\mathbb R^+\rightarrow \mathbb R^+$ such that$$f(f(x)f(f(x))+y)=xf(x)+f(y)$$for all $x,y\in \mathbb R^+$

$\textit{Proposed by Functional\_equation, Mr.C and TLP.39}$
This post has been edited 2 times. Last edited by Functional_equation, Feb 6, 2021, 6:15 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Functional_equation
530 posts
#2 • 1 Y
Y by megarnie
Note: We will not share the official solutions yet. We will share when the Solution Bookled is ready. :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
pco
23512 posts
#3 • 10 Y
Y by Pitagar, Functional_equation, Mathematicsislovely, EmilXM, Atpar, ywq233, Supercali, OlympusHero, megarnie, terg
Functional_equation wrote:
Find all functions $f:\mathbb R^+\rightarrow \mathbb R^+$ such that$$f(f(x)f(f(x))+y)=xf(x)+f(y)$$for all $x,y\in \mathbb R^+$
Let $P(x,y)$ be the assertion $f(f(x)f(f(x))+y)=xf(x)+f(y)$

Simple induction implies
New assertion $Q(x,y,n)$ : $f(y+nf(x)f(f(x)))=f(y)+nxf(x)$ $\forall x,y>0$, $\forall n\in\mathbb Z_{\ge 0}$

1) New assertion $R(x,y)$ : $f(y)\ge \frac x{f(f(x))}y-xf(x)$ $\forall x,y>0$
Proof

2) $f(f(x))=x\quad\forall x>0$ (and so $f(x)$ is bijective)
Proof

3) $\boxed{f(x)=x\quad\forall x>0}$
Proof
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Functional_equation
530 posts
#4
Y by
@PCO congratulations! :first:
Note: None of the participants in the contest was able to solve this problem.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Functional_equation
530 posts
#5 • 3 Y
Y by ywq233, Aritra12, megarnie
This is IFEO SL A7
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Functional_equation
530 posts
#6 • 1 Y
Y by MeowX2
Official Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JuniorPerelman
114 posts
#7 • 1 Y
Y by Mango247
I think that there is a simple method
Juste set x=0 and since f(0) exist we can also set y=-f(0)f(f(0))
Now we get f(0)=-f(0)f(f(0)) and then we have f(0)=0 or f(f(0))=-1
And the remainder follow from both cases
And we find that the only solution is f(x)=x
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JuniorPerelman
114 posts
#8 • 1 Y
Y by Mango247
Functional_equation wrote:
@PCO congratulations! :first:
Note: None of the participants in the contest was able to solve this problem.

Are u sure?
Cause it seems like obvious
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DottedCaculator
7354 posts
#9
Y by
Hello, $f(0)$ does not exist, as the domain of $f$ is all positive real numbers.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JuniorPerelman
114 posts
#10 • 1 Y
Y by Mango247
DottedCaculator wrote:
Hello, $f(0)$ does not exist, as the domain of $f$ is all positive real numbers.

Why do you except 0 to positive real number?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DottedCaculator
7354 posts
#11 • 1 Y
Y by Mango247
0 is not positive.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JuniorPerelman
114 posts
#12 • 3 Y
Y by Mango247, Mango247, Mango247
DottedCaculator wrote:
0 is not positive.

Is it negative?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
phoenixfire
372 posts
#13 • 2 Y
Y by The_Musilm, megarnie
$\mathbb R^+$ does not contain a zero. Unless you define it differently.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JuniorPerelman
114 posts
#14
Y by
JuniorPerelman wrote:
DottedCaculator wrote:
0 is not positive.

Is it negative?

I see know
Excuse me french maths and English maths are different
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rama1728
800 posts
#15
Y by
JuniorPerelman wrote:
JuniorPerelman wrote:
DottedCaculator wrote:
0 is not positive.

Is it negative?

I see know
Excuse me french maths and English maths are different

Wdym french maths and english maths?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Bradygho
2507 posts
#16 • 1 Y
Y by rama1728
rama1728 wrote:
Wdym french maths and english maths?

I think JuniorPerelman means French math terms are differently defined than English math terms. Though the overall essence is the same.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ZETA_in_olympiad
2211 posts
#17 • 2 Y
Y by rama1728, Mango247
JuniorPerelman wrote:
DottedCaculator wrote:
0 is not positive.

Is it negative?

It's non-negative and non-positive.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathLuis
1526 posts
#18
Y by
Let $P(x,y)$ the assertion of the given F.E.
Claim 1: $f$ is an involution.
Proof: By this lemma:
Lemma wrote:
If $f,g,h:\mathbb{R}^+ \to\mathbb{R}^+$ be functions such that
\[f(g(x)+y)=h(x)+f(y) \quad \forall x,y>0\]then $\frac{g}{h}$ is a constant function.
We have that $f(f(x))=cx$ so re-write the F.E. as
$$f(cxf(x)+y)=xf(x)+f(y)$$Now take $f$ in both sides of $P(f(x),y)$ and then use the result of $P(x,f(y))$ to get that
$$c^3xf(x)+cy=f(f(c^2xf(x)+y))=f(cxf(x)+f(y))=xf(x)+cy \implies c=1$$Hence $f(f(x))=x$ so $f$ is involutive.
Claim 2: $f(y)+xf(x) \ge y$ for all $x,y$
Proof: Assume that $y>f(y)+xf(x)$ for some $x,y$ then we have $\frac{y}{xf(x)}>\frac{f(y)}{xf(x)}+1$ now since for any positive real $r$ there exists a positive integer $n$ such that $r+1>n \ge r$ we have that there exists $n$ positive integer such that $\frac{y}{xf(x)}>\frac{f(y)}{xf(x)}+1>n \ge \frac{f(y)}{xf(x)}$ which means that $y>nxf(x) \ge f(y)$. Now by easy induction we get that
$$f(nxf(x)+y)=nxf(x)+f(y)$$And on this equation do $y=y-nxf(x)$ to get that
$$f(y-nxf(x))=f(y)-nxf(x) \le 0 \; \text{contradiction!!}$$Hence our claim is true.
Finishing: Call the assertion of Claim 2 $Q(x,y)$ so now by $Q(x,f(y))$ we get that $y+xf(x) \ge f(y)$ and multpliying by $y$ in both sides $y^2+yxf(x) \ge yf(y)$ and by letting $y \to 0$ we have that $yf(y)$ is as smaller as we want so on $Q(x,y)$ set $xf(x)$ as smaller as we want so we get $f(y) \ge y$ but by setting $y=f(y)$ we get $y \ge f(y)$ hence $f(y)=y$.
Hence $\boxed{f(x)=x \; \forall x \in \mathbb R^+}$ is a solution thus we are done :D
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ZETA_in_olympiad
2211 posts
#19
Y by
MathLuis wrote:
Lemma wrote:
If $f,g,h:\mathbb{R}^+ \to\mathbb{R}^+$ be functions such that
\[f(g(x)+y)=h(x)+f(y) \quad \forall x,y>0\]then $\frac{g}{h}$ is a constant function.

You have to prove the lemma (as it's not obvious nor trivial) if you can't then you should show where it's proved i.e \ cite where it can be found.
This post has been edited 2 times. Last edited by ZETA_in_olympiad, Jun 5, 2022, 9:32 AM
Reason: i.e
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
megarnie
5608 posts
#20 • 1 Y
Y by ZETA_in_olympiad
ZETA_in_olympiad wrote:
MathLuis wrote:
Lemma wrote:
If $f,g,h:\mathbb{R}^+ \to\mathbb{R}^+$ be functions such that
\[f(g(x)+y)=h(x)+f(y) \quad \forall x,y>0\]then $\frac{g}{h}$ is a constant function.

You have to prove the lemma (as it's not obvious nor trivial) if you can't then you should show where it's proved i.e \ cite where it can be found.

The lemma can be found https://artofproblemsolving.com/community/c6h2807267p24753821
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
navi_09220114
480 posts
#21
Y by
Solution with the Malaysian team:

The main idea (almost ubiquitous with R+ FEs) is to estimate $f(small)$ as negligible, and this is often done by induction on $\mathbb{Z}$, or by introducing a new variable - similar to IMOSL 2007 A4.

$\textbf{Part 1.}$ Observe that we have for all $m, n\in \mathbb{Z}$, $$f(mf(x)f(f(x))+nf(y)f(f(y))+z)=mxf(x)+nyf(y)+f(z)$$Let $t=mf(x)f(f(x))+nf(y)f(f(y))+z$ and vary $z>0$ (intuitively, this $z$ is small), this implies that $$t>mf(x)f(f(x))+nf(y)f(f(y)) \Rightarrow f(t)>mxf(x)+nyf(y)$$For simplicity let $a=f(x)f(f(x)), b=f(y)f(f(y)), c=xf(x), d=yf(y)$, so that we get $$t>ma+nb \Rightarrow f(t)>mc+nd$$If $\frac{a}{b}<\frac{c}{d}$ then let $n=-\left\lfloor\frac{ma}{b}\right\rfloor$ we get $$b+1>ma-\left\lfloor\frac{ma}{b}\right\rfloor b \Rightarrow f(b+1)>mc-\left\lfloor\frac{ma}{b}\right\rfloor d>m\left(c-\frac{a}{b} d\right) - d$$which is a contradiction by taking $m$ arbitrarily huge.

So $\frac{a}{b}\ge\frac{c}{d}$. By swapping $x$ and $y$, we get that $\frac{a}{b}=\frac{c}{d}$ must hold, that is $$\frac{f(f(x))}{x}=\frac{f(f(y))}{y}$$for all $x$ and $y$. Hence $f(f(x))=cx$ for some $c>0$.

$\textbf{Part 2.}$ The original equation becomes $$f(cxf(x)+y)=xf(x)+f(y)$$Consider $P(x,f(y))$ and $P(f(x),y)$, then $$f(cxf(x)+f(y))=xf(x)+cy$$$$f(c^2xf(x)+y)=cxf(x)+f(y)$$So this gives $$c^3xf(x)+cy=f(f(c^2xf(x)+y))=f(cxf(x)+f(y))=xf(x)+cy$$which gives $c=1$. So $f(f(x))=x$, and we get $f(xf(x)+y)=xf(x)+f(y)$.

$\textbf{Part 3.}$ With the same idea as above (to invoke inequalities), we see that $f(nxf(x)+y)=nxf(x)+f(y)$ for all $n\in \mathbb{Z}$, so $$t>nxf(x) \Rightarrow f(t)>nxf(x)$$Replace $t$ by $f(t)$, then $$f(t)>nxf(x) \Rightarrow t>nxf(x)$$This immediately implies $$nxf(x)<t\le (n+1)f(x) \iff nxf(x)<f(t)\le (n+1)xf(x)$$$$\Rightarrow |f(t)-t|\le xf(x)$$for all $t$ and $x$. It suffices to prove that $xf(x)$ is arbitrarily small. Suppose for some $C>0$, $xf(x)\ge C$ for all $x$, then $f(x)\ge\frac{C}{x}$. Then take $t=\frac{C}{n}, x=1$ for large integers $n>C$, so that $f(t)\ge n>1>t$, so $$n-\frac{C}{n}=\frac{C}{t}-t\le f(t)-t\le f(1)$$but take $n\rightarrow +\infty$ gives a contradiction.

So $xf(x)$ is arbitrarily small, implying $f(t)=t$ for all $t>0$.

QED
This post has been edited 8 times. Last edited by navi_09220114, Sep 9, 2024, 5:14 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ItzsleepyXD
145 posts
#22
Y by
By Lemma :
$\frac{f(f(x))}{x}$ is constant. So for some $c \in \mathbb{R^+} , f(f(x))=cx $ $\forall x \in \mathbb{R^+}$
$P(f(x),y): f(c^2xf(x)+y) = cxf(x)+f(y).$
so $c^3xf(x)+y=f(f(c^2xf(x)+y))=f(cxf(x)+f(y))=xf(x)+xy$.
implies that $c^3=1 \rightarrow c=1 \rightarrow f(f(x))=x$
$P(x,y) : f(xf(x)+y)=xf(x)+f(y) , P(x,f(y)) : f(xf(x)+f(y)) = xf(x)+y$

Claim $f(y)+xf(x) \geq y$
Proof : if $y>f(y)+xf(x)$ ,by $f(f(y))=y \rightarrow f(y) > y+xf(x)$
so $y-xf(x) > f(y) > y+xf(x)$ contradiction.

so $f(y)+xf(x) \geq y , y+xf(x) \geq f(y)$
implies that $y+xf(x) \geq f(y) \geq y-xf(x)$

Claim there is no $C \in \mathbb{R^+}$ such that $C \leq xf(x)$ $\forall x \in \mathbb{R^+}$
Proof : if there exist $C \leq xf(x)$ $\forall x \in \mathbb{R^+}$
from $y+xf(x) \geq f(y)$ implies that $y^2+yxf(x) \geq yf(y) \geq C$ but $y \rightarrow 0$ lead to a contradiction.
So $xf(x)$ is arbitrary small , thus $f(y) = y$ $\forall y \in \mathbb{R^+}$ . done $\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jasperE3
11334 posts
#23
Y by
Functional_equation wrote:
Find all functions $f:\mathbb R^+\rightarrow \mathbb R^+$ such that$$f(f(x)f(f(x))+y)=xf(x)+f(y)$$for all $x,y\in \mathbb R^+$

$\textit{Proposed by Functional\_equation, Mr.C and TLP.39}$

Claim 1: $f(f(x))=cx$ for some constant $c\in\mathbb R^+$
True by the $fgh$ lemma (link).

Claim 2: $c=1$
Let $P(x,y)$ be the assertion $f(cxf(x)+y)=xf(x)+f(y)$. Note that $f(f(x))=cx$ implies:
$$f(cx)=f(f(f(x)))=cf(x)$$for all $x\in\mathbb R^+$. Then, suppose $c\ne1$, we have:
$P(x,cyf(y))\implies f(cxf(x)+cyf(y))=xf(x)+f(cyf(y))=xf(x)+cf(yf(y))$.
Swapping $x,y$ and comparing, we get that:
$$cf(xf(x))=xf(x)+d$$for some constant $d\in\mathbb R$. Then:
$$c^2d=c^3f(xf(x))-c^2xf(x)=cf(cxf(cx))-cxf(cx)=d,$$and so $d=0$ (as $c\ne1$).
The equation above turns into $cf(xf(x))=xf(x)$ now, plugging in $x=c$ we have $cf(cf(c))=cf(c)$, and by cancellation and injectivity $f(c)=1$.
Now spamming $f(f(x))=cx$ will give us our result: we have (applying $f$ to both sides) $f(1)=f(f(c))=c^2$, so $f\left(c^2\right)=f(f(1))=c$, so $f(c)=f\left(f\left(c^2\right)\right)=c^3$, so $c^3=1$, contradiction. Now that this claim has been proven, Claim 1 simplifies to $f(f(x))=x$.


Let $S=\{a\in\mathbb R^+\mid f(x+a)=f(x)+a\forall x\in\mathbb R^+\}$.
Claim 3: $\mathbb Q^+\subseteq S$
$P(1,1)\Rightarrow f(2f(1))=2f(1)$
From Claim 2 we have $xf(x)\in S$ for all $x\in\mathbb R^+$. In particular, $\frac1nf\left(\frac1n\right)\in S$ for all $n\in\mathbb N$ and $f(1)\in S$. Because of how $S$ is defined, if $a\in S$ then any natural multiple of $a$ must also be in $S$ (it's closed under addition), so $f\left(\frac1n\right)\in S$ and $2f(1)\in S$. Then, we have:
$$2f(1)+\frac1n=2f(1)+f\left(f\left(\frac1n\right)\right)=f\left(2f(1)+f\left(\frac1n\right)\right)=f(2f(1))+f\left(\frac1n\right)=2f(1)+f\left(\frac1n\right),$$so $f\left(\frac1n\right)=\frac1n$. Then $\frac1nf\left(\frac1n\right)\in S$ becomes $\frac1{n^2}\in S$, but remember all integral multiples of this figure are also in $S$, so $\frac{mn}{n^2}=\frac mn\in S$ for any $m,n\in\mathbb N$, hence proven.

Finish: $f(x)\ge x$
Suppose there is some $u\in\mathbb R^+$ with $f(u)<u$. Since $\mathbb Q^+$ is dense in $\mathbb R^+$, we can choose a rational $q$ such that $f(u)<q<u$. Recall that $q\in S$, so:
$$f(u)=f(u-q)+q>q,$$a contradiction.
Therefore $f(x)\ge x$ for all $x\in\mathbb R^+$. From $f(f(x))=x$ we obtain:
$$x=f(f(x))\ge f(x)\ge x$$with equality everywhere, hence $\boxed{f(x)=x}$ is the only solution (we can easily check that it fits).
This post has been edited 1 time. Last edited by jasperE3, Apr 28, 2025, 4:38 PM
Z K Y
N Quick Reply
G
H
=
a