Question

Someone help me with these proofs. Im lost but i did the symbolic form

Answer 1

ik it relates to this table?

Answer 2

@Aeon

Answer 3

Let A = "a divides bc"
Let B = "a divides b or a divides c"

The statement "if a divides bc then a divides b or a divides c"
can be re-written as "A => B"

Based on the 3rd image you posted, the following are equivalent to "A => B"
1. "not B => not A" which is rewritten as "a does not divide b and a does not divide c", then "a does not divide bc"
2. "(not A) or (B)" which is rewritten as "a does not divide bc" or "a divides b or a divides c"

So when you're looking for equivalent statements, find the ones that match them.


The negation is "not (A => B)"
which is equivalent to "A and (not B)"