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
-
2009 Solvers
-
Number of 1s in the Binary Representation of a Number
479 Solvers
-
Return fibonacci sequence do not use loop and condition
851 Solvers
-
105 Solvers
-
Determine if Input is Oddish or Evenish (Odd/Even Sum of Digits)
323 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!