Posts

Showing posts with the label prime-counting

A one-line lower bound for prime counts

 (Zhao Yu here). Today someone spoke about this short proof of a lower bound of the number of primes, which I found it too nice to not share.

Computing $\pi(n)$

Image
Wee Kean here. Happy New Years Eve! Lately, my only interaction with math has been through doing Project Euler. So... here's some cool things I've learnt! Unfortunately, there is hardly any structure to this blogpost so I apologize if this comes off as verbal diarrhea.