Asked by mat
plz help
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
sshow step please
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
sshow step please
Answers
There are no AI answers yet. The ability to request AI answers is coming soon!
There are no human answers yet. A form for humans to post answers is coming very soon!