
Equivalence relation
Will someone help me with this problem. I'm struggling with it.
Define an equivalence relation R on the set P of positive integers by $\displaystyle mRn \Longleftrightarrow$ m and n have the same number of prime factors. Is there a function $\displaystyle f:P/R \rightarrow P/R \text{ such that } f([n]_R)=[3n]_R$ for each n?
I don't know how to show if this function exists or not. I just learned that a function is a relation such that if the ordered pair (x,y) and (x,y') are elements in R then, y=y'. I don't know how to apply that here. Please help.

Are you by any chance using Herbert Enderton’s text ELEMENTS OF SET THEORY?
If so, this problem appears in it with a nice theorem about function compatible with equivalence relations.
If not, here is the basic idea. Consider the function $\displaystyle f:\mathbb{Z} \mapsto \mathbb{Z}\;;\;f(n) = 3n$.
It should be clear to you that if $\displaystyle j\;\& \;k$ have the same number of prime factor then so do $\displaystyle 3j\;\& \;3k$.
In other words, $\displaystyle jRk\; \Rightarrow \;f(j)Rf(k)$ this is enough to say $\displaystyle f$ is compatible with $\displaystyle R$.
Thus there exists $\displaystyle F:\left\{ {\left[ n \right]_R :n \in \mathbb{Z}} \right\} \mapsto \left\{ {\left[ n \right]_R :n \in \mathbb{Z}} \right\}\;;\;F\left( {\left[ n \right]_R } \right) = \left[ {f(n)} \right]_R $.
If you need details your library should a copy of that text.