Okay, so j is always an integer? mod(1,j) would always equal 1...

>Guess i was innacurate again : j is not a prime number , but d is . J is the product of (a-1) and (b-1) , where a and b are prime numbers.
>
>Basically , I am trying to replicate some basic form of RSA encryption to play with it a bit , out of curiosity .