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
-
1646 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2763 Solvers
-
Count letters occurence in text, specific to words with a given length.
183 Solvers
-
57 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2075 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!