Put pegs around a circle, then run a thread from every peg n to peg k × n.
Peg 0 is at the top, and the pegs count clockwise. Only the remainder after dividing by N matters, so k × n is reduced mod N.