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
-
2543 Solvers
-
Determine if input is a Narcissistic number
219 Solvers
-
Is this triangle right-angled?
6719 Solvers
-
Highly divisible triangular number (inspired by Project Euler 12)
168 Solvers
-
Count unique orderings of vertices of a polygon
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!