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
-
1200 Solvers
-
Program an exclusive OR operation with logical operators
705 Solvers
-
Project Euler: Problem 5, Smallest multiple
1265 Solvers
-
252 Solvers
-
Find perfect placement of non-rotating dominoes (easier)
350 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!