Letting f(n) and (n) be the first and last maxim of the graph S(n,k); k = 1, 2, ... , n, Kanold [J. Reine Angew. Math 230 (1968), 211-212] shows that, for sufficiently large n, n/log n /= 3 remains unsolved. It is the purpose of this paper to provide the complete solution of this classical problemOffice of Naval Research
Contract No. NR-042-286http://archive.org/details/uniquemaximumprope00ble