Question

1.for any 2 non-zero integers x and y there exist a unique integer q and r called the quotient and remainder respectively such that x=yq+r where <=r|y|
i.e
division algorithm

2.if m is a prime integer, show that m/xy implies m/x and m/y



show step please

Answer 1

You might have gotten help by now if you had simply put "Math" in the School Subject box. Please follow directiions.

Answer 2

m|xy => m|x or m|y
not and

2|6*7

the first one has a typo, aNd google will provide many proofs of the division algorithm, and euclidean division