# Inequality with the prime-counting function

Printable View

• December 17th 2008, 09:13 AM
HTale
Inequality with the prime-counting function
Hi there guys, I hope I've posted this in the right section;

I'm going through a paper, and there is one statement which is:

$n^{\pi(n)} < 3^n$

for sufficiently large $n$, where $\pi(n)$ is the prime-counting function defined as the function counting the number of prime numbers less than or equal to $n$. I'm having real difficulty justifying this claim, and I'd be really grateful if someone could help me out.

Thanks in advance,
HTale

• December 17th 2008, 11:07 AM
Opalg
Quote:

Originally Posted by HTale
I'm going through a paper, and there is one statement which is:

$n^{\pi(n)} < 3^n$

for sufficiently large $n$, where $\pi(n)$ is the prime-counting function defined as the function counting the number of prime numbers less than or equal to $n$.

Take logs, and it says $\pi(n)<\frac n{\ln n}\ln3$. But ln(3)>1, so the result will follow from the prime number theorem.
All times are GMT -8. The time now is 08:11 AM.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 9, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9419031143188477, "perplexity_flag": "head"}