All categories

3 years ago

For what values of x will make the following statement true?

Mathematics

1 answer:

Serhud [2]3 years ago

5 0

The value of x that will make the statement true is 1

Step-by-step explanation:

The given is:

f(x) = x - 4
g(x) = 2x + 3

We need to find the value of x which makes [f(x) + 2g(x)] = 7

∵ f(x) = x - 4

∵ g(x) = 2x + 3

∵ f(x) + 2g(x) = 7

- Multiply g(x) by 2

∵ 2g(x) = 2(2x + 3) = 2(2x) + 2(3) = 4x + 6

∴ 2g(x) = 4x + 6

∵ f(x) + 2g(x) = 7

∴ (x - 4) + (4x + 6) = 7

- Add the like terms in the left hand side

∴ (x + 4x) + (-4 + 6) = 7

∴ 5x + 2 = 7

- Subtract 2 from both sides

∴ 5x = 5

- Divide both sides by 5

∴ x = 1

The value of x that will make the statement true is 1

Learn more:

You can learn more about the equations in brainly.com/question/1284310

#LearnwithBrainly

You might be interested in

How do you do this? Find M

Luden [163]

Answer:

Step-by-step explanation:

Let angle ABZ be angle 1 and angle ZBC be angle 2.

Angle 1 = 85 degree

Angle 2 = 6x + 9

measure of angle ABC = 24x+4

Angle 2 = ABC - 85

6x + 9 = 24x + 4 - 85

6x - 24x = 4 - 85 - 9

-18x = -90

x = -90/-18 = 90/18 =

x = 5

Therefore the measure of angle 2 = 6*5 + 9 = 30+9 = 39 degree

Therefore the measure of angle ZBC = 39 degree

Hope you understand

Please mark as brainliest

Thank You

3 0

3 years ago

In how many ways can 100 identical chairs be distributed to five different classrooms if the two largest rooms together receive

Eva8 [605]

Answer:

There are 67626 ways of distributing the chairs.

Step-by-step explanation:

This is a combinatorial problem of balls and sticks. In order to represent a way of distributing n identical chairs to k classrooms we can align n balls and k-1 sticks. The first classroom will receive as many chairs as the amount of balls before the first stick. The second one will receive as many chairs as the amount of balls between the first and the second stick, the third classroom will receive the amount between the second and third stick and so on (if 2 sticks are one next to the other, then the respective classroom receives 0 chairs).

The total amount of ways to distribute n chairs to k classrooms as a result, is the total amount of ways to put k-1 sticks and n balls in a line. This can be represented by picking k-1 places for the sticks from n+k-1 places available; thus the cardinality will be the combinatorial number of n+k-1 with k-1, ${n+k-1 \choose k-1}$ .

For the 2 largest classrooms we distribute n = 50 chairs. Here k = 2, thus the total amount of ways to distribute them is ${50+2-1 \choose 2-1} = 51$ .

For the 3 remaining classrooms (k=3) we need to distribute the remaining 50 chairs, here we have ${50+3-1 \choose 3-1} = {52 \choose 2} = 1326$ ways of making the distribution.