Problem 51950. Find the smallest integer m such that n divides m!
Solution Stats
Problem Comments
-
5 Comments
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?
Solution Comments
Show commentsProblem Recent Solvers13
Suggested Problems
-
1228 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1080 Solvers
-
Factorions: Numbers that equal the sum of the factorials of their digits
67 Solvers
-
55 Solvers
-
547 Solvers
More from this Author249
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!