All Questions
2 questions
20
votes
1
answer
594
views
Distinct exponents in the factorization of the factorial, a problem of Erdős
In the 1982 paper below, Paul Erdős proved that if $h(n)$ is the number of distinct exponents in the prime factorization of $n!$ then $$c_1\Big(\frac{n}{\log n}\Big)^{1/2} < h(n) < c_2\Big(\frac{...
- 203
2
votes
1
answer
230
views
On $\sum_{\substack{p\leq x\\p,p+2\text{ twin primes}}}\frac{(\log p)^m}{p}$, on assumption of the first Hardy–Littlewood conjecture
I wondered, inspired in a result from [1] (Proposition 17) what should be the asymptotic behaviour of the sequence, on assumption of the First Hardy–Littlewood conjecture,
$$\sum_{\substack{\text{...
