What's the fastest growing function known to contain infinitely many primes? – math.stackexchange.com

What's the fastest growing function known to contain infinitely many primes? – math.stackexchange.com

17:57 No Comments
I know that Dirichlet's Theorem says that for every $a,b\in\mathbb{N}$ with $\gcd(a,b)=1$ the function \begin{align*} f:\mathbb{N}&\to\mathbb{N}\\ n&\mapsto an+b \end{align*} evaluates to a ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "What's the fastest growing function known to contain infinitely many primes? – math.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)