Talk:Explicit formulae for L-functions

Mathematics Start‑class Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-priority on the project's priority scale.

Error?

"...Riemann found an explicit formula for the number of primes π(x) less than a given number x." Should this not be the number of primes less than or equal to a given number x?

I tried to verify mathematically that the formula gives this, but I am not adept enough to work with it much...I did find that the f(x) formula can work either way (if pi(x) includes x, then f(x) includes x; and if pi(x) excludes x, then f(x) excludes x). This was quite simple using induction.

Besides verifying mathematically, I have always seen the prime counting function before as including x - and it is defined that way on the Wiki page. —Preceding unsigned comment added by Cstanford.math (talk • contribs) 01:33, 30 October 2010 (UTC)[reply]