I was actually looking for some notes regarding the history of the Chinese Remainder theorem and came across the link
Chinese Remainder Theorem where they illustrate a solution which involves division table modulo 5. I quote the problem here,
p1: x = 2 (mod 3)
p2: x = 3 (mod 5)
p3: x = 2 (mod 7)
From p1, x = 3t + 2, for some integer t. Substituting this into p2 gives 3t = 1 (mod 5).
Looking up 1/3 in the division table modulo 5, this reduces to a simpler equation
p4: t = 2 (mod 5)
I'm not able to follow how the '1/3' gives way to t = 2 mod 5. I tried looking for the division table modulo 5 in the web but couldn't find anything substantial.
Can anyone shed some more light on this table?