Algorithmshw 1
Algorithmshw 1
A={x∣x=5k,k∈Z}, A = {…,-15,-10,-5,0,5,10,15,…}
2.
3. P(A)= ({},{1},{3},{5},{1,3}{1,5},{3,5},{1,3,5})
4. DIRECT PROOF Proposition: let A be an even integer and B be an odd
integer, the product of A x B is always even. Assume the statement is
true Definition: (even integer)-an integer A is even if there exists KeZ
such that a=2k
Conclusion: this shows that all answers are multiples of two therefore any
odd integers “extra -1” gets another 1 added to it to make it 2
5. PROOF BY CONTRADICTION
Proposition: let X be a rational number and Y be irrational. X+Y is
irrational.
Contradiction: Assume the statement X+Y = rational
Definitions: rational number X can be represented as a fraction with
two integers F and M as X = F/M
Irrational number Y can not be represented as a fraction so it cannot be
represented by a fraction Y != F/M
Proof: Since we assume that the sum of X + Y is rational then the
output can be represented as a two integer fraction Z/S so
F/M + Y = Z/S Now subtract X from both sides to solve for y
Y = Z/S – F/M Solve for common denominator
Y = ZM-FS / SM
This equation shows Y as a fraction of integers Z,M,F,S which means y
must be rational which is a contradiction.