All categories

2 years ago

Solve for x. x+4/2x+2=4/x+1

Mathematics

1 answer:

HACTEHA [7]2 years ago

5 0

Answer:

Step-by-step explanation:

First, cross multiply.

(x+4)(x+1)=4(2x+2)

x^2+5x+14=8x+8

x^2-3x-4=0

(x+1)(x-4)=0

x+1=0 x-4=0

x = -1, x=4

You might be interested in

A rectangle is drawn on a coordinate plane. Three vertices of the rectangle are points A(−7,2) , B(3,2) , and D(−7,−2) . Point C

Alexandra [31]

the distance from point b to c is 4 down the y-axis

8 0

2 years ago

Y’all someone help pls 5x-3=21-x

attashe74 [19]

5x-3=21-x
6x=24
X=4

You simply have to isolate the variable and then divide by 6 so that x is completely alone.

7 0

2 years ago

Read 2 more answers

Josie found a small bird bath at a garage sale. The bird bath has a circular opening with a radius of 10 cm, as shown in the dia

sveticcg [70]

Answer: 1256cm

Step-by-step explanation:

8 0

3 years ago

Please answer this question i really want answers :(

vekshin1

Based on the hints of distinguishing between radical and non-radical numbers, we have the following lists:

$\sqrt{3}$ , $2.\overline{2}$ , 2.5, $\sqrt{5}$
3.01, $3.\overline{01}$ , $3.\overline{1}$ , $\sqrt{9}$
$-4.\overline{1}$ , - 4.1, 4.01, $\sqrt{17}$
- 2.5, $-\sqrt{5}$ , $\sqrt{6}$ , 2.5

<h3>How to order numbers from least to greatest</h3>

In this question we must order sets of numbers in ascending order. A hint consists in comparing non-radical numbers with the closest radical numbers whose results are integers.

In consequence, we obtain the following orders:

$\sqrt{3}$ , $2.\overline{2}$ , 2.5, $\sqrt{5}$
3.01, $3.\overline{01}$ , $3.\overline{1}$ , $\sqrt{9}$
$-4.\overline{1}$ , - 4.1, 4.01, $\sqrt{17}$
- 2.5, $-\sqrt{5}$ , $\sqrt{6}$ , 2.5

To learn more on sets: brainly.com/question/18877138

#SPJ1

3 0

2 years ago

There are eight different jobs in a printer queue. Each job has a distinct tag which is a string of three upper case letters. Th

N76 [4]

Answer:

a. 40320 ways

b. 10080 ways

c. 25200 ways

d. 10080 ways

e. 10080 ways

Step-by-step explanation:

There are 8 different jobs in a printer queue.

a. They can be arranged in the queue in 8! ways.

No. of ways to arrange the 8 jobs = 8!

= 8*7*6*5*4*3*2*1

No. of ways to arrange the 8 jobs = 40320 ways

b. USU comes immediately before CDP. This means that these two jobs must be one after the other. They can be arranged in 2! ways. Consider both of them as one unit. The remaining 6 together with both these jobs can be arranged in 7! ways. So,

No. of ways to arrange the 8 jobs if USU comes immediately before CDP

= 2! * 7!

= 2*1 * 7*6*5*4*3*2*1

= 10080 ways

c. First consider a gap of 1 space between the two jobs USU and CDP. One case can be that USU comes at the first place and CDP at the third place. The remaining 6 jobs can be arranged in 6! ways. Another case can be when USU comes at the second place and CDP at the fourth. This will go on until CDP is at the last place. So, we will have 5 such cases.

The no. of ways USU and CDP can be arranged with a gap of one space is:

6! * 6 = 4320

Then, with a gap of two spaces, USU can come at the first place and CDP at the fourth. This will go on until CDP is at the last place and USU at the sixth. So there will be 5 cases. No. of ways the rest of the jobs can be arranged is 6! and the total no. of ways in which USU and CDP can be arranged with a space of two is: 5 * 6! = 3600

Then, with a gap of three spaces, USU will come at the first place and CDP at the fifth. We will have four such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 4 * 6!

Then, with a gap of four spaces, USU will come at the first place and CDP at the sixth. We will have three such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 3 * 6!

Then, with a gap of five spaces, USU will come at the first place and CDP at the seventh. We will have two such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 2 * 6!

Finally, with a gap of 6 spaces, USU at first place and CDP at the last, we can arrange the rest of the jobs in 6! ways.

So, total no. of different ways to arrange the jobs such that USU comes before CDP = 10080 + 6*6! + 5*6! + 4*6! + 3*6! + 2*6! + 1*6!

= 10080 + 4320 + 3600 + 2880 + 2160 + 1440 + 720

= 25200 ways

d. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways. Similarly, if LPW comes last, the remaining 7 jobs can be arranged in 7! ways. so, total no. of different ways in which the eight jobs can be arranged is 7! + 7! = 10080 ways

e. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways in the queue. Similarly, if QKJ comes second-to-last then also the jobs can be arranged in the queue in 7! ways. So, total no. of ways to arrange the jobs in the queue is 7! + 7! = 10080 ways

3 0

2 years ago