On the first digits of the Fibonacci numbers and their Euler function
MetadataShow full item record
Here, we show that given any two finite strings of base b digits, say s1 and s2, therre are infinitely many Fibonacci numbers Fn such that the base b representation of Fn starts with s1 and the basae b representation of0(Fn) starts with sg.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.