Professional Documents
Culture Documents
Math 1302: Discrete Mathematics: Niversity OF HE Eople
Math 1302: Discrete Mathematics: Niversity OF HE Eople
UNIVERSITY
OF THE
PEOPLE
Content
Content ............................................................................................................................................................. 1
Introduction................................................................................................................................................... 2
Question 1....................................................................................................................................................... 2
Question 2....................................................................................................................................................... 2
Question 3....................................................................................................................................................... 3
Question 4....................................................................................................................................................... 3
Conclusion ...................................................................................................................................................... 4
Reference ........................................................................................................................................................ 5
Introduction
The purpose of the written assignment is to solve some problems using logic. All workings are
clearly shown in this assignment for maximum credit.
Question 1
1.
Construct the truth table of
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
1
1
0
0
1
1
0
0
0
0
0
0
1
1
0
0
0
0
0
1
0
0
0
1
1
1
1
0
1
1
1
0
0
0
0
0
0
1
0
1
1
1
1
0
1
1
1
1
Question 2
2. Use truth tables to prove that
0
0
0
0
1
1
0
0
1
1
0
0
0
1
0
1
0
1
1
1
0
0
1
1
0
0
0
0
1
1
0
0
0
0
1
1
1
1
1
0
1
1
0
0
0
0
0
1
1
1
1
0
1
1
1
1
1
0
1
1
1
1
1
1
0
1
0
0
0
0
0
0
1
0
0
1
1
1
1
1
1
1
1
0
1
1
1
1
Question 3
3. Write the dual of the statement (1) and use the laws of logic (not truth tables) to prove the
dual.
and
Question 4
4. Use mathematical induction to prove:
1.
2. Induction hypothesis: Assume P(n) is true. i.e.
3. Induction step: We must show that
Conclusion
From the above, many problems have been solved using logic theory.
Reference
Doerr, A., & Levasseur, K. (March 2013). Applied Discrete Structures (Version 2.0 ed.).
Massachusetts Lowe: Department Of Mathematical Sciences, University of
Massachusetts.