2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/157068Let f(n) denote the number of odd entries in the nth row of Pascal's binomial triangle. We study "average dispersion" and "typical dispersion" of f(n) -- the latter involves computing a generalized Lyapunov exponent -- and then turn to numerical analysis of higher dimensional examples.16 pagesNumber TheoryCombinatoricsProbability05A16 (Primary) 11B37, 11N56, 11Y60, 15A52, 37H15, 40A25, 65B10, 65C50 (Secondary)text