Gapplet

When given an indication of the size, two primes p, q are found, together with two numbers v, w such that

v * w = 1 mod (p-1)(q-1).

Then, m = p * q can serve as the modulus for RSA encryption, with encoding key v and decoding key w.

Give the size of the primes p, q sought for, 
e.g., 8
 </COMMENT>
 
 </COMMENT>
 
</COMMENT>