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.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have