To win a contest, the number of beans in a jar has to be guessed within 20 of the actual number. If the number of beans in the jar is 645, which equation can be used to find the minimum and maximum number of beans that will win the contest, and what is the maximum guess that could win?

Step-by-step explanation:

Let the number of allowable guess be x.

The difference between allowable guess and 645 must not exceed 20.

So, either,

|645 - x| ≤ 20

Or

|x - 645| ≤ 20

where that sign represents the absolute sign.

Hope this Helps!!!

| x - 645 | = 20

665

Step-by-step explanation:

We have to guess the amount of beans in a jar to be within 20 of the actual number.

Therefore, the total has to be equal to 20.

We know that the equation required to calculate the minimum and maximum quantity of beans that will win the contest will be:

| x - 645 | = 20

But as we want is the maximum, we break the absolute value and assume "+"

Thus:

x - 645 = 20

fixed for x:

x = 20 + 645

x = 665

The maximum guess you could win is 665

2

step-by-step explanation:

1x2=2

hope this !

-payshence

glide reflection.

its mainly because the pattern will be infinite and will never end. it will look like a gilder or like a filpbook when set to motion.