Let $V\_n$ be the least real number such that for every convex subset of $\mathbb{R}^n$ with hypervolume $1$ there is a containing simplex with hypervolume $V\_n$.
What is known about $V\_n$? Is there a known general formula? If not, then what are the known best bounds for $V\_n$?



Smallest containing simplex
The problem seems to be still open even for $n=3$:  

*Weisstein, Eric W. ["Tetrahedron Circumscribing."](http://mathworld.wolfram.com/TetrahedronCircumscribing.html)*


