Given a integer n, our goal is to find the smallest integer k, such that 
divides 
.
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).
, , 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 Solvers5
Suggested Problems
-
2599 Solvers
-
Given a window, how many subsets of a vector sum positive
871 Solvers
-
Factorions: Numbers that equal the sum of the factorials of their digits
83 Solvers
-
Highly divisible triangular number (inspired by Project Euler 12)
164 Solvers
-
Deduce the pattern behind the sequence
26 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!
