Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 157 views

    Bma1202 Discrete Mathematics Assignment

    Uploaded by

    cyrus
    This document outlines 9 problems in discrete mathematics. The problems cover defining terms like propositions, tautologies, and contradictions. Other problems involve using truth tables, sets, proofs, and Venn diagrams. The final problem uses a Venn diagram to calculate the number of students taking exactly one of three courses (mathematics, physics, or computer science) based on given enrollment numbers and overlaps between the courses.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Bma1202 Discrete Mathematics Assignment

    Uploaded by

    cyrus
    157 views3 pages
    This document outlines 9 problems in discrete mathematics. The problems cover defining terms like propositions, tautologies, and contradictions. Other problems involve using truth tables, sets, proofs, and Venn diagrams. The final problem uses a Venn diagram to calculate the number of students taking exactly one of three courses (mathematics, physics, or computer science) based on given enrollment numbers and overlaps between the courses.

    Original Title

    BMA1202 DISCRETE MATHEMATICS ASSIGNMENT

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines 9 problems in discrete mathematics. The problems cover defining terms like propositions, tautologies, and contradictions. Other problems involve using truth tables, sets, proofs, and Venn diagrams. The final problem uses a Venn diagram to calculate the number of students taking exactly one of three courses (mathematics, physics, or computer science) based on given enrollment numbers and overlaps between the courses.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    157 views3 pages

    Bma1202 Discrete Mathematics Assignment

    Uploaded by

    cyrus
    This document outlines 9 problems in discrete mathematics. The problems cover defining terms like propositions, tautologies, and contradictions. Other problems involve using truth tables, sets, proofs, and Venn diagrams. The final problem uses a Venn diagram to calculate the number of students taking exactly one of three courses (mathematics, physics, or computer science) based on given enrollment numbers and overlaps between the courses.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 3

    BMA1202: DISCRETE MATHEMATICS

    CAT 1 and 2

    1. Define the following terms


    i) Proposition - A proposition is a collection of declarative statements that has
    either a truth value "true” or a truth value "false". A propositional consists of
    propositional variables and connectives. We denote the propositional
    variables by capital letters (A, B, etc). The connectives connect the
    propositional variables.
    ii) Tautology- A tautology is a formula or assertion that is true in every possible
    interpretation.
    iii) Contradiction- A contradiction consists of a logical incompatibility or
    incongruity between two or more propositions
    iv) Contigency-  A proposition that is neither a tautology nor contradiction is
    called a contingency. (3mks)
    2. Use the truth table to show that ⋀( ⋁ ) ≡ ( ⋀ ) ⋁( ⋀ ).
    (3mks)
    Solution

    3. List the members of the set ={: −3 −4 = 0 }.


    (3mks)
    4. Prove that ( ∩ ) = ∪ .
    ( 3mks)
    5. Given the set U = { a,b,c,d,e,f,g,h,I,j } A = { a,c,e} B= {e,f,g} C= {f,g,h.i } and D={i} .
    Find
    I. B∪ C (2mks)
    II. AxB (3mks)
    III. (∩ ) (2mks)
    6. Prove by contradiction that if + > 5 then either > 2 or > 3.
    (3mks)
    Solution

    7. Find the power set of the set A= { 1,2,3,4 }. i.e P(A).


    (3mks)
    8. Let MP and C be the sets of students taking Mathematics courses, physics
    courses and Computer Science Courses respectively in a university.
    Assume | | = 300 , | | = 350, | | = 450 , | ∩ | = 100, | ∩ | = 150, | ∩ | = 75, | ∩ ∩ |
    = 10. How many students are taking exactly one of these
    courses. ( use Venn diagram )
    (3mks)
    Solution
    Given :-

     n(M) = Students study Mathematics = 300


     n(P) = Students study Physics = 350
     n(C) = Students study Computer Science = 450
     n(M ∩ P) = Students study mathematics and Physics = 100
     n(M ∩ C) = Students study Mathematics and Computer science = 150
     n(P ∩ C) = Students study Physics and Computer science = 75
     n(M ∩ P ∩ C) = Students study all three courses = 10 .

    To Find :-

     n( M ∪ P ∪ C ) = Number of students who study exactly one of those courses ?

    Formula used :-

     n ( A ∪ B ∪ C ) = n(A) + n(B) + n(C) - n ( A ∩ B ) - n(B ∩ C) - n (A ∩ C) + n( A ∩ B ∩ C )

    Putting all values in above formula we get :-

    → n( M ∪ P ∪ C ) = n(M) + n(P) + n(C) - n ( M ∩ P ) - n(P ∩ C) - n (M ∩ C) + n( M ∩ P ∩ C )

    → n( M ∪ P ∪ C ) = 300 + 350 + 450 - 100 - 150 - 75 + 10

    → n( M ∪ P ∪ C ) = 1100 - 325 + 10

    → n( M ∪ P ∪ C ) = 1100 - 315

    → n( M ∪ P ∪ C ) = 785

    Hence, 785 students are taking exactly one of those courses .

    9. Prove that 2 + 1 ≤ 2 for ≥ 3. (2mks)


    Solution

    You might also like