Odd Entries in Pascal's Trinomial Triangle
From MaRDI portal
Publication:6208465
arXiv0802.2654MaRDI QIDQ6208465FDOQ6208465
Authors: Steven R. Finch, Pascal Sebah, Zai-Qiao Bai 
Publication date: 19 February 2008
Abstract: The 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.
Numerical summation of series (65B10) Asymptotic enumeration (05A16) Random dynamical systems aspects of multiplicative ergodic theory, Lyapunov exponents (37H15) Recurrences (11B37) Rate of growth of arithmetic functions (11N56) Evaluation of number-theoretic constants (11Y60) Approximation to limiting values (summation of series, etc.) (40A25)
This page was built for publication: Odd Entries in Pascal's Trinomial Triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6208465)
