examples, and problems from the community.

including olympiad champions, researchers, and professionals.

Back to all chapters
# Basic Applications of Modular Arithmetic

Solve integer equations, determine remainders of powers, and much more with the power of Modular Arithmetic.

examples, and problems from the community.

including olympiad champions, researchers, and professionals.

Sign up to access problem solutions.

Find the remainder when \(70!\) is divided by \(5183\).

Note: Don't use a computational device!

examples, and problems from the community.

including olympiad champions, researchers, and professionals.

Sign up to access problem solutions.

by
**
Krishna Ar**

Are you sure you want to view the solution?

Cancel
Yes I'm sure

examples, and problems from the community.

including olympiad champions, researchers, and professionals.

Sign up to access problem solutions.

by
**
Pi Han Goh**

Are you sure you want to view the solution?

Cancel
Yes I'm sure

\[ \large \displaystyle\sum_{k=0}^{1007!+1}{10^k}\]

Find the remainder when the summation above is divided by the summation below.

\[ \large \displaystyle\sum_{k=0}^{1008}{10^k} \]

examples, and problems from the community.

including olympiad champions, researchers, and professionals.

Sign up to access problem solutions.

by
**
Ivan Molina N**

Are you sure you want to view the solution?

Cancel
Yes I'm sure

examples, and problems from the community.

including olympiad champions, researchers, and professionals.

Sign up to access problem solutions.

by
**
Trevor Arashiro**

Are you sure you want to view the solution?

Cancel
Yes I'm sure

\[\Huge 6^{6^{6^{6^{6^6}}}}\]

Find the \(6\)th last digit from the right of the decimal representation of the above number.

examples, and problems from the community.

including olympiad champions, researchers, and professionals.

Sign up to access problem solutions.

by
**
Cody Johnson**

Are you sure you want to view the solution?

Cancel
Yes I'm sure

×

Problem Loading...

Note Loading...

Set Loading...