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
-
Return the largest number that is adjacent to a zero
5546 Solvers
-
1377 Solvers
-
compress sequence into intervals
99 Solvers
-
Polar Form Complex Number Entry
58 Solvers
-
Sum the elements in rows of the Levine triangle
16 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!