(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
A. \(n^r-{}^{n}P_r\)
Concept
Subtract all-distinct strings from total repetition-allowed strings. In exams solve at least repeat by the no-repeat complement.
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.
Exam Tip
Total repeated-allowed strings से all distinct strings घटाएं। परीक्षा में at least repeat को complement no repeat से करें।
Login to save your score, XP, coins and progress.
