Write a function that takes an integer n and finds the smallest integer m whose factorial is divisible by n. For example, if 
, then the smallest factorial that is a multiple of n is 5! = 120; therefore, 
.
, then the smallest factorial that is a multiple of n is 5! = 120; therefore, . Solution Stats
Problem Comments
5 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers18
Suggested Problems
-
Return the largest number that is adjacent to a zero
5538 Solvers
-
Find the sum of the elements in the "second" diagonal
1206 Solvers
-
Convert a vector into a number
619 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2218 Solvers
-
Large Sum (inspired by Project Euler 13)
119 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Chris, please check test 21. The factors of 1535238 include two 67's, therefore it seems to me the solution should be 134.
David: Take another look. ChrisR's anti-lookup trick lets correct solutions pass the test!
David, you are correct for Kempner(1535238), but that test asks for Kempner(Kempner(Kempner(1535238))).
Unfortunately, it does not stop lookup tables since 134 factors to 2 and 67, which means it obtains the same result as a lookup table. Kempner(Kempner(Kempner(1535238))) will do 134 -> 67 -> 67 and a lookup table 67->67->67.
May I suggest using Kempner(Kempner(Kempner(123456787654321))+10) as a test against lookup tables?