On the Weakly Prime-Additive Numbers with Length 4
Abstract
In 1992, Erdos and Hegyv\'ari showed that for any prime p, there exist infinitely many length 3 weakly prime-additive numbers divisible by p. In 2018, Fang and Chen showed that for any positive integer m, there exists infinitely many length 3 weakly prime-additive numbers divisible by m if and only if 8 does not divide m. Under the assumption (*) of existence of a prime in certain arithmetic progression with prescribed primitive root, which is true under the Generalized Riemann Hypothesis (GRH), we show for any positive integer m, there exists infinitely many length 4 weakly prime-additive numbers divisible by m. We also present another related result analogous to the length 3 case shown by Fang and Chen.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.