Problem 2797. modular arithmetic
Given three integers a,b and c, find the remainder when a^b is divided by c. Here, a^b will be well beyond the largest 64 bit integer.
Example:
a = 1000 b = 1000 c = 3
Answer = 1
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers70
Suggested Problems
-
Project Euler: Problem 5, Smallest multiple
1515 Solvers
-
Arrange Vector in descending order
12091 Solvers
-
Convert hex color specification to MATLAB RGB
245 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
234 Solvers
-
Approximation of Pi (vector inputs)
238 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!