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 Solvers6
Suggested Problems
-
Renaming a field in a structure array
1579 Solvers
-
504 Solvers
-
Numbers spiral diagonals (Part 1)
296 Solvers
-
Pseudo Square Root (Inspired by Project Euler 266)
60 Solvers
-
Easy Sequences 6: Coefficient sums of derivatives
16 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!