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
-
Remove any row in which a NaN appears
8791 Solvers
-
Renaming a field in a structure array
1581 Solvers
-
18811 Solvers
-
compress sequence into intervals
99 Solvers
-
Highly divisible triangular number (inspired by Project Euler 12)
170 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!