Revision as of 01:33, 30 October 2010 edit Caleb Stanford (talk \| contribs) Extended confirmed users, IP block exemptions 5,615 edits No edit summary ← Previous edit		Revision as of 01:35, 30 October 2010 edit undo SineBot (talk \| contribs) Bots 2,564,730 edits m Signing comment by Cstanford.math - "" Next edit →
Line 11: 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 [[Prime-counting function\|the Wiki page]]. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:Cstanford.math\|Cstanford.math]] ([[User talk:Cstanford.math\|talk]] • [[Special:Contributions/Cstanford.math\|contribs]]) 01:33, 30 October 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->

Talk:Explicit formulae for L-functions: Difference between revisions