extended euclidean algorithm and the concept of multiplicative inverse
<p>I have with python:</p>

<pre><code>e*d == 1%etf
</code></pre>

<p>we know (e) and (etf) and must discover (d) using the
extended euclidean algorithm and the concept of 
multiplicative inverse of modular arithmetic.</p>

<pre><code>d = (1/e)%etf

d = (e**-1)%etf
</code></pre>

<p>generate a global wrong number, please help me find
(d) using the rules above explained.</p>

<p>The solution (<a href="http://stackoverflow.com/questions/4798654/modular-multiplicative-inverse-function-in-python">Modular multiplicative inverse function in Python</a>)
illustrated below gives me wrong computational result</p>

<pre><code>e*d == 1 (mod etf)
d = (e**(etf-2)) % etf 
d = pow(e,etf-2,etf)
</code></pre>

<p>Am I making some mistake elsewhere? Is this calculation ok?</p>
