Which values are possible rational roots of 4x3+9x2−x+10=0 according to the rational root theorem? Select each correct answer.

±2

±52

±12

±25

please explain thank you

James is playing his favorite game at the arcade. after playing the game 33 times, he has 88 tokens remaining. he initially had 2020 tokens, and the game costs the same number of tokens each time. the number tt of tokens james has is a function of gg, the number of games he plays

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?

Acaterer knows he will need 60, 50, 80, 40 and 50 dinner napkins on five successive evenings. he can purchase new napkins initially at 25 cents each, after which he can have dirty napkins laundered by a fast one-day laundry service (i. e., dirty napkins given at the end of the day will be ready for use the following day) at 15 cents each, or by a slow two-day service at 8 cents each or both. the caterer wants to know how many napkins he should purchase initially and how many dirty napkins should be laundered by fast and slow service on each of the days in order to minimize his total costs. formulate the caterer’s problem as a linear program as follows (you must state any assumptions you make): a. define all variables clearly. how many are there? b. write out the constraints that must be satisfied, briefly explaining each. (do not simplify.) write out the objective function to be minimized. (do not simplify.)