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 Solvers5
Suggested Problems
-
2177 Solvers
-
1345 Solvers
-
17394 Solvers
-
Project Euler: Problem 5, Smallest multiple
1650 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
182 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!