A quaternary diophantine inequality by prime numbers of a special type
S. I. Dimitrov

TL;DR
This paper proves that for certain exponents, the inequality involving four prime powers can be approximately solved with primes where each prime plus two has limited prime factors.
Contribution
It establishes the existence of solutions to a quaternary Diophantine inequality with primes of a special type, extending previous results to a new range of exponents.
Findings
Solutions exist for large N within the specified inequality
Primes involved have at most 32 prime factors when increased by 2
The result applies for 1 < c < 832/825
Abstract
Let . For large real numbers and a small constant , the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers such that, for each , has at most prime factors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Advanced Mathematical Identities
