For $0 \leq d \leq 9$, we define the numbers \[S_{d}=1+d+d^{2}+\cdots+d^{2006}\]Find the last digit of the number \[S_{0}+S_{1}+\cdots+S_{9}.\]
Problem
Source: Central American Olympiad 2006, Problem 1
Tags: modular arithmetic, geometry, 3D geometry
30.04.2007 09:20
There is probably a way better way to do this but I felt like trying it.
30.04.2007 14:13
skimnc wrote: There is probably a way better way to do this but I felt like trying it.
my solution is the same as you but i dont think it's the best way could anybody have another idea ?
30.04.2007 14:41
I see why $1$ doesn't work out to be $d+1$ but why doesn't $6$? I noticed the pattern was it repeated every $5$ numbers but I have no clue as to why $6$ randomly decides to not work.
30.04.2007 17:23
30.04.2007 21:32
Or we can sum the thing by the columns instead of rows: Ten ones give $10$, ten first powers give $45$, ten squares give $0+1+4+9+6+5+6+9+4+1=45$, ten cubes give $45$, ten fourth powers give $0+1+6+1+6+5+6+1+6+1=33$. From fifth power on, the cycle repeats. Hence we have $10+501\cdot(45+45+45+33)+45+45\equiv 8\pmod{10}$
30.04.2007 23:00
I originally only carried the sum formula out to $r^{n}$ when it should of been $r^{n+1}$.. I edited it.
19.01.2011 08:49
Farenhajt wrote: Or we can sum the thing by the columns instead of rows: Ten ones give $10$, ten first powers give $45$, ten squares give $0+1+4+9+6+5+6+9+4+1=45$, ten cubes give $45$, ten fourth powers give $0+1+6+1+6+5+6+1+6+1=33$. From fifth power on, the cycle repeats. Hence we have $10+501\cdot(45+45+45+33)+45+45\equiv 8\pmod{10}$ I am agree with you. Also doing the same and i think it is the easiest way to calculate. Thanks