Consider the following problem: a farmer with 850 ft of fencing wants to enclose a rectangular area and then divide it into four pens with fencing parallel to one side of the rectangle. what is the largest possible total area of the four pens? (a) draw several diagrams illustrating the situation, some with shallow, wide pens and some with deep, narrow pens. find the total areas of these configurations. does it appear that there is a maximum area? if so, estimate it. (b) draw a diagram illustrating the general situation. let x denote the length of each of two sides and three dividers. let y denote the length of the other two sides. (c) write an expression for the total area a in terms of both x and y. a =

i think it's either c or d

step-by-step explanation: the entire question is extremely odd. 04 obviously refers to the interest rate. honestly i will say the answer is c. because the (2 x 12) part would mean it's compounded semiannually. i'll say choose c.

dont trust me im no expert these losers made me fail a test bro this sucks

step-by-step explanation:

answer: 33 ( approx)

step-by-step explanation:

since, in the linear regression formula, the slope is the a in the equation y = b + ax ( by comparing it with the general equation of line y = mx + c )

where,

here given table is,

price ($), x   :           18         23       25       29       30       33

pairs sold, y :         16         13         10       8         6       2

so, ,   ,   ,

and   ,

thus, slop of the given line is,

⇒  

⇒   ≈ 33

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.