2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/155127The nth row of Pascal's trinomial triangle gives coefficients of (1+x+x^2)^n. Let g(n) denote the number of such coefficients that are odd. We review Moshe's algorithm for evaluating asymptotics of g(n) -- this involves computing the Lyapunov exponent for certain 2x2 random matrix products -- and then analyze further examples with more terms and higher powers of x.25 pagesNumber TheoryCombinatoricsDynamical Systems05A16 (Primary); 11B37, 11N56, 11Y60, 15A52, 37H15, 40A25, 65B10, 65C50 (Secondary)text