  Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops
some techniques for proving the existence of infinitely many primes solutions x
= p, and y = q of the linear Diophantine equation y = mx + k.
