Now, consider the change problem in Binaryland. The input to this problem is an integer L. The output should be the minimum cardinality collection of coins required to make L cents of change (that is, you want to use as few coins as possible). In Binaryland, the coins are worth 1, 2, 22, 23, ..., 21000 cents. Assume that you have an unlimited number of coins of each type. Prove or disprove that the greedy algorithm (that takes as many coins of the highest value as possible) solves the change problem in Binaryland. HINT: The greedy algorithm is correct for one of the above two problems and is incorrect for the other.

When only separate discreet points are graphed it is called?

Find the area of the triangle formed by the origin and the points of intersection of parabolas y=−3x^2+20 and y=x^2−16.

The school track has eight lanes. each lane is 1.25 meters wide. the arc at each end of the track is 180. the distance of the home straight and the radii for the arcs in the 1st 4 lanes are given. s=85m r1=36.5m r2=37.75m r3=39m r4=40.25m part one: find the radii of lanes 5 through 8 of the track. show your work. part two: if max ran around lane one, how far did he run? show your work and explain your solution. part three: max wants to run a total of three laps around the track, choose two additional lanes (2-8) for him to run and find the distance around those two lanes. show your work and round to the hundredths. part 4: based on your lane choices in part three, what was the total distance max ran in the three laps around the track?