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
-
3949 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
426 Solvers
-
Find numbers in the Popular Computing Z-sequence
17 Solvers
-
Easy Sequences 64: Base-14 Arithmetic Function
6 Solvers
-
List numbers that are not squares
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!