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
-
22517 Solvers
-
2009 Solvers
-
Fix the last element of a cell array
1751 Solvers
-
Decrypt the cypher using XOR encryption (for beginners)
62 Solvers
-
Compute the Sequence of the Day
23 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!