Friday, 4 October 2013

Induction: Sum of the squares of 6 consecutive natural numbers

Define for every natural n:




an=5i=0(n+i)2



in other words,  an is the sum of the squares of 6 consecutive natural numbers, the first number is n2 and the last is (n+5)2.



Prove (by induction) that for every natural n that an has remainder 7 mod 12.



What I did so far:



(n^2+(n+1)^2+(n+2)^2+(n+3)^2+(n+4)^2+(n+5)^2)\mod 12=\\((n+1)^2+(n+2)^2+(n+3)^2+(n+4)^2+(n+5)^2+(n+6)^2)\mod 12




I have no idea how to continue, or if it's a good start at all...

No comments:

Post a Comment

real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}

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