The given point P is located on the unit circle. Find sin e and cose. (0,1)
(-1,0)
(1,0)
(0,-1)

Ineed with this math problem p(65)=500×1.0325*65 the star means that you have to times it like 1.0325×1.0325?

An annual marathon covers a route that has a distance of approximately 26 miles. winning times for this marathon are all over 2 hours. the following data are the minutes over 2 hours for the winning male runners over two periods of 20 years each. earlier period 14 12 15 22 13 10 19 13 9 14 20 18 16 20 23 12 18 17 6 13 recent period 7 11 7 14 8 9 11 14 8 7 9 8 7 9 9 9 9 8 10 8 (a) make a stem-and-leaf display for the minutes over 2 hours of the winning times for the earlier period. use two lines per stem. (use the tens digit as the stem and the ones digit as the leaf. enter none in any unused answer blanks. for more details, view how to split a stem.) minutes beyond 2 hours earlier period 0 1 2 (b) make a stem-and-leaf display for the minutes over 2 hours of the winning times for the recent period. use two lines per stem. (use the tens digit as the stem and the ones digit as the leaf. enter none in any unused answer blanks.) minutes beyond 2 hours recent period (c) compare the two distributions. how many times under 15 minutes are in each distribution

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.)