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
-
2252 Solvers
-
2280 Solvers
-
Digit concentration in Champernowne's constant
145 Solvers
-
Determine whether a number is a fibodiv number
20 Solvers
-
Determine if Input is Oddish or Evenish (Odd/Even Sum of Digits)
331 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!