Brodrick correctly represents a composite number as the product of a pair of prime factors. Which equation could show Brodricks work? F-5×15=75 G-7×17=119 H-9×19=171 J-11×21=231

G-7×17=119

Step-by-step explanation:

A prime number is a number which has only two factors, 1 and itself.

A composite number on the other hand is any number that has more than two factors.

In the options

In F-5×15=75, 15 can still be decomposed into 5X3

In H-9×19=171, 9 can still be decomposed into 3X3

In J-11×21=231, 21 can still be written as 7X3.

So option G is the only equation which could show Brodricks work.

this might get deleted, sorry. it has to be an actual question. if you really wanted to give someone free points, ask a question like "why does the sky look blue, and the sun is yellow to our eyes? "

step-by-step explanation:

no, the equation would be invalid since they are both not equal.

step-by-step explanation:

here you got

4y-6+4y 2-9

first, you would simplify the equation on the form.

4y-6+4y 2-9

then, move all the terms that contains a y to the left and all the other terms to the right.

+4y-4y+-9-6

finally, you will simplify the left and the right side of the equation.

y=-3