Question

if p is prime and p|ab, then p|a or p|b
prove

Answer 1

since p|a OR p|b, if p|a then the proof is done, so we assume p doesnt divide a and prove p|b. so p and a are relatively prime, so gcd(p,a)=1, by EEA 1=px+ay, thus b=pbx+aby, since p|pbx by the definistion of division and p|aby, p|b

Answer 2

not sure if that works

Answer 3

i guess it does actually

Answer 4

XD

Answer 5

uw math breakin my balls

Answer 6

lol

Answer 7

mine as well

Answer 8

are u guys in math 135?

Answer 9

i am ya

Answer 10

which section are you in?

Answer 11

what u mean?

Answer 12

what time do u go to class?

Answer 13

in the morning