Primes Solutions Of Linear Diophantine Equations
arXiv:1310.8140
Abstract
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.
Fifteen Pages. Sharpen the Proof of Theorem 1. Keywords: Prime Diophantine Equations, Primes Pairs, DePolignac Problem, Primitive Root