Please help tint this problem!
You and your friends try to escape robots by climbing up to a digitally alterable bride shaped like the polynomial P(r)=4r^4-9r^3-r^2+6r-1. Unfortunately, robots can climb stairs and they are approaching you and your friends from every direction close to P(-1), P(0), and P(2). Your only option is to change the polynomial path of the bridge into a function that will cause the robots to fall through to the ground but you and your friends do not. Find a function to make holes in the path so the robots will fall to the ground, but you and your friends will stay safe on the bridge.
sorry for the typo(s)
- LujkLv 44 months ago
wow that problem sounds fun why didnt i get this crap back then