Given a integer n, our goal is to find the smallest integer k, such that
divides
.
For example, for
,
, because
, (since
), and
is the smallest number that has this property. Please present the value of k in modulo
(a prime number).
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
114441 Solvers
-
1375 Solvers
-
12185 Solvers
-
Recurring Cycle Length (Inspired by Project Euler Problem 26)
161 Solvers
-
Large Sum (inspired by Project Euler 13)
114 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!