This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
You haven't shown that there is no other solution. In fact, as my solution suggests, if we restrict f only to the integers, there exists another solution, and you haven't ruled it out.
The induction part is wrong, but it's a minor mistake; verifying that f(x)=x works is simply plugging it into the equation. The problem is that other potential solutions haven't been ruled out.
As mentioned by Ivan, I don't understand what you are doing here. I agree up the Case 2, but fail to follow form "Since the main functional equation ..."
Let P(x,y) be the statement f(x+y)+f(x)f(y)=f(xy)+f(x)+f(y).
P(x,0)⟹f(x)+f(x)f(0)=f(0)+f(x)+f(0)⟹f(x)f(0)=2f(0). If f(0)=0, we can cancel it to give f(x)=2 for all x, which is a solution. Otherwise, f(0)=0.
P(2,2)⟹f(4)+f(2)f(2)=f(4)+f(2)+f(2)⟹f(2)2=2f(2). This gives f(2)=0 or f(2)=2.
P(1,1)⟹f(2)+f(1)2=3f(1). If f(2)=0, this leads to f(1)=0 or f(1)=3. If f(2)=2, this leads to f(1)=1 or f(1)=2.
P(−1,1)⟹f(−1)f(1)=2f(−1)+f(1). f(1)=2 leads to a contradiction, so we are left with three cases. To recap, our current cases are (f(1),f(2))=(0,0),(1,2),(3,0).
P(x,1)⟹f(x+1)+f(x)f(1)=2f(x)+f(1). We can now apply induction (in both ways, going on the positive integers and the negative integers) to determine the value of f on the integers:
Case 1:f(1)=0,. Then P(x,1)⟹f(x+1)=2f(x). Inducting gives f(x)=0 for all integer x.
Case 2:f(1)=1. Then P(x,1)⟹f(x+1)=f(x)+1. Inducting gives f(x)=x for all integer x.
Case 3:f(1)=3. Then P(x,1)⟹f(x+1)=3−f(x). Inducting gives f(x)=3 if x is odd and f(x)=0 if x is even.
Let x=pp+1,y=p+1 for nonzero integer p. Note that x+y=xy. Thus P(x,y)⟹f(x)f(y)=f(x)+f(y). Since we know the value of f(y), we can determine the value of f(x). That is, the value of f(1+1p).
Using P(x,1), we can induct again to determine the values of f(n+p1) for all integer n, including n=0.
P(p1,n)⟹f(pn)+f(p1)f(n)=f(n+p1)+f(p1)+f(n). Since we know the values of f(p1), f(n+p1), and f(n), we know the value of f(pn). That is, we know f to the rationals. I haven't actually worked it out to figure out whether Case 3 still persists.
I'm not sure how to extend this to the reals. I'm also pretty sure this is too convoluted (that is, there should be a simpler solution). You might want to first try to solve the following: find all f on the reals such that f(x+y)=f(x)+f(y) and f(xy)=f(x)f(y) for all reals x,y.
A functional equation problem shouldn't have the statement "if f is a polynomial..."; that statement makes it a polynomial equation problem (which has quite a different method to solve them).
Hey should we make a thread for "Brilliant Functional Equation Contest" ? This is just an excuse for me to improve our functional equation as one problem in INMO is definitely on functional equations.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Put x=y=0 f(0)+f(0)2=3f(0) This implies f(0)=0 or f(0)=2.
CaseI : f(0)=2 Now put x=0 3f(y)=4+f(y) f(y)=2
Case II: f(0)=0 Put x=y=2 f(4)+f(2)2=f(4)+2f(2) f(2)=2 or f(2)=0.
Since the main functional equation all terms are only monic functions so another solution is f(y)=0.
Other solution is f(y)=y which can be proved by induction.
Log in to reply
You haven't shown that there is no other solution. In fact, as my solution suggests, if we restrict f only to the integers, there exists another solution, and you haven't ruled it out.
Yea Ivan has a point. I don't understand how u can use induction when the domain is reals ?
Log in to reply
The induction part is wrong, but it's a minor mistake; verifying that f(x)=x works is simply plugging it into the equation. The problem is that other potential solutions haven't been ruled out.
As mentioned by Ivan, I don't understand what you are doing here. I agree up the Case 2, but fail to follow form "Since the main functional equation ..."
Log in to reply
I mean that both sides have terms which have 1 as coefficient so each term can be zero.
Let P(x,y) be the statement f(x+y)+f(x)f(y)=f(xy)+f(x)+f(y).
P(x,0)⟹f(x)+f(x)f(0)=f(0)+f(x)+f(0)⟹f(x)f(0)=2f(0). If f(0)=0, we can cancel it to give f(x)=2 for all x, which is a solution. Otherwise, f(0)=0.
P(2,2)⟹f(4)+f(2)f(2)=f(4)+f(2)+f(2)⟹f(2)2=2f(2). This gives f(2)=0 or f(2)=2.
P(1,1)⟹f(2)+f(1)2=3f(1). If f(2)=0, this leads to f(1)=0 or f(1)=3. If f(2)=2, this leads to f(1)=1 or f(1)=2.
P(−1,1)⟹f(−1)f(1)=2f(−1)+f(1). f(1)=2 leads to a contradiction, so we are left with three cases. To recap, our current cases are (f(1),f(2))=(0,0),(1,2),(3,0).
P(x,1)⟹f(x+1)+f(x)f(1)=2f(x)+f(1). We can now apply induction (in both ways, going on the positive integers and the negative integers) to determine the value of f on the integers:
Case 1: f(1)=0,. Then P(x,1)⟹f(x+1)=2f(x). Inducting gives f(x)=0 for all integer x.
Case 2: f(1)=1. Then P(x,1)⟹f(x+1)=f(x)+1. Inducting gives f(x)=x for all integer x.
Case 3: f(1)=3. Then P(x,1)⟹f(x+1)=3−f(x). Inducting gives f(x)=3 if x is odd and f(x)=0 if x is even.
Let x=pp+1,y=p+1 for nonzero integer p. Note that x+y=xy. Thus P(x,y)⟹f(x)f(y)=f(x)+f(y). Since we know the value of f(y), we can determine the value of f(x). That is, the value of f(1+1p).
Using P(x,1), we can induct again to determine the values of f(n+p1) for all integer n, including n=0.
P(p1,n)⟹f(pn)+f(p1)f(n)=f(n+p1)+f(p1)+f(n). Since we know the values of f(p1), f(n+p1), and f(n), we know the value of f(pn). That is, we know f to the rationals. I haven't actually worked it out to figure out whether Case 3 still persists.
I'm not sure how to extend this to the reals. I'm also pretty sure this is too convoluted (that is, there should be a simpler solution). You might want to first try to solve the following: find all f on the reals such that f(x+y)=f(x)+f(y) and f(xy)=f(x)f(y) for all reals x,y.
Log in to reply
I believe that you're missing the constant solution f(x)=2.
Log in to reply
I already wrote that one near the top.
Can u too please post some functional equations to solve ? I am quite weak at that
Log in to reply
Try these:
1. If f is a polynomial function satisying 2+f(x)f(y)=f(x)+f(y)+f(xy) for all real x,y and if f(2)=5, find f(f(2)).
2. A polynomial function f(x) satisfies the condition f(x)f(x1)=f(x)+f(x1) if f(12)=1729, then find f(10).
3.Find all functions f from R0,1 to R satisfying the functional relation f(x)+f(1−x1)=x(1−x)2(1−2x). Source:INMO
Buy the book Functional Equations by B.J. Venkatachala. It has very nice functional equations problem .
Log in to reply
A functional equation problem shouldn't have the statement "if f is a polynomial..."; that statement makes it a polynomial equation problem (which has quite a different method to solve them).
Hey should we make a thread for "Brilliant Functional Equation Contest" ? This is just an excuse for me to improve our functional equation as one problem in INMO is definitely on functional equations.