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
-
Number of 1s in the Binary Representation of a Number
484 Solvers
-
17451 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
277 Solvers
-
Calculate compression ratio of engine
225 Solvers
-
Find numbers in the Popular Computing Z-sequence
17 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!