2 years ago

−3(2+4k)+7(2k−1) eqivalent expression

Mathematics

1 answer:

Alex17521 [72]2 years ago

6 0

Answer:

$\large\boxed{-3(2+4k)+7(2k-1)=2k-13}$

Step-by-step explanation:

$-3(2+4k)+7(2k-1)\qquad\text{use the distributive property}\ a(b+c)=ab+ac\\\\=(-3)(2)+(-3)(4k)+(7)(2k)+(7)(-1)\\\\=-6-12k+14k-7\qquad\text{combine like terms}\\\\=(-12k+14k)+(-6-7)\\\\=2k-13$

You might be interested in

Give the “best” big-oh notation to describe the complexity of the algorithm that prints all bit strings of length n.

artcher [175]

It is correct to state that a bit can be in one of 2 states, either 1 or 0.

A bit is is a single binary digit. A bit can either be "1" or "0".

<h3>What is the explanation to the above answer?</h3>

We stated that It is correct to indicate that a bit can be in one of 2 states, either 1 or 0. This indicates that 2ⁿ strings must be created in total. The string must then be processed twice.