If p is a prime number and x and y are integers, how do I prove "if xy and x+y are both divisible by p, then x and y is divisible by p"?

I started like this..

1) p divides xy, so p divides x or p divides y, since p is a prime number.

and then I'm already stuck :/

Help me to get to the next step please.

  • 2
    $\begingroup$ If $p$ divides $x$, since $p$ divides $x+y$ then ..... $\endgroup$ – N. S. May 14 '13 at 21:46
  • $\begingroup$ I understand that part but how do I get from here to proving that p also divides y? I'm not sure how to really utilize "p divides x+y" part. $\endgroup$ – user77850 May 14 '13 at 21:49

If $p$ divides $x$ but not $y$, can $p$ divide $x+y$?




Now suppose WLOG that $\,p\mid x\,$, and also we have $\,x+y=tp\,$ , so

$$(2)\;\;\;x=kp\implies tp=x+y=kp+y\implies\ldots\ldots$$


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.