Covering the 5-dimensional unit cube by eight congruent balls (Q1669685)

\textit{P. Brass} et al. [Research problems in discrete geometry. New York, NY: Springer (2005; Zbl 1086.52001)] listed the problem of covering the \(d\)-dimensional unit cube with \(n\) congruent balls of the smallest possible radius. The paper under review answers the \(d=5\), \(n=8\) instance of the problem, showing that the smallest possible radius is \(\sqrt{2/3}\).