Problem 51950. Find the smallest integer m such that n divides m!

• Created by ChrisR
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Unit Conversion

• 10 Problems
• 617 Finishers

High School Challenge

• 50 Problems
• 98 Finishers

Like (4)

Difficulty:

(37)

Rate

• Solve Later   
• Add To GroupÂ

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, .

Solve

Solution Stats

41.86% Correct | 58.14% Incorrect

• 43 Solutions
• 15 Solvers

Last Solution submitted on Nov 10, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers15

Suggested Problems

• P-smooth numbers

  88 Solvers

• Is it an Armstrong number?

  328 Solvers

• Integer Sequence - II : New Fibonacci

  568 Solvers

• It's going down. We're finding simbers!

  76 Solvers

• Find terms in the Connell sequence

  30 Solvers

More from this Author297

• Determine the e-divisors of an integer

  4 Solvers

• Integrate a product of gamma functions

  5 Solvers

• Count the primes resulting from changing one digit of a number

  4 Solvers

• Sum the reciprocals of polygonal numbers

  4 Solvers

• Route a hydrograph through a river section with the Muskingum method

  2 Solvers