Upper Bounds for Digitwise Generating Functions of Powers of Two: A Problem and a Matrix Representation
Abstract
This short note studies the asymptotic behavior of a generating function associated with the decimal expansion of \(2n\). Our aims are twofold: (i) to present a problem on the best possible upper bound for this behavior, and (ii) to introduce a matrix representation that is useful for its analysis. The representation corresponds to a finite-state transfer operator; analytic and dynamical aspects are not pursued here.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.