Let $p\in\mathbb N$ be a prime number and define for $x,y\in\mathbb N$, $$x\sim y\iff (p^n|x \iff p^n|y \text{ for all }n\in\mathbb N).$$ The vertical bar $|$ denotes the divisor-operation. Is $\sim$ an equivalent relation on $\mathbb N$? I've already shown reflexivity and symmetry, but I'm stuck on the transitive property.
Is "$x\sim y$ iff $x$ and $y$ have the same powers of $p$ dividing them" an equivalence relation?
2
$\begingroup$
elementary-set-theory
-
3"For all $n \in \mathbb N$?" The only integers $x$ and $y$ satisfying this for all $n$ is the number zero. What do you want exactly? – 2012-06-02
-
1I imagine what gary means is to have "if and only if" in place of "and". – 2012-06-02
-
0I still don't get it? – 2012-06-02
-
0@M.B. The condition is just saying that (for the fixed prime $p$) the highest power of $p$ going into $x$ and $y$ is the same. – 2012-06-02
-
0Ah, $p$ is fixed. I missed that. – 2012-06-02