Tuesday, 13 October 2015

elementary number theory - Proof by induction that n3n is divisible by 6


Show using induction that n3n is divisible by 6 n1,nN





First off i show that the basis step: 131=0,06=0



Now I factorised it and set it equal to a multiple of 6: n(n+1)(n1)=6A



Assuming the result is true for k terms, and trying for k+1 terms:



k(k+1)(k+2)=6B




I'm stuck here, I realise that the bold terms are the same, but k+2 and n1 are not. Could someone show me what do to next to solve this.



Also is it possible to prove this using modular arithmetic?



Thanks,

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...