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

The first (2) places of a string are filled by distinct letters from (5) letters, and the last (2) places by distinct digits from (1,2,3,4). The last two digits must contain at least one even digit. How many strings are possible?

Answer and explanation

Correct answer: (200)

Letters are chosen in (5\times4=20) ways and digits in (4\times3-2=10) ways. For at least one condition, subtracting the complement is often easier.

Related tags

Permutations-And-CombinationsFundamental-PrincipleCountingHardFundamental Principle Of CountingPermutations And CombinationsMathematicsClass 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.