线性丢番图方程的素解
Primes Solutions Of Linear Diophantine Equations
摘要:
设k => 1,m => 1是小的固定整数,gcd(k,m)= 1.本文给出了证明线性丢番图方程y = mx + k的无穷多个素数解x = p,y = q存在性的技巧.
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。