A pair of fair dice is rolled once. Suppose that you lose ​$ if the dice sum to and win ​$ if the dice sum to or . How much should you win or lose if any other number turns up in order for the game to be​ fair? To keep the game​ fair, you should ▼ lose win ​$ enter your response here if the dice sum to any other number. ​(Do not round until the final answer. Then round to the nearest cent as​ needed.)

i dont know if you cant find a way its best to actually add all of them start from 105 tho

step-by-step explanation:

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