LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

On the shortest weakly prime-additive numbers

Photo by ryanjohns from unsplash

Abstract Text A positive integer n is called weakly prime-additive if n has at least two distinct prime divisors and there exist distinct prime divisors p 1 , … ,… Click to show full abstract

Abstract Text A positive integer n is called weakly prime-additive if n has at least two distinct prime divisors and there exist distinct prime divisors p 1 , … , p t of n and positive integers α 1 , … , α t such that n = p 1 α 1 + ⋯ + p t α t . It is clear that t ≥ 3 . In 1992, Erdős and Hegyvari proved that, for any prime p, there exist infinitely many weakly prime-additive numbers with t = 3 which are divisible by p. In this paper, we prove that, for any positive integer m, there exist infinitely many weakly prime-additive numbers with t = 3 which are divisible by m if and only if 8 ∤ m . We also present some related results and pose several problems for further research. Video For a video summary of this paper, please visit https://youtu.be/WC_VRFtY07c .

Keywords: prime additive; additive numbers; weakly prime; shortest weakly

Journal Title: Journal of Number Theory
Year Published: 2018

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.