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
-
94896 Solvers
-
Project Euler: Problem 3, Largest prime factor
1348 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
610 Solvers
-
Calculate compression ratio of engine
157 Solvers
-
Pandigital Multiples of 11 (based on Project Euler 491)
47 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!