Abstract
We show that interesting dividing formulas such as, Chinese theorem, Fermat's little theorem, and Euler's theorem can easily be derived from some well-known iterated maps. Other dividing formulas concerning Fibonacci numbers, generalized Fibonacci numbers of degree m, and numbers of other types can also be derived. The results show that iterated maps offer a systematic and unified way for obtaining nontrivial dividing formulas $n|Q(n)$, and we can thus understand the dividing formulas from the point of view of iterated maps.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.