On the shortest weakly prime-additive numbers

On the shortest weakly prime-additive numbers. A positive integer n is called weakly prime-additive if n has at least two distinct prime divisors and there exist distinct prime divisors of n and positive integers such that . It is clear that . In 1992, Erdős and Hegyvári proved that, for any prime p, there exist infinitely many weakly prime-additive numbers with which are divisible by p.

Article DOI: 10.1016/j.jnt.2017.06.013
Contributed by: Charles Johnson

Average: 0 (0)
Share video with friends:
Report Broken Video