you have to find
x*p+y*q=1 (p,q - primes)
this is possible with extended GCD:
try this:
http://www.brainyencyclopedia.com/encyclopedia/e/ex/extended_euclidean_algorithm.html