0

Use prove by contradiction to prove that for all integers p , q and r, if p is not divisible by qr then p is not divisible by q

Dexter Tan
  • 9
  • 4
    Better check more carefully what the exercise is asking for. If you still have a question, see https://math.stackexchange.com/help/how-to-ask – David K Dec 14 '22 at 04:09
  • When P is divisible by qr , it must be divisible by q. [[ Eg , 75 is divisible by 5x3 , thus 75 divisible by 3 ]] When P is not divisible by qr , it may or may not be divisible by q [[ Eg , 75 is not divisible by 3x2 , yet 75 is divisible by 3 , while 75 is not divisible by 2 ]] – Prem Dec 14 '22 at 05:00

0 Answers0