Problem 52978. Easy Sequences 44: Finding the Smallest Number whose Cube is divisible by a Factorial
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 commentsProblem Recent Solvers4
Suggested Problems
-
1880 Solvers
-
Back to basics 9 - Indexed References
438 Solvers
-
Cumulative minimum of an array
34 Solvers
-
Count unique orderings of vertices of a polygon
17 Solvers
-
Determine whether the input is an anagram number
6 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!