Banach-Mazur distance between $P_5$ and $P_3$ is $d(P_5,P_3)=1+\frac{\sqrt5}2$ where $P_n$ is regular polygon in $n$ sides https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7968198&tag=1.
Shannon zero error capacity of Pentagon is $\sqrt 5$ http://web.cs.elte.hu/~lovasz/scans/theta.pdf.
Lovasz Theta and regular odd sided polygon agree and are algebraic for Pentagon https://en.wikipedia.org/wiki/Lov%C3%A1sz_number (similar to 2. but this resemblance is on tightness of semi-definite programming and algebraicity).
$5$ is minimum sum of squares of two distinct natural numbers and also appears in Hurwitz theorem https://en.wikipedia.org/wiki/Hurwitz%27s_theorem_(number_theory) and seems related to geometry https://www.jstor.org/stable/pdf/2302799.pdf.
Does the presence of $\sqrt 5$ somehow make certain things easier by inducing spectacular constraints based on symmetries and in particular interest to me why is it difficult to prove 2. and 3. for any odd number above $5$?
Are there other scenarios where $\sqrt 5$ appeared and a seemingly hard general situation becomes tame with situation at hand?
Perhaps this is coincidence however it seemed hidden reason is plausible.
The answer so far does not address the problem.