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
-
664 Solvers
-
Rounding off numbers to n decimals
5755 Solvers
-
Construct the Seidel-Entringer-Arnold triangle
26 Solvers
-
32 Solvers
-
Classify product/digit-sum sequences
14 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!