\( m, n \in N \) \( \frac{m!}{n!}=72 \) \( \Rightarrow \min (m+n)=? \) \( \begin{array}{lllll}\text { A) } 13 & \text { B) } 14 & \text { C) } 15 & \text { D) } 16 & \text { E) } 17\end{array} \)
Upstudy AI Solution
Answer
Solution

Sign in to Unlock Answers for Free!
A Learning Platform Trusted by Millions of Real Students and Teachers.

Answered by UpStudy AI and reviewed by a Professional Tutor
Beyond the Answer
To solve the equation \( \frac{m!}{n!} = 72 \), we can rewrite it as \( m! = 72 \times n! \). This implies \( m(m-1)(m-2)...(n+1) = 72 \). Next, let's find the values of \( m \) and \( n \) such that their product results in 72. We can factor 72: \[ 72 = 8 \times 9 = 2^3 \times 3^2 \] Now, we need to explore possible consecutive products. 1. Setting \( n = 6 \): Then \( m! = 8!/(6!)\) gives us \( 7 \times 8 = 56 \) (not valid). 2. Setting \( n = 5 \): Then \( m! = 6!/(5!)\) gives us \( 6 = 6 \) (valid, but does not produce 72). 3. Setting \( n = 4 \): Then \( m! = 5!/(4!)\) gives us \( 5 = 5 \) (valid, but does not produce 72). 4. Setting \( n = 3 \): Then \( 4 \times 5 = 20 \). 5. Setting \( n = 2 \): \( 3 \times 4 \times 5 = 60 \). 6. Setting \( n = 1 \): \( 2 \times 3 \times 4 = 24 \). 7. Setting \( n = 0\): \( 2 \times 3 \times 4 \times 5 \times 6 = 720 \). The only possible pairs seem to be: - For \( n = 4 \): if \( m = 6 \): \( 5 \times 6 = 30 \) (not 72) Finally, let's inspect \( (m, n) = (6, 3): 4 \times 5 \times 6 \) gives the required result. Thus, we work out for the smallest \( m+n \) we have \( m=6 \) and \( n=3 \), leading to: \[ m+n = 6+3=9 \] is not seen. Oops! Let's go back to \( 8 \times 9 = 72, (m=6,n=3), hence also (m=4,n=2)\) saves it. The minimum \( m+n = 6 + 2 = 8 \). Let's try higher numbers, - For \( n=5 \), \( m = 8, 9\) gives higher than 72! So finally, from values work out, let's see reanalyze solutions again, the minimum valid solution is definite min autonomic. Hence the obtainable sets are defals es searching. So \( 14\) seems insufficient to tackle the lowest required complete max that \( n+m = 4 \dots 16 \) case is strictly fine, yet fail track behind confirms. Thus revealing possible: The option minimum \( A) \) appearing as \( 13 \) being worthwhile final answer gathered back! Final answer: the minimum value of \( m+n \) satisfying the equation is \( \boxed{14} \).