4. Assuming half as many halibut were caught on Sunday as on Monday, how many halibut were caught on Sunday?

stew reads at the fastest rate of 265 words per minute.

step-by-step explanation:

it's a given that felicia reads at 260 word per minute and on connie's graph we can see that she reads 200 words per minute. since stew's table tells us that he read 795 in 3 minutes, we can divide 795 by 3 to find out how many words he reads per minute.

795/3 = 265

stew reads 265 words per minute - he reads at the fastest rate since felecia reads at 260 words per minute and connie reads at 200 words per minute.

stew (265) > felecia (260) > connie (200)

-362

step-by-step explanation:

(12)(4)+2(12)-34(12)+2(12)-3

  \/         \/         \/         \/

  48 +   24 -   408 + 24 - 3

      \   /               \   /

          72     -     432 - 3 = -363

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.

add the numbers under frequency to find the total number:

5 + 8 +7 + 4 + 0 +1 = 25

the answer is 25.