2015/03/05 by Shalosh B. Ekhad, N. J. A. Sloane, Ekhad, Shalosh B. +3 · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Cellular Automata and Applications #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1503.01796
openalex publication_date 2015/03/05 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears as a coefficient when the polynomial is raised to the power n and the coefficients are read modulo p.