Update

Muft Shiksha™ एक 100% Free Education Portal है 🇮🇳, जिसका उद्देश्य Class 9–12 के हर विद्यार्थी तक High-Quality Education को पूरी तरह मुफ्त पहुँचाना है। 🇮🇳 हम मानते हैं कि अच्छी शिक्षा किसी student की आर्थिक स्थिति पर निर्भर नहीं होनी चाहिए। 🇮🇳 हर विद्यार्थी को वही Quality Study Material, MCQs, Quizzes, Exam Preparation, Concept-Based Learning और Bilingual Support मिलना चाहिए, जो आमतौर पर महंगी Coaching या Premium Platforms में मिलता है। Muft Shiksha™ 🇮🇳 इसी सोच के साथ बनाया गया है

Subjects
0 reads0 ratings0 helpful

For a positive integer \(n\), which of the following relations correctly represents the recursive definition of factorial?

Answer and explanation

Correct answer: \(n!=n(n-1)!\)

Since \(n!\) means \(n\times(n-1)\times\cdots\times1\), it follows that \(n!=n(n-1)!\). Option B incorrectly divides by \(n\), reversing the relation. Exam tip: when reducing a factorial by one, check that the factor \(n\) is multiplied.

Related tags

Factorial NotationRecursive DefinitionPermutations And CombinationsClass 11 MathematicsAlgebraic IdentitiesMathematicsClass 11 Mcq

Was this question useful?

No ratings yetWrite a review / Rate this question

Student Reviews

No published reviews yet.

Add Muft Shiksha to your Home Screen

In Safari, tap Share, then Add to Home Screen.