Те
3. Let U = {the natural number from 1 to 20}
T = {multiples of 3}
F = {multiples of 4}
(a) Draw a Venn diagram of this information.
(b) If a number is chosen at random from U, find:
(1) P(T) (ii) P(F) (iii) P(T) (iv) P(F')
(V) PIT N F)
(vi) PTUR

where did you get them? if you picked from the grass, is is probably poisonous.

step-by-step explanation:

the answer for this question is : 360°

step-by-step explanation:

we have been given a triangle   we need to tell which one of these is a triangle below to map onto itself.

360° rotation is the complete rotation which eventually leads to the same figure which is given.

the correct will be, that is 360° that will cause the triangle below to map onto itself.

there are 70 more legs than eyes at the dog show (196 – 126 = 70). dogs have two more legs than eyes, and humans have the same number of legs as eyes. thus 70 is twice the number of dogs at the show, so the number of dogs is half of 70, which is 35. to get the number of humans, subtract 35 from 63: 63 – 35 = 28.

step-by-step explanation:

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.