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 what is the maximum guess that could win.

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

step-by-step explanation:

3024 rhe base is what up in worry about