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
-
Find the longest sequence of 1's in a binary sequence.
6688 Solvers
-
1713 Solvers
-
32 Solvers
-
Find my daddy long leg (No 's')
2726 Solvers
-
Easy Sequences 21: Combinatorial Summations
9 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!