Step 3: Making predictions using data You and your business partner track the number of customers served and the amount of tips collected per day. The data you gathered is displayed in the chart below.

Servers’ Collected Tips

Customers 54 46 34 67 52 22 49 64 55 80 38 42

Tips ($) $92 $80 $76 $121 $109 $43 $87 $114 $99 $174 $88 $91

a) Create a scatterplot displaying the data in the table. Be sure to include a linear trend line. (2 points)

b) Find the equation of the trend line (line of best fit). Show your work. (2 points)

c) Predict the amount of tips that would be collected if 100 customers were served at the restaurant on a given day. Explain your reasoning. (2 points)

d) Explain how to use the regression calculator to make a reasonable prediction given a data table. (2 points)

100 points!

option 1 is correct.

step-by-step explanation:

y varies inversely with x and constant of variation is 4

the equation will be:

y = k/x

where k =4 so,

y = 4/x

if we put values of x of option 1 in the above equation and find values of y

y = 4/-2 => y =-2

y = 4/-1 => y = -4

y = 4/1 => y = 4

y = 4/2 => y =2

so, all the values of x and y are correct.

if we put values of x given in other options and find value of y we cannot find whole table satisfying the equation.

hence option 1 is correct.

jgfjttgbgcfbc

step-by-step explanation:

h56

j

jgh

j

gh

hnh

vnf

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.