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
-
Find relatively common elements in matrix rows
2159 Solvers
-
1348 Solvers
-
Find a subset that divides the vector into equal halves
402 Solvers
-
Circular Primes (based on Project Euler, problem 35)
658 Solvers
-
Find my daddy long leg (No 's')
2852 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!