Timeline for Examples of theorems where numerical bounds on $\pi$ played a role

4 events

when toggle format	what		by	license	comment
May 13 at 15:56	comment	added	Thomas Bloom		One could argue this falls under exception 5, since just the trivial estimate $\sum \frac{1}{n^2} < 2 \sum \frac{1}{n(n+1)}=2$ suffices, with no need to mention $\pi$. I suppose it's a matter of taste though, since 'numerical bounds for $\pi$' is equivalent to 'numerical bounds for $\sum \frac{1}{n^2}$', but at least this way one never needs to actually calculate $\pi$ or invoke the Basel problem.
May 13 at 12:39	history	edited	Joe Silverman	CC BY-SA 4.0	expanded on the explanation
May 12 at 18:48	comment	added	Terry Tao		Yes, this qualifies! I had thought to add a calculation in one of my own recent papers (page 21 of arxiv.org/pdf/2309.02325) where I needed the fact that $\zeta(2) \zeta(3)/\zeta(6) = 1.94359\dots$ was less than $2$, though this expression is not purely expressible in terms of $\pi$ so this is less compelling of an example.
May 12 at 18:29	history	answered	Joe Silverman	CC BY-SA 4.0