Random Diophantine Equations in the Primes

2023/05/10 by Holdridge, Philip
#11D72 #11E76 #11P32 #11P55 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2305.06306

Abstract

We consider equations of the form a₁x₁^k+...+a_sx_s^k and when they have solutions in the primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove that, whenever s≥ 3k+2, this holds for almost all such equations. This is based on work of Brüdern and Dietmann on the Hasse principle: arXiv:1212.4800. We then prove some further results about prime solubility and the prime Hasse principle, including a partial converse, and some counterexamples. Of particular interest are counterexamples of degree 2, which show that the analogue of the Hasse-Minkowski theorem fails for prime solubility.

Related

• Random diophantine equations, I
• Random Diophantine Equations in the Primes II
• Random Thue and Fermat equations
• Prime Solutions of Diagonal Diophantine Systems
• A Hasse-type principle for exponential diophantine equations and its applications