Skip to content

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™ 🇮🇳 इसी सोच के साथ बनाया गया है

Class 11 Mathematics Permutations and Combinations Fundamental principle of countingHard

0 reads0 ratings0 helpful

A password has the form letter-digit-letter-digit-letter-digit. The first letter is a vowel, all three letters are distinct, all three digits are distinct, and the last digit is even. How many passwords are possible?

Answer and explanation

Correct answer: (1080000)

For letters we get (5\times25\times24), and for digits (9\times8\times5). Treat the condition on the last position as a separate stage.

Related tags

Permutations-And-Combinations Fundamental-Principle Counting Hard Fundamental Principle Of Counting Permutations And Combinations Mathematics Class 11 Mcq

सुधार सुझाएँ / Earn

Student feedback

Was this question useful?

No ratings yetWrite a review / Rate this question

Was this question useful?

👍 0 Helpful 👎 0 Not helpful

Difficulty

Easy0%

Medium0%

Hard0%

Was the explanation clear?

Yes 0% No 0%

0 responses

Student Reviews

No published reviews yet.

Found an issue? Help improve this question My reports and replies