My Math Forum prime counting function

 Number Theory Number Theory Math Forum

 April 3rd, 2019, 01:13 PM #1 Member   Joined: Mar 2019 From: iran Posts: 64 Thanks: 6 prime counting function pi(n) = n/ln(n) + n/ln^2(n) + n/ln^3(n) + ... I think this is stronger than prime number theorem and closer to the true value of pi(n). Last edited by skipjack; April 3rd, 2019 at 03:53 PM.
 April 3rd, 2019, 02:17 PM #2 Senior Member   Joined: Dec 2015 From: iPhone Posts: 486 Thanks: 75 It is similiar to $\displaystyle \pi(x)$~$\displaystyle Li(x)$.
 April 4th, 2019, 03:01 AM #3 Senior Member   Joined: Dec 2015 From: iPhone Posts: 486 Thanks: 75 Here is the similiar formula : Prime Number Theorem -- from Wolfram MathWorld

 Tags counting, function, prime

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post youngmath Number Theory 12 April 11th, 2019 05:52 AM numberguru1 Number Theory 3 November 6th, 2015 01:21 PM Jonas Castillo T Number Theory 6 May 9th, 2015 06:26 PM jim198810 Number Theory 6 March 26th, 2015 07:31 PM fafa Number Theory 24 June 22nd, 2013 12:55 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top