On primes and practical numbers

From MaRDI portal



Abstract: A number n is practical if every integer in [1,n] can be expressed as a subset sum of the positive divisors of n. We consider the distribution of practical numbers that are also shifted primes, improving a theorem of Guo and Weingartner. In addition, essentially proving a conjecture of Margenstern, we show that all large odd numbers are the sum of a prime and a practical number. We also consider an analogue of the prime k-tuples conjecture for practical numbers, proving the "correct" upper bound, and for pairs, improving on a lower bound of Melfi.


A number \(n\) is practical if every integer in \([1, n]\) can be expressed as a subset sum of the positive divisors of \(n\). In this paper, the authors study the distribution of practical numbers that are also shifted primes. For, they provide lower and upper bounds for the number of primes \(p\leq x\) such that \(p-h\) is practical, where \(h\) is any fixed odd integer. They prove that every sufficiently large odd integer is the sum of a prime and a practical number. Also, the authors give lower and upper bounds for the number of practical numbers \(n\) up to \(x\), such that \(n+h\) is also practical, where \(h\) is any fixed non zero even integer.





Describes a project that uses

Uses Software






This page was built for publication: On primes and practical numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115268)