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.