MHB Find the last digit of a series

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Series
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:
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
4
Views
986
Replies
3
Views
1K
Replies
11
Views
2K
Replies
3
Views
2K
Replies
1
Views
1K
Replies
0
Views
844
Back
Top