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
-
The Goldbach Conjecture, Part 2
2417 Solvers
-
2377 Solvers
-
1477 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2580 Solvers
-
Calculate the area of a triangle between three points
3528 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!