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

  • Context: MHB 
  • Thread starter Thread starter ketanco
  • Start date Start date
  • Tags Tags
    Mode
Click For Summary
SUMMARY

The sum of the series 1^21 + 2^21 + ... + 18^21 modulo 19 can be efficiently calculated using Fermat’s Little Theorem. According to the theorem, since 19 is prime, 1^18, 2^18, ..., 18^18 are all congruent to 1 modulo 19. This leads to the conclusion that 1^21 + 2^21 + ... + 18^21 is equivalent to 1^3 + 2^3 + ... + 18^3 modulo 19, which simplifies to (1 + 2 + ... + 18)^2 modulo 19. The final result is 0 modulo 19.

PREREQUISITES
  • Understanding of Fermat’s Little Theorem
  • Knowledge of modular arithmetic
  • Familiarity with polynomial identities
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study Fermat’s Little Theorem in detail
  • Learn about polynomial identities and their applications in modular arithmetic
  • Explore advanced techniques in number theory
  • Practice solving modular equations and congruences
USEFUL FOR

Mathematicians, students studying number theory, educators teaching modular arithmetic, and anyone interested in efficient computation of modular sums.

ketanco
Messages
15
Reaction score
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
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}$$
 
Hey Olinguito, how does it follow that:
Olinguito said:
$$1^3+\cdots+18^3\pmod{19} = (1+\cdots+18)^2\pmod{19}$$

(Wondering)
 
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:
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)
 
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
 
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
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 68 ·
3
Replies
68
Views
12K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 11 ·
Replies
11
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K