I was wondering does anybody remember the name of the mathematician who derived the general rule for finding $\sum_{i=1}^{n}i^k$ for any k in \mabb{ N}
Kannnappan: Unit digit, that's easy with modular arithmetic and I can do the whole thing with modular arithmetic in a jiffy but as far I can think there exists a algebraic way of solving this one using some manipulation
While I can understand "Since $3^3=1\pmod{13}$, $9^3=1\pmod{13}$. Since $10=1\pmod{3}$, $N=1\pmod{3}$" I can't understand how $9^N=9\pmod{13}$ is implied from the above two. Any ideas?
I am having a lil bit of trouble in understand this answer, "Since $3^3=1\pmod{13}$, $9^3=1\pmod{13}$. Since $10=1\pmod{3}$, $N=1\pmod{3}$ and $9^N=9\pmod{13}$."
A and B are friends. They decide to meet between 1 PM and 2PM on a given day. There is a condition that whoever arrives first will not wait for the others for more than 15 minutes. Find the probability that they will meet.
I have one problem, "There are an infinite number of polynomials P for which P(x+5) - P(x) = 2 for all x. What is the least possible value of P(4) - P(2)?"