For any $(x,y)∈ \Bbb N$ , x ~ y is an equivalence relation if and only if $xy$ is a perfect square. What are the equivalence classes? Here is my progress so far.
By the rules of multiplication we know that it is already symmetric and reflexive because for any $x∈\Bbb N$,$ x*x= {x^2}$ is by definition a perfect square and for any $x,y∈\Bbb N,xy=yx$ . But for transitivity and finding the equivalence classes I have hit a road block. My professor mentioned that prime factorization can be used but I just aren't seeing it.
Let $x=p_1^{r_1}\cdots p_n^{r_n}$ and $y=p_1^{s_1}\cdots p_n^{s_n}$, with all $r_k$ and $s_k$ nonnegative.
If $xy$ is a perfect square, then $2|r_k+s_k$ for each $k$. In other words, $r_k\equiv s_k\pmod 2$. Can you get it from here?
For the equivalence classes, lets start with the equivalence of $1$. Since, $1y=y$, we have $1\sim y\iff y$ is a perfect square. Let's let $[n]$ be the equivalence class of $n$. Then $[1]=\{n^2:n\in\Bbb N\}$.
Now, lets find $[p]$ where $[p]$. If $py$ is a perfect square, then $y=p^rq_1^{r_1}\cdots q_n^{r_n}$ where each $q_k$ is prime, $r$ is odd and $r_k$ is even for each $k$.
Next do this for pairs of primes, and then triples of primes. You should get the idea of how to identify the equivalence classes.