A. Consider the situation where you have three game chips, each labeled with one of the the numbers 3, 5, and 10 in a hat a. If you draw out 2 chips without replacement between each chip draw, list the entire sample space of po ssible results that can occur in the draw Use the three events are defined as follows, to answer parts b through n below: Event A: the sum of the 2 drawn numbers is even.
Event B: the sum of the 2 drawn numbers is odd.
Event C: the sum of the 2 drawn numbers is a prime number
Now, using your answer to part a find the following probability values
b. P (A)=
c. P (B)=
d. P (C)=
e. P (A and C)-=
f. P(A or B)=
g. P (B andC)=
h. P(A or C)- =
i. P (C given B)=
j. P(C given A)=
k. P (not B)=
l. P (not C)=
Are events A and B mutually exclusive?Why or why not?
Are events B and C mutually exclusive? Why or why not?

a) {3,5}{3,10}{5,10}

b)

c)

d)

e)

f)

g)

h)

i)

j)

k)

l)

Yes, events A and B are mutually exclusive. Because the results can either be even or odd, not both. No, events B and C are not mutually exclusive because the result can be both, odd and prime.

Step-by-step explanation:

a)

In order to solve part a of the problem, we need to find the possible outcomes, in this case, the possible outcomes are:

{3,5}{3,10} and {5,10}

We could think of the oppsite order, for example {5,3}{10,3}{10,5} but these are basically the same as the previous outcomes, so we will just take three outcomes in our sample space. We can think of it as drawing the two chips at the same time.

b)

Now the probability of the sum of the chips to be even. There is only one outcome where the sum of the chips is even, {3,5} since 3+5=8 the other outcomes will give us an odd number, so:

c) For the probability of the sum of the chips to be odd, there are two outcomes where the sum of the chips is odd, {3,10} since 3+10=13 and {5,10} since 5+10=15 the other outcomes will give us an even number, so:

d) The probability of the sum of the chips is prime. There is only one outcome where the sum of the chips is prime, {3,10} since 3+10=13 the other outcomes will give us non prime results, so:

e) The probability of the sum of the chips to be even and prime. There are no results where we can get an even and prime number, since the only even and prime number there is is number 2 and no outcome will give us that number, so:

P(A and C)=0

f) The probability of the sum of the chips is even or odd. We can either get even or odd results, so no matter what outcome we get, we will get an odd or even result so:

g) The probability of the sum of the chips is odd and prime. There is only one outcome where the sum of the chips is odd and prime, {3,10} since 3+10=13 the other outcomes will give us non prime results, so:

h) The probability of the sum of the chips is even or prime. There are two outcomes where the sum of the chips is even or prime, {3,10} since 3+10=13 and {3,5} since 3+5=8 so:

i) The probability of the sum of the chips is prime given that the sum of the chips is odd. There are two possible results where the sum of the chips is odd {3,10} and {5,10} and only one of those results is even, {3,10}, so

j) The probability of the sum of the chips is prime given that the sum of the chips is even. There is only one possible even result: {3,5} but that result isn't prime, so

k) The probability of the sum of the chips is not odd. There is only one outcome where the sum of the chips is not odd (even), {3,5} so:

l) The probability of the sum of the chips is not prime. There are two outcomes where the sum of the chips is not prime, {3,5} and {5,10} so:

Are events A and B mutually exclusive?

Yes, events A and B are mutually exclusive.

Why or why not?

Because the results can either be even or odd, not both.

Are events B and C mutually exclusive?

No, events B and C are not mutually exclusive.

Why or Why not?

Because the result can be both, odd and prime.

i think it's eleven too, don't woosh me here, but according to the "experts" it's 2.

the proof starts from the peano postulates, which define the natural

numbers n. n is the smallest set satisfying these postulates:

  p1.   1 is in n.

  p2.   if x is in n, then its "successor" x' is in n.

  p3.   there is no x such that x' = 1.

  p4.   if x isn't 1, then there is a y in n such that y' = x.

  p5.   if s is a subset of n, 1 is in s, and the implication

      (x in s => x' in s) holds, then s = n.

then you have to define addition recursively:

  def: let a and b be in n. if b = 1, then define a + b = a'

      (using p1 and p2). if b isn't 1, then let c' = b, with c in n

      (using p4), and define a + b = (a + c)'.

then you have to define 2:

  def:   2 = 1'

2 is in n by p1, p2, and the definition of 2.

theorem:   1 + 1 = 2

proof: use the first part of the definition of + with a = b = 1.

      then 1 + 1 = 1' = 2   q.e.d.

note: there is an alternate formulation of the peano postulates which

replaces 1 with 0 in p1, p3, p4, and p5. then you have to change the

definition of addition to this:

  def: let a and b be in n. if b = 0, then define a + b = a.

      if b isn't 0, then let c' = b, with c in n, and define

      a + b = (a + c)'.

you also have to define 1 = 0', and 2 = 1'. then the proof of the

theorem above is a little different:

proof: use the second part of the definition of + first:

      1 + 1 = (1 + 0)'

      now use the first part of the definition of + on the sum in

      parentheses:   1 + 1 = (1)' = 1' = 2   q.e.d.