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.

Choosing a booth location: your manager is sending two people to work at the conference. she wants a booth that will give your company good visibility for no more than 35% of the total budget ($3000). the conference coordinator just told you there are only five booths left. which booth will you choose? write the inequality that shows how much money you can spend on the booth simplify the inequality that shows how much money you can spend on the booth.

At 6 1/2 cents per pound of string beans how much does 7 pounds cost

Solve for x: 5/3 x = 20/21 it's fraction. remember to simplify your fraction