Minimal surface area of an integer box with volume at least $n$ in $O(n^{1/6})$ steps
Let a(n) be the minimum of ab + bc + ca over positive integers a, b, c with abc >= n (half the minimal surface area of an integer box of volume at least n; OEIS A400004). Writing a box with sides a <= b <= c through the sum s = a + b + c and the two gaps y = b - a, w = c - b, the surface becomes ab + bc + ca = (s^2 - N)/3 with N = y^2 + yw + w^2 the Eisenstein norm, and 27*abc a cubic Phi(s,y,w) that is monotone in w. This reduces the search to at most three values of s and, for each, a single scan over y with a closed-form optimal w and an exact stopping rule. The algorithm is exhaustive, uses O(n^(1/6)) steps in the worst case, and needs about n^(1/9) steps on average in measurements up to n = 10^48. It computes a(10^45) in 0.6 s in Python. A second method, a scan over the smallest side with a closed-form inner minimum, is also O(n^(1/6)). The values a(10^k) are listed for k <= 48.
Authors
- Mark Kim (ORCID: https://orcid.org/0000-0001-7601-831X)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-15
- DOI
- https://doi.org/10.5281/zenodo.24242031
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint