DVD cases are sold in packages of 2. Padded mailing envelopes are sold in packets of 8. What is the least number of cases and envolopes you could buy so that there is one case for each envelope with none left over?

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol

4+4+2x

or

2x+8

step-by-step explanation:

493 would be the correct answer

step-by-step explanation:

answer: 5

step-by-step explanation:

since, the range is the difference between the lowest and highest values of the given sample space.

and, here the sample space = { 3, 1, 0, 4, 1, 4, 2, 3, 0, 5, 0, 1, 1, 2, 0, 4, 1,4, 4 ,2 ,3 ,2 ,0 ,1 ,4 }

here, the highest value of the given sample = 5

and, the lowest value = 0

therefore, the range of the sample space = 5 - 0 = 5