If n is an integer greater than 2, then for all integers m, n does not divide m or n + m # nm.

A. Can every proof by contraposition be easily rewritten as a proof by contradiction? Explain. B. Can every proof by contradiction easily be rewritten as a proof by contraposition? Explain.

Evaluate the proposition ∀∃y.P(x,y) ⇐⇒ ∃y.∀x.P(x,y) for an unknown predicate P. Could the statement be true? Must the statement be true for all P? Give a specific P (with domains for x and y) where it is either true or false. Prove that it is true for all P, or show a contradiction.

5. Consider the following: All numbers that end with a zero are divisible by 10. All numbers divisible by10 are divisible by 5. Therefore, every number that ends with a zero is divisible by 5.(a) Is this an argument? Why or why not? (b) Define your variables and write this argument as a sequence of premises in a form of implication,followed by a conclusion. (c) Is this argument valid? Prove using truth tables  and by recognizing the rule of inference