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
-
2547 Solvers
-
Wind outward from the center ...
86 Solvers
-
Sum of first n terms of a harmonic progression
521 Solvers
-
Diophantine Equations (Inspired by Project Euler, problem 66)
73 Solvers
-
1745 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!