Since we need to find the number of ways they could enter first, second and third place, (I can't demonstrate, but you should get the idea) take 8, 7 and 6 and multiply them, 5-1 we don't need, we just need 8, 7, and 6, multiply those three numbers and you get 336, there you go, 336 ways to organize all 8 girls in first, second and third place, hope this helps
Answer:
P(N = n) =
Step-by-step explanation:
to find out
Find the PMF PN (n)
solution
PN (n)
here N is random variable
and n is the number of times
so here N random variable is denote by the same package that is N (P)
so here
probability of N is
P(N ) = Ф ( N = n) .................. 1
here n is = 1, 2,3, 4,...................... and so on
so that here P(N = n) will be
P(N = n) =
It depends on what did you mean by saying perfect square. If I've understood it correctly, I can help you with a part of your problem. The squares of mod <span>9</span><span> are </span><span><span>1</span><span>,4,7</span></span><span> which are came from </span><span><span>1,2,</span><span>4.</span></span><span> </span>Addition of the given numbers are 2,3,5,6, 8, which are exactly the part of your problem. This number, which is not shown as squares Mod 9, and thus doesn't appear as a sum of digits of a perfect square. I hope you will find it helpful.
Answer:
7
Step-by-step explanation:
10-3
=7