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? a. |x – 645| = 20; maximum guess: 655 beans. b. |x – 645| = 20; maximum guess: 665 beans. c. |x – 20| = 645; maximum guess: 655 beans. d. |x – 20| = 645; maximum guess: 665 beans

| 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

the answer is b hope it helps

|x-645|=20; the maximum guess is 665.

Therefore, Option b is correct.

Step-by-step explanation:

We have given the information that the jar has to be guessed within 20

So, the total has to be equal to 20

Hence, the equation |x-645|=20 is the required equation to calculate the minimum and maximum number of beans that will win the contest

When we will remove the modulus we will get two values + and -

So, x=20+645=665

And x=20-645= -625

Hence, the maximum guess is 665.

Therefore, Option b is correct.

- Equation of maximum or minimum: |n - 645| = ±20

- The maximum guess that could win is 665

Step-by-step explanation:

Given

Number of Beans = 645

Guess has to be within 20 more or less of 645

Required

- Equation to find minimum and maximum number of beans

- Maximum guess that could win;

Let the number of guess be represented by n

This question requires the use of absolute value

For maximum guess;

n has to be greater than 645;

So, the equation goes thus: |n - 645| = 20

And For minimum guess;

n has to be lesser than 645;

So, the equation goes thus: |n - 645| = -20

To calculate maximum or minimum, the above equations can be merged to give

|n - 645| = ±20

Hence, equation of maximum or minimum: |n - 645| = ±20

Calculating the maximum guess that could win;

Since, the question specifically request for the maximum guess;

We make use of the following formula;

Maximum Guess: |n - 645| = 20

Solve for n

|n - 645| = 20

n - 645 = 20

Add 645 to both sides

n - 645 + 645 = 20 + 645

n = 20 + 645

n = 665

Hence, the maximum guess that could win is 665

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!!!