Robert,

Are you saying j is a prime number? There is no solution if that is the case...


>Ken ,
>
>Sorry , guess I wasn't quite accurate with the original posting . I need the program to pick the first integer e that satisfies the
>
>

>e=mod(1,j)/d
>

>
>condition . And because the numbers are pretty large primes , e is near 0 , and int(e) returns 0 . Not quite what I had expected.