Find m<1
33°
28°
42°
47°

Match the following terms with their definitions. 1. bisector of a segment ray ba and ray bc are opposite rays if a, b, and c are collinear and b (the endpoint of both rays) is between a and c. 2. opposite rays a ray, , is the set of points beginning at point a and going infinitely in the direction of point b. 3. collinear points a line or segment that intersects the segment at its midpoint. 4. betweenness of points a set of two or more points all on the same line. 5. ray the distance between the endpoints of a segment. 6. space point b is between a and c if a, b, and c are collinear and the equation ab + bc = ac is true, where ab, bc, and ac are the distances between points a and b, b and c, and a and c, respectively. 7. midpoint of a segment a set of two or more points all on the same plane. 8. coplanar points the point on a segment that divides the segment into two equal segments. 9. length of a segment the set of all possible points. 10. line segment the set of two different endpoints and all points between them.

The dolphins at the webster are fed 1/2 of a bucket of fish each day the sea otters are fed 1/2 as much fish as the dolphins how many buckets of fish are the sea fed each day? simplify you answer and write it as a proper fraction or as a whole or mixed number

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