On the sum of digits of the factorial

DOI10.1016/J.JNT.2014.09.003MaRDI QIDQ472880zbMATH OpenOpenAlexFDO

Authors Carlo Sanna

Publication date 20 November 2014

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.4912

zbMATH Keywords

factorialsum of digitsbase \(b\) representation

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Arithmetic functions; related numbers; inversion formulas (11A25) Radix representation; digital problems (11A63) Asymptotic results on arithmetic functions (11N37)

Abstract: Let b > 1 be an integer and denote by s_b(m) the sum of the digits of the positive integer m when is written in base b. We prove that s_b(n!) > C_b log n log log log n for each integer n > e, where C_b is a positive constant depending only on b. This improves of a factor log log log n a previous lower bound for s_b(n!) given by Luca. We prove also the same inequality but with n! replaced by the least common multiple of 1,2,...,n.

Recommendations

• The Number of Non-Zero Digits of n!
• scientific article; zbMATH DE number 624807
• Sums of the Digits in Bases 2 and 3
• scientific article; zbMATH DE number 610999
• On the sum of digits of numerators of Bernoulli numbers

Cites work

• scientific article; zbMATH DE number 989379 (Why is no real title available?)
• scientific article; zbMATH DE number 1121202 (Why is no real title available?)
• scientific article; zbMATH DE number 4187928 (Why is no real title available?)
• Digit sums of binomial sums
• Distinct digits in basebexpansions of linear recurrence sequences
• On Chebyshev-Type Inequalities for Primes
• On the \(g\)-ary expansions of Apéry, Motzkin, Schröder and other combinatorial numbers
• On the \(g\)-ary expansions of middle binomial coefficients and Catalan numbers
• On the number of nonzero digits of the partition function
• On the representation of an integer in two different bases.
• On the sum of the digits of multiples
• The Number of Non-Zero Digits of n!
• The distribution of values of the Euler function

Cited in

(6)

• Notes and Comments
• An asymptotic upper bound for counting Fiven numbers
• The Number of Non-Zero Digits of n!
• A Note on N!
• On the factorial base and related counting function
• Sparse subsets of the natural numbers and Euler's totient function

This page was built for publication: On the sum of digits of the factorial

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