Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity

DOI10.1137/0132060MaRDI QIDQ4126400zbMATH OpenOpenAlexFDO

Authors Kenneth B. Stolarsky

Publication date 1977

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0132060

zbMATH Keywords

Bibliography

Mathematics Subject Classification ID

Radix representation; digital problems (11A63)

Cited in

(33)

• A probability measure which has Markov property
• Power sums of digital sums
• Binary trees and uniform distribution of traffic cutback
• Difference of the digital sums of an integer base b and its prime factors
• On the sums of digits in integers
• Mellin transforms and asymptotics: Digital sums
• Mellin transforms and asymptotics. The mergesort recurrence
• On a function related of multinomial coefficients. I.
• An explicit formula of the exponential sums of digital sums
• On the number of odd binomial coefficients
• Asymptotics of Mahler recurrences: The cyclotomic case
• Dynamical directions in numeration
• A probabilistic approach to generalized Zeckendorf decompositions
• A lower bound for a remainder term associated with the sum of digits function
• Primes with an average sum of digits
• Statistical mechanics of cellular automata
• Exponential Sums Related to Binomial Coefficient Parity
• Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated
• Averaging the sum of digits function to an even base
• Number of Odd Binomial Coefficients
• The Binary Digits of a Power
• The Takagi function: a survey
• Distribution of the sum-of-digits function of random integers: a survey
• Exact asymptotics of divide-and-conquer recurrences
• Algebraic aspects of B-regular series
• Estimates for a remainder term associated with the sum of digits function
• A Class of 1-Additive Sequences and Quadratic Recurrences
• Power and exponential sums for generalized coding systems by a measure theoretic approach
• Identities and periodic oscillations of divide-and-conquer recurrences splitting at half
• Summing the sum of digits
• Periodic minimum in the count of binomial coefficients not divisible by a prime
• A summation formula related to the binary digits
• Average growth-behavior and distribution properties of generalized weighted digit-block-\-counting functions

This page was built for publication: Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4126400)