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 Solvers7
Suggested Problems
-
451 Solvers
-
Matrix with different incremental runs
131 Solvers
-
Find the stride of the longest skip sequence
192 Solvers
-
Wind outward from the center ...
86 Solvers
-
Longest run of consecutive numbers
6633 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!