I am trying to prove that there are a maximum of 9 trailing $0$'s at the end of this summation: $$\sum_{k=1}^{k=m} k^n$$ for $1\le n\le 1000000$ and $m\le 100$.
Any help on how to approach?
I am trying to prove that there are a maximum of 9 trailing $0$'s at the end of this summation: $$\sum_{k=1}^{k=m} k^n$$ for $1\le n\le 1000000$ and $m\le 100$.
Any help on how to approach?
Copyright © 2021 JogjaFile Inc.