Yeetww

If Polya is never to visit the sixth floor after she begins, we know that her first stop is at the seventh floor. Moreover, her second stop must be at the eighth floor. She has three moves left, and the only way she can ever visit the 6th floor from the 8th floor in three remaining moves is to go down in both of the following two steps. The probability of getting to the eighth step in two moves is \(\dfrac{1}{2^2}=\dfrac{1}{4}\). By similar reasoning, Polya has a \(\dfrac{1}{4}\) probability of getting from the eighth floor to the sixth floor in the next two moves, so the probability of not going downward in the next two steps is \(1-\dfrac{1}{4}=\dfrac{3}{4}\). So the overall probability of never hitting the sixth floor after the beginning is \(\dfrac{1}{4}\cdot\dfrac{3}{4}=\boxed{\dfrac{3}{16}}.\)

There are \(10^3=1000\) possible codes without restrictions. There are \(3\cdot9=27\) codes that differ in only one spot from mine (three choices for the differing digit and nine choices for its value), 3 codes that result from transposing two digits (have three choices for the fixed digits), and Reckha also can't use my code itself. Thus Reckha has a total of \(1000-27-3-1=\boxed{969}\) available codes.

Interesting answer, isn't it?

I think you mean that the question is:

In the SuperLottery, three balls are drawn (at random, without replacement) from ten white balls numbered from 1 to 10, and one SuperBall is drawn (at random) from ten red balls numbered from 11 to 20. When you buy a ticket, you choose three numbers from 1 to 10 and one number from 11 to 20.

If the numbers on your ticket match at least two of the white balls or match the red SuperBall, then you win a super prize. What is the probability that you win a super prize?

Answer:

We compute the complement: we'll count the number of losing tickets.

To have a losing ticket, you must have at most one correct white ball, and miss the SuperBall.

You miss all 3 white balls if your ticket contains 3 of the 7 white numbers that were not drawn, so there are \(\dbinom{7}{3}=\dfrac{7\cdot6\cdot5}{6}=35\) possibilities.

You hit 1 white ball and miss the others if your ticket contains 1 of the 3 white numbers that were drawn and 2 of the 7 white numbers that were not drawn, so there are \(3\dbinom{7}{3}=\dfrac{3\cdot7\cdot6}{2}=63\) possibilities.

You miss the SuperBall if you have one of the 9 red numbers that were not drawn.

Therefore, there are \((35+63)\cdot9=882\) losing tickets.

Hence, there are \(1200-882=318\) winning tickets, and your probability of winning a super prize is

\(\dfrac{318}{1200}=\boxed{\dfrac{53}{200}}.\)
 

Note: We can approach this problem using direct counting, but there are a number of cases:

1.  Matching 3 white balls with any super ball.
2. Matching 2 white balls with any super ball.
3. Matching 1 white ball and matching the super ball.
4. Matching 0 white balls and matching the super ball.

Given the numerous cases here, a complementary counting approach is a faster approach.

Solution:

(a) There are four attributes, and there are three choices for each attribute. In a Set deck, there is one card for each combination of choices, so there are \(3^4=\boxed{81}\) cards.

(b) Note that if we choose any two cards, there is exactly one card that will complete a set. For example, consider the following two cards:

Since the first card has three shapes and the second card has one shape, the third card must have two shapes. Since both cards are red, the third card must also be red, and so on. Each attribute of the third card is determined uniquely by the first two cards, which gives us the following set:

There are \(\dbinom{81}{2}\) ways to choose two cards, and two cards uniquely generate a set. However, for each set, there are 3 ways that we could have chosen the two cards that generate the set. Therefore, the total number of possible sets is \(\dfrac{1}{3}\dbinom{81}{2}=\boxed{1080}.\)

(c) We want all three cards to be different with respect to every attribute.

There are \(81 \) ways to choose the first card in the set. Then for the second card, there are 2 ways to choose each attribute (since every attribute must be different from the first card), so there are \(2^4=16\) ways to choose the second card. Then the third card is uniquely determined (since every attribute must be different from the first two cards).

This gives us a count of \(81\cdot16=1296.\) But the order of the cards does not matter, so there are \(\dfrac{1296}{3!}=\boxed{216}\) sets in this case.

(d) There is one attribute where all three cards are the same, and they are different for every other attribute.

There are 4 ways to choose the attribute for which the cards are the same, then 3 options for this attribute. There are \(3^3=27\) ways to choose the first card (one attribute has already been determined), then \(2^3=8\) ways to choose the second card, and then the third card is uniquely determined.

So there are \(\dfrac{4\cdot3\cdot27\cdot8}{3!}=\boxed{432}\) sets in this case.

(e) There are two attributes where all three cards are the same, and they are different for every other attribute.

There are \(\dbinom{4}{2}=6\) ways to choose the two attributes for which they are the same, then 3 options for these attributes. There are \(3^2=9\) ways to choose the first card, then \(2^2=4\) ways to choose the second card, and then the third card is uniquely determined.

So there are \(\dfrac{6\cdot3^2\cdot9\cdot4}{3!}=\boxed{324}\) sets in this case.

(f) There are three attributes where all three cards are the same, and they are different for the remaining attribute.

There are \(\dbinom{4}{3}=4\) ways to choose the three attributes for which they are the same, then 3 options for these attributes. There are exactly three cards that meet these conditions, which form a set.

So there are \(4\cdot3^3=\boxed{108}\) sets in this case.

As a check, the answers for parts (c)-(f) add up to \(216+432+324+108=1080\) which is the answer for part (b).

Go to https://math.stackexchange.com/questions/4547004/find-the-number-of-sets-where-all-three-card-are-the-same-for-exactly-0-1-2-3 for answers.

30,60,90,120,150,180,210,240,270,300,330,360,390,420,450,480,510,540,570,600\(\cdots\)

30x=y, ve a desmos.com y busca y para obtener divisores de 30

For (3,1,0), there are 3!=6 ways.

For (2,2,0), there are 3 ways.

For (2,1,1), there are 3 ways.

So 6+3+3=15 ways.

Actually, the answer is 15.