Difference between revisions of "2012 UNCO Math Contest II Problems/Problem 5"
(→Solution) |
(→Solution) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
== Solution == | == Solution == | ||
<math>0</math> | <math>0</math> | ||
| + | |||
| + | Use Fermat's little theorem in mod 7 | ||
| + | |||
| + | -EVKV | ||
== See Also == | == See Also == | ||
Latest revision as of 04:33, 2 November 2024
Problem
What is the remainder when 
is divided by seven?
Solution
Use Fermat's little theorem in mod 7
-EVKV
See Also
| 2012 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 4 |
Followed by Problem 6 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
