strong induction
let f0=1, f1=1, and fn= fn-1+ fn-2 for all integers n> =2. prove by strong induction that fn< = 2^n for all integers n> =0.

answer: jasmine will bake 4/3 or 1 1/3 cookies in an hour

step-by-step explanation:

if u add 1/3 every 15 minutes after an hour u will have 4/3 or 1 1/3

(x3 + 6x2 + 2x - 6) • (x - 1)

step-by-step explanation:

polynomial long division :

3.2     polynomial long division

dividing :   x4+5x3-4x2-8x+6

                              ("dividend")

by         :     x-1     ("divisor")

dividend     x4   +   5x3   -   4x2   -   8x   +   6

- divisor   * x3     x4   -   x3            

remainder         6x3   -   4x2   -   8x   +   6

- divisor   * 6x2         6x3   -   6x2        

remainder             2x2   -   8x   +   6

- divisor   * 2x1             2x2   -   2x    

remainder               -   6x   +   6

- divisor   * -6x0               -   6x   +   6

remainder                     0

quotient :   x3+6x2+2x-6   remainder:   0

pls refer ro the top for answer