What is 1^21 + 2^21 + 3^21 + ......... + 18^21 in mode 19?

  • MHB
  • Thread starter ketanco
  • Start date
  • Tags
    Mode
In summary, the sum of 1^21 + 2^21 + 3^21 + ... + 18^21 in mode 19 is equivalent to 0. This can be proven using Fermat's little theorem and the observation that the sum of cubes of 1 to 18 is congruent to 0 in mode 19. This is a faster method than individually calculating the equivalents and adding them up.
  • #1
ketanco
15
0
what is 1^21 + 2^21 + 3^21 + ... + 18^21 in mode 19?

i can only think about individually calculating equivalents in mode 19 and then adding them up but there must be a better way then finding equivalents of exponentials of numbers from to 1 to 18, as this question is expected to be solved in around 2 minutes or less...
 
Mathematics news on Phys.org
  • #2
By Fermat’s little theorem, $1^{18},2^{18},\ldots,18^{18}\equiv1\pmod{19}$. Hence
$$\begin{array}{rcl}1^{21}+\cdots+18^{21} &\equiv& 1^3+\cdots+18^3\pmod{19} \\\\ {} &=& (1+\cdots+18)^2\pmod{19} \\\\ {} &=& \left(\dfrac{18}2\cdot19\right)^2\pmod{19} \\\\ {} &\equiv& 0\pmod{19}.\end{array}$$
 
  • #3
Hey Olinguito, how does it follow that:
Olinguito said:
$$1^3+\cdots+18^3\pmod{19} = (1+\cdots+18)^2\pmod{19}$$
(Wondering)
 
  • #4
Klaas van Aarsen said:
Hey Olinguito, how does it follow that:

$1^3+\cdots+18^3\pmod{19} = (1+\cdots+18)^2\pmod{19}$

(Wondering)

Doesn’t $a=b$ imply $a\pmod n=b\pmod n$ (taking the modulus to be between $0$ and $n-1$)? (Wink)
 
Last edited:
  • #5
Olinguito said:
Doesn’t $a=b$ imply $a\pmod n=b\pmod n$ (taking the modulus to be between $0$ and $n-1$)? (Wink)

After staring at the following picture long enough, I finally realized why $a=b$. (Bandit)
480px-Nicomachus_theorem_3D.svg.png

I think it's a different theorem though (Nicomachus's theorem).

Btw, couldn't we instead observe that:
$$1^3+2^3+...+17^3+18^3\equiv 1^3+2^3+...+(-2)^3+(-1)^3 \equiv 0 \pmod{19}$$
(Wondering)
 
  • #6
Klaas van Aarsen said:
Btw, couldn't we instead observe that:
$$1^3+2^3+...+17^3+18^3\equiv 1^3+2^3+...+(-2)^3+(-1)^3 \equiv 0 \pmod{19}$$
(Wondering)

That’s an excellent observation!
love0029.gif
 
  • #7
Klaas van Aarsen said:
After staring at the following picture long enough, I finally realized why $a=b$. (Bandit)

I think it's a different theorem though (Nicomachus's theorem).

Btw, couldn't we instead observe that:
$$1^3+2^3+...+17^3+18^3\equiv 1^3+2^3+...+(-2)^3+(-1)^3 \equiv 0 \pmod{19}$$
(Wondering)

yes this is how they xpected us to solve i think... this must be the answer. thanks
 

FAQ: What is 1^21 + 2^21 + 3^21 + ......... + 18^21 in mode 19?

What is the pattern in this sequence?

The sequence follows the pattern of adding the cubes of consecutive numbers from 1 to 18, and then taking the remainder when divided by 19.

How can we calculate this value?

The most efficient way to calculate this value would be to use a computer or calculator, as it would involve a large amount of computation. Alternatively, one could use a formula for the sum of cubes, but it would still require a significant amount of time and effort.

Why is the value taken in mode 19?

Taking the value in mode 19 allows us to find the remainder when divided by 19, which can be useful in certain mathematical applications. Additionally, it helps reduce the size of the number as the sum of cubes can result in a very large value.

Is there a general formula for finding this value in mode n?

Yes, there is a formula for finding the sum of cubes in mode n, which is n(n+1)/2 * (n(n+1)/2)^2, where n is the number of terms in the sequence. However, it is still a complicated and time-consuming calculation.

What are the potential real-world applications of this calculation?

This type of calculation may be used in cryptography, number theory, or other areas of mathematics and computer science. It could also be used in data encryption or compression algorithms.

Back
Top