(n) distinct symbols से length (r) strings बनती हैं जिनमें repetition allowed है लेकिन कम से कम एक symbol repeat हो। Count क्या है?

Length (r) strings are formed from (n) distinct symbols with repetition allowed, but at least one symbol repeats. What is the count?

Explanation opens after your attempt
Correct Answer

A. \(n^r-{}^{n}P_r\)

Step 1

Concept

Subtract all-distinct strings from total repetition-allowed strings. In exams solve at least repeat by the no-repeat complement.

Step 2

Why this answer is correct

The correct answer is A. \(n^r-{}^{n}P_r\). Subtract all-distinct strings from total repetition-allowed strings. In exams solve at least repeat by the no-repeat complement.

Step 3

Exam Tip

Total repeated-allowed strings से all distinct strings घटाएं। परीक्षा में at least repeat को complement no repeat से करें।

Question me issue ya doubt hai?

Answer, explanation, typing mistake ya suggestion directly hamari team ko bhejein. 📱Helpline (Call / WhatsApp): +91 7272824365

Related Mathematics Questions

FAQs

Mathematics Answer, Explanation and Revision Hints

(n) distinct symbols से length (r) strings बनती हैं जिनमें repetition allowed है लेकिन कम से कम एक symbol repeat हो। Count क्या है? / Length (r) strings are formed from (n) distinct symbols with repetition allowed, but at least one symbol repeats. What is the count?

Correct Answer: A. \(n^r-{}^{n}P_r\). Explanation: Total repeated-allowed strings से all distinct strings घटाएं। परीक्षा में at least repeat को complement no repeat से करें। / Subtract all-distinct strings from total repetition-allowed strings. In exams solve at least repeat by the no-repeat complement.

Which concept should I revise for this Mathematics MCQ?

Subtract all-distinct strings from total repetition-allowed strings. In exams solve at least repeat by the no-repeat complement.

What exam hint can help solve this Mathematics question?

Total repeated-allowed strings से all distinct strings घटाएं। परीक्षा में at least repeat को complement no repeat से करें।