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
-
Calculate the Levenshtein distance between two strings
1512 Solvers
-
248 Solvers
-
1499 Solvers
-
Pandigital Multiples of 11 (based on Project Euler 491)
55 Solvers
-
Easy Sequences 56: Counting "Ugly" Numbers
8 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!