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
-
All your base are belong to us
528 Solvers
-
440 Solvers
-
Find the sum of the elements in the "second" diagonal
1133 Solvers
-
Cumulative maximum of an array
34 Solvers
-
Find my daddy long leg (No 's')
2138 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!