2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/79545We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with interesting patterns arise in the analysis, owing to the number theoretic origin of the problem.8 pagesOptimization and Control90C05; 90C25; 90C30; 90C90; 11A99; 11B37; 11B99; 11P99text