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
-
Calculate the Levenshtein distance between two strings
1507 Solvers
-
64 Solvers
-
Circular Primes (based on Project Euler, problem 35)
652 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
143 Solvers
-
Pandigital Factors (Based on Euler 491)
42 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!