Equality of Cycles

Theorem
Let $$S_n$$ denote the symmetric group on $n$ letters.

Let $$\rho, \sigma \in S_n$$ both be $k$-cycles of $$S_n$$.

Then $$\rho = \sigma$$ iff they are identical when written with the lowest element first.