Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

This question already has an answer here:

I need help with this:

"Find functions $f$, $g : \mathbb{Z} \rightarrow \mathbb{Z}$, knowing that $g$ is injective and such that: $$f(g(x)+y) = g(f(x)+x), \mbox{ for all } x, y \in \mathbb{Z}.$$ Or : $$f(g(x)+y) = g(f(y)+x), \mbox{ for all } x, y \in \mathbb{Z}.$$

share|cite|improve this question

marked as duplicate by Ross Millikan, rschwieb, Arkamis, Asaf Karagila, Stefan Hansen Feb 14 '13 at 6:20

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

I note that this is not quite a duplicate, as the variables are different. It may be that the techniques of the cited answer apply as well. Certainly $f(x)=g(x)=x$ is again a solution. – Ross Millikan Feb 13 '13 at 23:09

1 Answer 1

For the first, note that the right side is independent of $y$, so $f(x)$ is constant. Then we have $f(0)=g(f(0)+x)$ with the left side independent of $x$. Then $g$ must be constant, but it must be injective. No solution.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.