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 Solvers6
Suggested Problems
-
1247 Solvers
-
Find the sum of the elements in the "second" diagonal
1204 Solvers
-
Two-output anonymous function?
84 Solvers
-
Return fibonacci sequence do not use loop and condition
855 Solvers
-
Easy Sequences 3: Prime 44-number Squares
32 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!