Abstract

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

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.