2000 character limit reached
On primes and practical numbers
Published 21 Jul 2020 in math.NT | (2007.11062v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.