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
-
6713 Solvers
-
105 Solvers
-
Sums of cubes and squares of sums
370 Solvers
-
Project Euler: Problem 18, Maximum path sum I
144 Solvers
-
List the nth term of Rozhenko’s inventory sequence
11 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!