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
-
Maintain shape of logical-index mask
69 Solvers
-
Back to basics 11 - Max Integer
772 Solvers
-
Split a string into chunks of specified length
1533 Solvers
-
72 Solvers
-
Compute the largest number possible with the Brussels choice
12 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!