All Questions
3 questions
7
votes
1
answer
382
views
$\log \log p / \log \log n$, where $p|n$, gets equidistributed in [0,1] (for almost all $n$)
According to Hardy-Ramanujan/Erdős-Kac we know that usually there are $\sim\log\log n$ prime numbers in a factorization. But if you pick up a natural number at random, and you factor it, what is the ...
5
votes
1
answer
214
views
Dynamics of the distribution of prime factorization types in increasing intervals
I've tagged this as reference request as surely this question must be very well investigated, I just don't know how to look for it. Most likely the perfect answer will be in form of a keyword for ...
4
votes
2
answers
199
views
Counting integers with k large prime divisors
If $x \ge y \ge 1$ are real numbers and if $k$ is a positive integer, take $\Phi_k(x, y)$ to be the number of integers $\le x$ with exactly $k$ prime factors and no prime factor $\le y$. If $y$ is ...