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
-
2661 Solvers
-
Remove the small words from a list of words.
1546 Solvers
-
Count from 0 to N^M in base N.
237 Solvers
-
Program an exclusive OR operation with logical operators
735 Solvers
-
1318 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!