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
-
Calculate the Levenshtein distance between two strings
1506 Solvers
-
2552 Solvers
-
Sum of first n terms of a harmonic progression
497 Solvers
-
Sort numbers by outside digits
159 Solvers
-
Determine whether the input is an anagram number
8 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!