2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/123583The Kalmár function K(n) counts the ordered factorizations of n as a product of integers bigger than 1. We precise the maximal order of K(n) and give several properties of the K-champions, where n is a K-champion if K(m) < K(n) for all m < n.40 pagesNumber Theory11A25 ; 11N37 ; 49K10text