On the equation P(x) = n! and a question of Erdős
✍ Scribed by Daniel Berend; Charles F Osgood
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 214 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We employ the probabilistic method to prove a stronger version of a result of Helm, related to a conjecture of Erdos and Turan about additive bases of the positive integers. We show that for a class of random sequences of positive integers \(A\), which satisfy \(|A \cap[1, x]| \gg \sqrt{x}\) with pr
Let A=[a 1 , a 2 , ...] N and put A(n)= a i n 1. We say that A is a P-set if no element a i divides the sum of two larger elements. It is proved that for every P-set A with pairwise co-prime elements the inequality A(n)<2n 2Â3 holds for infinitely many n # N. ## 2001 Academic Press where A(n)= a i