Abstract
In Part I of this article we considered some binomial identities and also some identities involving the Fibonacci numbers, and proved them using methods which we described as ‘largely’ combinatorial. Now we shift our focus to number theory and to prime numbers in particular, and showcase some proofs having a strong combinatorial element. Throughout this article, p denotes an odd prime.
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.
