Combinatorial proof other than strong induction

mahjk17

New member
Joined
May 29, 2012
Messages
45
Hi guys, I am wondering if there is a way other than strong induction (I already know how to prove it that way for this problem) for this question, " Show that, for any integer n>=4, there exist non-negative integers a,b such that 5n = 10a + 25b" ??? Is there any other way to prove this other than strong induction? Can I prove this maybe by the binomial theorem ?? Thank you !!!
 
Top