Timeline for functional equation, how to solve
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2013 at 16:51 | comment | added | Barry Cipra | It seems to me that bo.gu's "answer" is a sensible suggestion. (It would have been better posted as a comment, but it looks like bo.gu may not have enough reputation points to do so.) Looking at $n=1$ cuts through the clutter and boils the OP's question down to the following: "Suppose $x_i$ and $y_i$ are real numbers. Are there functions $f$ and $g$ such that given $x_2=1$ and $y_2=1$, we have $x_1=f(x_0,y_0)$, $y_1=g(y_0,x_0)$, $x_2=f(x_1,y_1)$, and $y_2=g(y_1,x_1)$." It's not clear (to me, at least) what this means. | |
| Mar 16, 2013 at 15:43 | comment | added | Ryan Reich | This was also asked at the same time on math.stackexchange: math.stackexchange.com/questions/331802/…. | |
| Mar 16, 2013 at 15:25 | comment | added | ashim | if n=1 then F and G maps everything nonzero to one | |
| Mar 16, 2013 at 15:19 | history | edited | ashim | CC BY-SA 3.0 |
added 1 characters in body
|
| Mar 16, 2013 at 8:04 | comment | added | Duchamp Gérard H. E. | I cannot edit your question but there's a typo [Hadamar]-->[Hadamard] after the name of the mathematician Jacques Hadamard. | |
| Mar 16, 2013 at 7:35 | comment | added | bo.gu | Maybe you can first think the case n=1 | |
| Mar 16, 2013 at 7:08 | history | edited | ashim | CC BY-SA 3.0 |
deleted 60 characters in body
|
| Mar 16, 2013 at 6:18 | history | edited | ashim | CC BY-SA 3.0 |
added 46 characters in body; added 2 characters in body
|
| Mar 16, 2013 at 5:15 | history | edited | ashim | CC BY-SA 3.0 |
added 33 characters in body
|
| Mar 16, 2013 at 4:25 | history | asked | ashim | CC BY-SA 3.0 |