On the functional equation f(x + y) = g(xy)

The authors investigate the functional equation \({f}({x} + {y}) = {g}({xy})\) for unknown functions \(f\colon A+A\to Y\) and \(g\colon A\cdot A\to Y\), when \(A\) is:\N\N(1) An open interval of the positive elements in an Archimedean ordered field;\N\N(2) The set of positive integers;\N\N(3) The set of positive dyadic rationals;\N\Nand \(Y\) is arbitrary. It turns out, that the solutions in each case are (practically) constant functions. As a counterpart of these results, the authors show that there exists a subset \(A\) of the positive reals (closed under addition and multiplication) such that, for any infinitely countable set \(Y\), there exist functions \(f,g\colon A\to Y\) satisfying the functional equation in question such that \(f\) is surjective. As an application, they prove that some kinds of restricted Pexider-type systems of functional equations have only constant solutions.

Recommendations

Cites work

Cited in

(1)

Short remark to the Rimán’s Theorem

This page was built for publication: On the functional equation \({f}({x} + {y}) = {g}({xy})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562887)