Odd Entries in Pascal's Trinomial Triangle

Simple item page
dc.creatorFinch, Steven
dc.creatorSebah, Pascal
dc.creatorBai, Zai-Qiao
dc.date2008-02-19
dc.date.accessioned2026-07-07T09:21:44Z
dc.date.available2026-07-07T09:21:44Z
dc.descriptionThe 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.
dc.description25 pages
dc.identifierhttps://arxiv.org/abs/0802.2654
dc.identifierhttp://arxiv.org/abs/0802.2654
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155127
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subjectDynamical Systems
dc.subject05A16 (Primary); 11B37, 11N56, 11Y60, 15A52, 37H15, 40A25, 65B10, 65C50 (Secondary)
dc.titleOdd Entries in Pascal's Trinomial Triangle
dc.typetext

Files

Collections

arXiv