arXiv · 1310.8140
Primes Solutions Of Linear Diophantine Equations
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.
Explore related subjects
Keep this discovery
N. A. Carella. 2014-04-03. Primes Solutions Of Linear Diophantine Equations. https://arxiv.org/abs/1310.8140
Cite the original work for its findings. Save a collection to share your selection of sources.