All categories

2 years ago

Easy algebra question below first correct answer gets brainliest

Mathematics

2 answers:

Ann [662]2 years ago

7 0

Answer:

x = 2 and -4

Step-by-step explanation:

(x + 1)² = 9

First, take the square root of both sides. This will eliminate the square on the left side.

(x + 1) = √9

Note that √9 can be 3 or -3.

Let's write out both possibilities.

(x + 1) = 3

(x + 1) = -3

Solve.

(x + 1) = 3

[subtract 1 from both sides]

x = 2

(x + 1) = -3

[subtract 1 from both sides]

x = -4

Your answers are 2 and -4.

Let's check our answers by plugging in the values back into the original equation.

(x + 1)² = 9

(2 + 1)² = 9

(3)² = 9

9 = 9

That solution is correct.

(x + 1)² = 9

(-4 + 1)² = 9

(-3)² = 9

9 = 9

That solution is also correct.

Your answer is correct.

Hope this helps!

andrezito [222]2 years ago

5 0

2?

I think this is it

You might be interested in

BINOMCDF on calculator question

max2010maxim [7]

Explanation:

For the purpose of filling in the table, the BINOMPDF function is more appropriate. The table is asking for p(x)--not p(n≤x), which is what the CDF function gives you.

If you want to use the binomcdf function, the lower and upper limits should probably be the same: 0,0 or 1,1 or 2,2 and so on up to 5,5.

The binomcdf function on my TI-84 calculator only has the upper limit, so I would need to subtract the previous value to find the table entry for p(x).

3 0

2 years ago

One way to convert from inches to centimeters is to multiply the number of inches by 2.54. How many centimeters are there in 1/4

NikAS [45]

Answer:

0.635

Step-by-step explanation:

1/4 x 2.54 = 0.635

3 0

3 years ago

Read 2 more answers

Olivia has enter a buffet line in which he chooses one kind of meat two kinds of vegatables and one dessert if the order of the

masya89 [10]

Using the Fundamental Counting Theorem, it is found that she can choose 180 different meals.

<h3>What is the Fundamental Counting Theorem?</h3>

It is a theorem that states that if there are n things, each with $n_1, n_2, \cdots, n_n$ ways to be done, each thing independent of the other, the number of ways they can be done is: