Let (a_1, b_1), (a_2, b_2) and (a_3, b_3) be three points in the cartesian plane. assume that a_1 notequalto a_2, a_1 notequalto a_3 and a_2 notequalto a_3. a) prove that there is a unique quadratic function that passes through these points. b) prove that there are infinity many cubic functions that passes through these points. c) prove that there is either one linear function that passes through these points or no linear functions that pass through these points. let f = [1 1 1 0]. compute f, f^2, f^3, f^4, and f^5. write out a general form for f^n in terms of fibonacci numbers. the fibonacci numbers are f_0 = 0, f_1 = 1, f_2 = 1, f_3 = 2, f_4 = 3, f_5 = 5, and f_n + 2 = f_n + f_n + 1 for n lessthanorequalto 4.

step-by-step explanation:

i found the koficent of the linear function and i foun c acordind to the strict formula y=kx+c and then i took 2 as an x and replacet it on the formula i found and then foun the y

the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner is 2.

spinner 1 spinner 2

1                     1

1                     2

1                     3

1                     4

2                   1

2                   2

2                   3

2                   4   = not 1, and 4

3                   1

3                   2

3                   3

3                   4 = not 1, and 4

only 2 outcomes have passed the given condition.

step-by-step explanation:

c(x)= 6x + 3

step-by-step explanation: