Harristotelian Logic

So it turns out that Tim Peters is doing something dumb, and it occurs to me that maybe I could explain more or even code the proper way to iterate with primes above x^{1/3} when calculating pi(x) with my prime counting function in its sieve form, but hey I already did all of that!

It's all old stuff.

That Christian Bau knew all of this and was STILL an obnoxious little turd.

So better to just leave it like it is, as the truth doesn't matter to you people.

My prime counting function can only be forced to look like Legendre's with stupid implementation.

For iterations above x^{1/3} it is equivalent to Meissel, which anyone with a modicum of mathematical knowledge and understanding about prime counting can easily verify.

Even David Ullrich was never stupid enough to say my prime counting function was exactly Legendre's, as he'd always say "essentially" the same.

So the later sci.math'ers coming into the argument are just dumber than earlier ones, and did not read the history of the debates in this area, or didn't read them carefully enough.

In its sieve form—properly implemented—my prime counting function blows Legendre's away.

And I have properly implemented it in my PrimeCountH.java program, where for primes over the transition point (even in the code it talks about the transition point), the program pulls out the count of primes directly from memory.

All of which just prove my point—the math world is about group processes.

You people do not care what is mathematically true, but only about playing follow the leader along paths laid out for you by someone else.

So even stupid math makes great sense to you! And you believe even blatantly wrong things—which other posters got right years ago—when the right person for the job comes along and tells it to you.

And Tim Peters was the right person for the job.