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
-
Calculate the Levenshtein distance between two strings
1490 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1253 Solvers
-
Number of Even Elements in Fibonacci Sequence
1555 Solvers
-
Characterize the final state of another digit inventory sequence
14 Solvers
-
17 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!