Events & Promotions
|
|
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
25 Dec 2011, 15:24
Kudos
Bookmarks
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
(N/A)
Question Stats:
0% (00:00) correct
0%
(00:00)
wrong
based on 1
sessions
History
Date
Time
Result
Not Attempted Yet
Hi everyone,
I am trying to solve a hard question and i will be happy if I can use your help.
The question:
When creating a number from K digits with N cells.
What is the probability to that each of the digits will appear at least once?
for example, when k=3 (1, 2 and 3) and N cells the answer is:
[3^n-3-3(2^n-2)]/3^n
Thanks a lot! :-D
I am trying to solve a hard question and i will be happy if I can use your help.
The question:
When creating a number from K digits with N cells.
What is the probability to that each of the digits will appear at least once?
for example, when k=3 (1, 2 and 3) and N cells the answer is:
[3^n-3-3(2^n-2)]/3^n
Thanks a lot! :-D
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Problem Solving (PS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
P(each of the digits will appear at least once) + P(one digit will not appear at all) + P(two digits will not appear at all) + P(three digits will not appear at all) +.......+P(k-1 digits will not appear at all) = 1
=> P (each of the digits will appear at least once) = 1 - [P(one digit will not appear at all) + P(two digits will not appear at all) + P(three digits will not appear at all) +.......+P(k-1 digits will not appear at all)]
Let us refer to this relationship just derived as Rel 1.
Now, P(one digit will not appear at all) = (number of ways to choose one digit from k digits)*(number of ways to fill n cells using the remaining k-1 digits)/(number of ways to fill n cells using n digits)
=> P(one digit will not appear at all) = k*(k-1)^n/k^n
Similarly, P(two digits will not appear at all) = kC2 * (k-2)^n/k^n = [k(k-1)/2]*(k-2)^n/k^n
Therefore Rel 1 becomes
P(each of the digits will appear at least once) = 1 - [k*(k-1)^n/k^n + k(k-1)*(k-2)^n/2k^n +.....
Putting in k = 3 we get
P(each of the digits will appear at least once) = 1 -[(3*2^n)/3^n + 3/3^n] = (3^n -3*2^n - 3)/3^n
=[3^n + 3 -3(2^n + 2)]/3^n
Hope this helps.
=> P (each of the digits will appear at least once) = 1 - [P(one digit will not appear at all) + P(two digits will not appear at all) + P(three digits will not appear at all) +.......+P(k-1 digits will not appear at all)]
Let us refer to this relationship just derived as Rel 1.
Now, P(one digit will not appear at all) = (number of ways to choose one digit from k digits)*(number of ways to fill n cells using the remaining k-1 digits)/(number of ways to fill n cells using n digits)
=> P(one digit will not appear at all) = k*(k-1)^n/k^n
Similarly, P(two digits will not appear at all) = kC2 * (k-2)^n/k^n = [k(k-1)/2]*(k-2)^n/k^n
Therefore Rel 1 becomes
P(each of the digits will appear at least once) = 1 - [k*(k-1)^n/k^n + k(k-1)*(k-2)^n/2k^n +.....
Putting in k = 3 we get
P(each of the digits will appear at least once) = 1 -[(3*2^n)/3^n + 3/3^n] = (3^n -3*2^n - 3)/3^n
=[3^n + 3 -3(2^n + 2)]/3^n
Hope this helps.
26 Dec 2011, 14:31
Kudos
Bookmarks
GyanOne
yes, it's helps a lot, thank you!
but because i need to create a general soulotion for any K that i want i need to transform it to a Series, But i don't know what the bolded C2 means, i understand that C2 = (k-1)/2 but what is the general formula for the C?
