discrete math
9)
a.
1, -1, 2, -2, 4, -4, 8, -8, 16, -16 .........
Following is the recursive definition,
with base cases as
b.
Following is the recursive definition,
with base cases as
10)
This property is called Hypothetical Syllogism.
Also Contrapositive of a logical statement is logically equivalent to the original statement
Taking the contrapositive we get
So
As we can see from the truth table, the conclusion is true for all possible input combinations of p,q,r. So, argument is valid.
And because and are logically equivalent , the argument is valid for as well.
discrete math Write a recursive definition that generates the terms of each of the two following integer sequences: 9. a. 1,-1,2,-2, 4,-4,8,-8, 16,-16, b 1,2, 3,6, 11, 20, 37, 68, 125, 230, 42...