Ask question

Ask question

All categories

2 years ago

10

A bake shop sells twenty different kinds of pastries. Twelve of them were chocolate. Zack randomly buys eight kinds of pastries.

What is the chance that four of them will be chocolate

1 answer:

MakcuM [25]2 years ago

7 0

Answer:

Just look at the other answer

Step-by-step explanation:

You might be interested in

Find the values of x and y. <br> x + 7i = y − yi

lys-0071 [83]

Answer: X = y - yi - 7i

Y = (x + 7i)/(1 - i)

Step-by-step explanation: for the case of (X) you only need to pass the 7i to the other side with the subtraction sign (-7i), then we get this equation:

x + 7i = y − yi

X = y - yi - 7i

in the case of the (Y), first we select the common multiple.

y - yi = y(1 - i)

if we replace it in the original expression, we get the following equation:

x + 7i = y(1 - i)

after that you can pass the value (1 - i) to the other side dividing,

Y = (x + 7i)/(1 - i)

6 0

3 years ago

Read 2 more answers

1. Prove or give a counterexample for the following statements: a) If ff: AA → BB is an injective function and bb ∈ BB, then |ff

Fantom [35]

Answer:

a) False. A = {1}, B = {1,2} f: A ⇒ B, f(1) = 1

b) True

c) True

d) B = {1}, A = N, f: N ⇒ {1}, f(x) = 1

Step-by-step explanation:

a) lets use A = {1}, B = {1,2} f: A ⇒ B, f(1) = 1. Here f is injective but 2 is an element of b and |f−¹({b})| = 0., not 1. This statement is False.

b) This is True. If A were finite, then it can only be bijective with another finite set with equal cardinal, therefore, B should be finite (and with equal cardinal). If A were not finite but countable, then there should exist a bijection g: N ⇒ A, where N is the set of natural numbers. Note that f o g : N ⇒ B is a bijection because it is composition of bijections. This, B should be countable. This statement is True.

c) This is true, if f were surjective, then for every element of B there should exist an element a in A such that f(a) = b. This means that f−¹({b}) has positive cardinal for each element b from B. since f⁻¹(b) ∩ f⁻¹(b') = ∅ for different elements b and b' (because an element of A cant return two different values with f). Therefore, each element of B can be assigned to a subset of A (f⁻¹(b)), with cardinal at least 1, this means that |B| ≤ |A|, and as a consequence, B is finite.

b) This is false, B = {1} is finite, A = N is infinite, however if f: N ⇒ {1}, f(x) = 1 for any natural number x, then f is surjective despite A not being finite.

4 0

3 years ago

Instructions: Read the prompt, respond to the prompt below the sources provided. Use the quote and sources provided to support y

olga55 [171]

Answer: cool

Step-by-step explanation:

6 0

3 years ago

Recall that a 6-bit string is a bit strings of length 6, and a bit string of weight 3, say, is one with exactly three 1's. How m

strojnjashka [21]

Answer:

1.. Total number of 6 bit strings is 64

2. Number of 6-bit strings with weight of 0 is 1

3. Number of 6-bit strings with weight of 1 is 6

4. Number of 6-bit strings with weight of 3 is 20

5. Number of 6-bit strings with weight of 5 is 6

6. Number of 6-bit strings with weight of 6 is 1

7. Number of 6-bit strings with weight of 7 is 0

Step-by-step explanation:

A bit string is a string that contains 0 and 1 only

1. Total number of 6 bit strings is 2^6 = 64

2. Number of 6 bit strings with weight 0 is 1

Explanation

Weight 0 means a string with no occurrence of 1

Here, we are only interested in occurrence and not order of occurrence

We apply combination formula for this

nCr = n!/(n-r)!r!

n = 6 and r = 0 i.e. no occurrence of 1

6C0 = 6!/(6-0)!0!

6C0 = 6!/6!0!

6C0 = 1

Hence, the number of string with weight 0 (i.e. no occurrence of 1 ) is 1

3. Number of string with weight 1 is 6

Explanation

Weight 0 means a string with exactly 1 occurrence of '1'

Here, we are only interested in occurrence and not order of occurrence

We apply combination formula for this

nCr = n!/(n-r)!r!

n = 6 and r = 1

6C1 = 6!/(6-1)!1!

6C1 = 6!/5!1!

6C1 = 6

Hence, the number of string with weight 6

4. Number of string with weight 3 is 20

Explanation

n = 6 and r = 3

6C3 = 6!/(6-3)!3!

6C3 = 6!/3!3!

6C3 = 20

Hence, the number of string with weight 3 is 20

5. Number of string with weight 5 is 6

Explanation

n = 6 and r = 5

6C5 = 6!/(6-5)!5!

6C5 = 6!/1!5!

6C5 = 6

Hence, the number of string with weight 5 is 6

6. Number of string with weight 6 is 1

Explanation

n = 6 and r = 6

6C6 = 6!/(6-6)!6!

6C6 = 6!/0!6!

6C6 = 1

Hence, the number of string with weight 6 is 1

7. Number of string with weight 7 is 0

Weight of 7 means that a string that has 7 occurrence of 1

The total length of a 6 bit is 6

Since 6 is less than 7, there's no way a bit of weight 7 can occur.

So, the right answer for this is 0.

8 0

3 years ago

The equation of a circle whose center is (3,7) and whose radius is 6 is

Aleks [24]

The equation of any given circle is:
${(x - h)}^{2} + {(y - k)}^{2} = {r}^{2}$
where (h, k) is the center and r is the radius.

In the problem, we are given the center, and the radius. When we plug them in:
${(x - 3)}^{2} + {(y - 7)}^{2} = 36$
we got the formula of the circle.

4 0

3 years ago