
Mike D. answered 02/14/22
Experienced high school discrete math teacher
Proof by contradiction
Suppose a | b, then b = ka, where k is an integer
Then bc = kac = (kc) a, as k and c are integers so is kc, therefore a | bc
So we can't have a | b
Similarly we cant have a | c, so both a | b and a|c must be false simultaneously