Given: p is true
prove: p _ q is true
assume p and ~q are both true. ~q _ r, and r _ ~p. therefore, ~p and p cannot be true, so p and ~q cannot be true. therefore, p _ q is true.

what type of proof is illustrated above?

a. proof by contradiction
b. proof by law of detachment
c. proof by theorem

in the math equation 8 x 7 = 56, the 8 and the 7 are both factors of 56, since in this lesson we will use square tiles to figure out the factors of a whole find as many different arrays as you can, but follow one important rule: all the rows must have the i can make two rows of nine, so 2 and 9 are both factors of 18.

step-by-step explanation: