Course Hero Logo

MATH221-2019S1-Class Test.pdf - Math221 – Mathematics for...

Course Hero uses AI to attempt to automatically extract content from documents to surface to you and others so you can study better, e.g., in search results, to enrich docs, and more. This preview shows page 1 - 2 out of 2 pages.

MATH121 Session 1, Jan-Mar 2019Page 1 of 2Math221 – Mathematics for Computer ScienceClass TestSession 1, January – March 2019Duration: 1 hour 30 minutesThis paper has SIX questions. Answer ALL the questions.Question 1LetP,QandRbestatements. Prove the following:((PQ)R)(P(QR))(10 marks)Question 2(a)LetP,QandRbe simple statements. Construct the truth table for thecompound statement.()()[]RPQPR~Hence, determine whether it is a tautology, contradiction or contingentstatement.(12 marks)(b)Write the following statements using quantifiers:(i)The square of any integer is odd.(4 marks)(ii)Everybody is older than somebody.(4 marks)Question 3Find the simplest expression for the following set. Justify each of the steps by citingthe set theory rule used.��𝐴𝐴̿∩ 𝐵𝐵� ∪ 𝐴𝐴̅� ∪ �(𝐵𝐵∩ 𝐴𝐴)(𝐵𝐵∩ 𝐵𝐵)(20 marks)Question 4(a)Using a suitable form of Mathematical Induction, prove the following.1 + 4 + 7 + … + (3n– 2) =𝑛𝑛(3𝑛𝑛−1)2
MATH121 Session 1, Jan-Mar 2019Page 2 of 2
End of preview. Want to read all 2 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
One
Professor
David Pask
Tags
1 Hour, Binary relation, Transitive relation, 30 Minutes

Newly uploaded documents

Show More

Newly uploaded documents

Show More

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture