Abstract
A non-ergodic approach is employed to establish Benford's law for the leading digit d = 1 for the sequence of powers of two. For the sequence of powers f ng, 1 < 10=9, this method is extended to obtain a weak rst digit law by establishing Benford like lower and upper bounds to the asymptotic relative frequency of terms with a given leading digit.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
