Extended Euclidean algorithm

RSA:

(1/192) = k mod 7
whats k?

I ran it through a calculator and the answer is 5.
I am not very experienced with modular arithmetic but
I assume that this is because

First I will rearrange the equation
(1/192) = k mod 7
1 = 192k mod7
192k = 1 mod7 and this means that
192k divided by 7 will have a remainder of 1

now
192*5 divided by 7 = 960 divided by 7 = 137 remainder 1
with modular arithmetic it is the remainder that is important.
--------------------------------------------------------------------------------
I may return to this question later, like i said, I am not very familiar with modular arithmetic.

hi RSA,
I posted your question in mathhelpforum,
and the answers that I got are on the included web page.

http://mathhelpforum.com/algebra/225435-modular-arithmetic.html