Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (anonymous):

prove or disprove: If a divides bc, then a divides b or a divides c

OpenStudy (phi):

let b=3, c=4, a=6

OpenStudy (anonymous):

-sigh here is a variable-based counterexample. (Clearly, a must be greater than 1 since otherwise it is true! 1 divides every integer.) Let b = a+1 and c = a-1 Then, b+c = 2a Obviously a divides b+c since a divides 2a. But since a>1, a cannot divide b since b ≡ 1 (mod a) and a cannot divide c since c ≡ -1 (mod a)

OpenStudy (anonymous):

got it?

OpenStudy (anonymous):

yeah, i think so. thanks.

OpenStudy (phi):

to disprove a statement, all you need is one counter-example.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!