Atarot hand consists of cards drawn at random from the deck. what is the probability that a tarot hand has a void, meaning that at least one suit is not present among the cards? once you've computed the answer in terms of binomial coefficients, use a calculator or computer to determine the answer to the nearest tenth of a percent, and enter that as your answer.

i think the answer is b.

step-by-step explanation:

not 100% sure though.

for the friend request.

when a figure, such as triangle (xyz) is reflected over the line y = x to create x'y'z' the x-coordinates and y-coordinates of the original image (pre-image) will be reversed for the image. (e.g., (x, y) > (y, x)) this means that the pre-image position of the x- and y-coordinates switch places which in turn provides a mirror like image of the original xyz.  

i notice that when i draw a line segment from x to x', that the points are parallel from each other -- they are exactly across from each other and do not intersect with any other points.  

yes, think i would see the same characteristic if you drew the line segment connecting y with the reflecting line and then y' with the reflecting line because of the essence of reflections. because it is a mirror image, each point was effected the same way which leads me to conclude that they same would apply to y and y'.

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.