Santino bought a book for $23.54. the price of the book was $22. what was the sales-tax rate?

Select 2 statements that are true about the equation y+6=-10(x-3).1) the slope of the line is -102) the slope of the line is 33) one point on the line is (3,6)4) one point on the line is (3,-6)

Each of the following data sets has a mean of x = 10. (i) 8 9 10 11 12 (ii) 7 9 10 11 13 (iii) 7 8 10 12 13 (a) without doing any computations, order the data sets according to increasing value of standard deviations. (i), (iii), (ii) (ii), (i), (iii) (iii), (i), (ii) (iii), (ii), (i) (i), (ii), (iii) (ii), (iii), (i) (b) why do you expect the difference in standard deviations between data sets (i) and (ii) to be greater than the difference in standard deviations between data sets (ii) and (iii)? hint: consider how much the data in the respective sets differ from the mean. the data change between data sets (i) and (ii) increased the squared difference îł(x - x)2 by more than data sets (ii) and (iii). the data change between data sets (ii) and (iii) increased the squared difference îł(x - x)2 by more than data sets (i) and (ii). the data change between data sets (i) and (ii) decreased the squared difference îł(x - x)2 by more than data sets (ii) and (iii). none of the above

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