Find the last digit of a series

  • Context: MHB 
  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Series
Click For Summary
SUMMARY

The last digit of the series $1 + 2 + \cdots + n$ can be determined based on the last digit of the series $1^3 + 2^3 + \cdots + n^3$. Given that $S_3 \equiv 1 \pmod{10}$, it follows that $S_1 \equiv \pm 1 \pmod{10}$. The relationship $S_3 = S_1^2$ confirms this. Additionally, the analysis shows that $S_1 \equiv 1 \pmod{5}$, leading to the conclusion that $S_1 \equiv 1 \pmod{10}$.

PREREQUISITES
  • Understanding of modular arithmetic
  • Familiarity with summation formulas
  • Knowledge of polynomial identities
  • Basic number theory concepts
NEXT STEPS
  • Study modular arithmetic properties in depth
  • Explore the derivation of summation formulas for cubes
  • Investigate polynomial identities and their applications
  • Learn about congruences and their implications in number theory
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in modular arithmetic and summation techniques.

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
What is the last digit of $1+2+\cdots+n$ if the last digit of $1^3+2^3+\cdots+n^3$ is 1?
 
Mathematics news on Phys.org
[sp]
We have:
\begin{align*}
S_1 &= 1 + \cdots + n = \dfrac{n(n+1)}{2}\\
S_3 &= 1^3 + \cdots + n^3 = \dfrac{n^2(n+1)^2}{4}
\end{align*}
This shows that $S_3 = S_1^2$. Therefore, if $S_3\equiv1\pmod{10}$, then $S_1\equiv\pm1\pmod{10}$.
It is rather obvious that $S_1\equiv S_3\pmod2$.
We may write $S_1\equiv3n(n+1)\pmod5$, since the multiplicative inverse of $2$ is $3$.
We list the value of $S_1$ for $n\equiv0\dots4\pmod5$:
$$
\begin{array}{c|c|c|c|c|c}
n&0&1&2&3&4\\
\hline
S_1\pmod5&0&1&3&1&0
\end{array}
$$
and we see that we cannot have $S_1\equiv-1\pmod5$; therefore, $S_1\equiv1\pmod{10}$
[/sp]
 
We see that the $1^3+2^3+\cdots+n^3 = (1+2+\cdots+n)^2$

we know that the LHS has last digit 1(given) so $(1+2+\cdots+n)$ has last digit 1 or 9.

$(1+2+\cdots+n) = \frac{n(n+1)}{2} = 10k + m $ say for some k and m

so $n(n+1) = 20 k + 2m$

or $4n(n+1) + 1 = 80k + 8m + 1$
or $(2n+1)^2 = 80k + 8m + 1$

if m =9 then 8m + 1 ends with 3. so the square ends with 3. As no square ends with 3 so m cannot be 9. but 1 is possible

So last digit is 1 that is for n of the form 5k +1
 
Last edited:

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 17 ·
Replies
17
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 0 ·
Replies
0
Views
1K