Skip to main content

All Questions

Filter by
Sorted by
Tagged with
29 votes
7 answers
7k views

Asymptotic density of k-almost primes

Let $\pi_k(x)=|\{n\le x:n=p_1p_2\cdots p_k\}|$ be the counting function for the k-almost primes, generalizing $\pi(x)=\pi_1(x)$. A result of Landau is $$\pi_k(x)\sim\frac{x(\log\log x)^{k-1}}{(k-1)!\...
Charles's user avatar
  • 9,114
2 votes
0 answers
422 views

Sequences with high densities of primes: how to boost them to get even more and larger primes

I propose a methodology to help find large prime numbers with a much higher probability than picking up random numbers and testing them for primality. This would help speed up prime number generators ...
Vincent Granville's user avatar
0 votes
1 answer
669 views

Paradox in additive combinatorics

Let $S$ be an infinite set of positive integers. Let us define the following quantities: $N_S(z)$ is the number of elements of $S$, less or equal to $z$ $r_S(z)$ if the number of positive integer ...
Vincent Granville's user avatar
4 votes
1 answer
628 views

Asymptotics for $\prod(1-\frac{1}{p})$ over all primes $p\leq x$ with $p \equiv 3 \bmod 4$

Let us define the following functions: \begin{equation*} \small A(x)=\prod_{\substack{p\leq x\\ p\equiv 3 \bmod 4}} \Big(1-\frac{1}{p}\Big), \mbox{ } \mbox{ } B(x)=\prod_{\substack{p\leq x\\ p\...
Vincent Granville's user avatar
3 votes
2 answers
876 views

Asymptotics for the number of partitions of $n$ into odd prime parts

Hello! I am interested in the asymptotic behavior of the function $p_o(n)$ defined as the number of partitions of $n$ into odd prime parts A099773 - http://oeis.org/A099773 . I couldn't find any ...
Jernej's user avatar
  • 3,463
2 votes
3 answers
365 views

Is this number theoretic quantity bounded above?

I am considering a combinatorial argument which involves the following quantity. We use the prime counting function $\pi(n)$ and to save on exponents we set $h=\pi(n/2)$. The quantity as a function ...
Gerhard Paseman's user avatar
1 vote
1 answer
867 views

$n$th prime: a better approximation

Let $p_n$ be the $n$-th prime, then from Wikipedia I got that $p_n \approx n \left(\ln n + \ln \ln n -1 + \frac{\ln \ln n-2}{\ln n}+\frac{6\ln \ln n-( \ln \ln n)^2-11}{\ln^2 n} \right)$. What is a ...
user avatar