1
$\begingroup$

If we have a function $f$ with the property:

$$f: \mathbb{Z} \rightarrow \mathbb{Z}$$

and if we have a congruence over $\mathbb{Z}$ like so:

$$y\equiv z\pmod{n}$$

What are the conditions to then applying the arbitrary function to both sides?

$$f(y)\equiv f(z)\pmod{n}$$

  • 0
    What is $x$ in the equality? Do you mean for all $x$, or only for certain $x$?2017-02-15
  • 0
    I suppose $x$ would be an integer, should i write that in the question?2017-02-15
  • 0
    Something like $f: \mathbb{Z} \rightarrow \mathbb{Z}$ is definitely missing. Also $f$ invertible2017-02-15

0 Answers 0