All categories

2 years ago

7 - (2x + 1) + 4x please show solving steps as well

Mathematics

1 answer:

xeze [42]2 years ago

7 0

Answer:

$2x + 6$

Step-by-step explanation:

$7 - (2x + 1) + 4x$

Distribute the negative inside 2x+1

$7 - 2x - 1 + 4x$

Remind that negative multiply negative must equal positive.

variables cannot sum/add/subtract with constants.

They must be the same terms.

$4x - 2x - 1 + 7 \\ 2x + 6$

Therefore, our answer is 2x+6

You might be interested in

PLZ HELP GIVING CORRECT ANSWER THE BRAINLIEST!!

beks73 [17]

Answer:

About 20.8

Step-by-step explanation:

form a triangle using each line

3 0

3 years ago

HELP HELP MEEEEEEE Determine whether the triangles are similar. If they are write similarity statement. Explain your reasoning.

Alex_Xolod [135]

Answer:

Step-by-step explanation:

every triangles degrees equal 180.

78+21=99

180-99=81

the smaller triangle

21+80= 101

180-101=79

so the degrees are different

6 0

2 years ago

Monica walks 2 miles each day Monday through Friday. She walks 3 miles on Saturday. She does not walk on Sunday. Monica calculat

tekilochka [14]

Lets calculate how much she walks each weeks and then we multiply that by the number of weeks.
weekWalk = 5(2) + 3 = 10 + 3 = 13
therefore, she walks 13 miles per week, if she walked for 29 weeks then we have:
total walked =(29)(13) = 377
so she walked 377 miles total, so her original estimate is not reasonable

5 0

2 years ago

To make 2 batches of nut bars, jayda needs to use 4 eggs. How many eggs are used in each nut bar?

Arada [10]

2 because, half of 4 is 2.

6 0

3 years ago

Show that if a and b are positive integers, then ab = gcd (a, b). lcm (a, b) . [Hint: Use prime factorizations of a and b and th

AleksandrR [38]

Answer:

$ab=\gcd(a,b)\cdot \text{lcm}(a,b)$

Step-by-step explanation:

Using the hint, write a and b in the following prime factorization:

$a=p_1^{x_1}p_2^{x_2}\cdots p_t^{x_t}\cdot q,$

$b=p_1^{y_1}p_2^{y_2}\cdots p_t^{y_t}\cdot r,$

where $\gcd(p_i,r)=1,\ \gcd(p_i,q)=1,\ \gcd(r,q)=1,\ \gcd(p_i,p_j)=1,$ for i ≠ j.

Then by the formulae for gcd(a,b) and lcm(a,b) we know that:

$\gcd(a,b)=p_1^{\min(x_1,y_1)}p_2^{\min (x_2,y_2)} \cdots p_t^{\min(x_t,y_t)}$

$\text{lcm}(a,b)= q\cdot r\cdot p_1^{\max(x_1,y_1)}p_2^{\max(x_2,y_2)}\cdots p_t^{\max(x_t,y_t)}$

Note that the expression $\min(x_i,y_i)+\max(x_i,y_i)=x_i+y_i$ for all i, since if the minimum is, without loss of generality, $x_i$ , then the maximum must be $y_i$ , and viceversa. Then, it is straightforward to verify that when we multiply gcd(a, b) and lcm(a, b) its prime factorization matches the prime factorization of ab, and so we can see the equaility holds:

$\gcd(a,b)\cdot \text{lcm}(a,b)=ab.$

7 0

3 years ago