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
-
2253 Solvers
-
The Goldbach Conjecture, Part 2
2322 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1134 Solvers
-
170 Solvers
-
Easy Sequences 2: Trigonometric function with integral input and output
33 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!