Scribd
Upload
5 views2 pages

Discrete Structures Assignment Corrected Answers

The document contains corrected answers to a discrete structures assignment, covering topics such as set cardinality, binary relations, quantifiers, logical proofs, and properties of functions. It includes examples of sequences, mathematical induction, and set classifications. Additionally, it discusses the validity of arguments and properties of relations.

Uploaded by

shahzaibimtiazalone
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

Discrete Structures Assignment Corrected Answers

The document contains corrected answers to a discrete structures assignment, covering topics such as set cardinality, binary relations, quantifiers, logical proofs, and properties of functions. It includes examples of sequences, mathematical induction, and set classifications. Additionally, it discusses the validity of arguments and properties of relations.

Uploaded by

shahzaibimtiazalone
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Discrete Structures Assignment – Corrected Answers

1. The cardinality of the set of odd positive integers less than 10 is ____? Answer: The set is {1, 3, 5, 7, 9}.
Cardinality = 5

2. The members of the set S = {x | x is the square of an integer and x < 100} are ____ Answer: {0, 1, 4, 9,
16, 25, 36, 49, 64, 81}

3. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is ____ Answer: Not
reflexive (missing (3,3)), not symmetric ((2,1) exists, (1,2) does not), not transitive ((2,4) and (3,2) exist,
but (3,4) does not).

4. Express the statement in words: “Every student in class has studied Calculus.” Using quantifiers.
Answer: ∀x (S(x) → C(x)), where S(x): x is a student in class, C(x): x has studied Calculus.

5. Prove ¬(p ∨ (¬p ∧ q)) ≡ ¬p ∧ ¬q by law of logic. Proof: ¬(p ∨ (¬p ∧ q)) = ¬p ∧ ¬(¬p ∧ q) [De
Morgan’s] = ¬p ∧ (p ∨ ¬q) [De Morgan’s] = (¬p ∧ p) ∨ (¬p ∧ ¬q) [Distributive] = False ∨ (¬p ∧ ¬q)
[Negation] = ¬p ∧ ¬q [Identity]

6. Prove (p ∧ q) → (p ∨ q) ≡ T. (with Truth Table) Answer: | p | q | p ∧ q | p ∨ q | (p ∧ q) → (p ∨ q) |


|---|---|-------|-------|--------------------| | T | T | T | T | T | | T | F | F | T | T | | F | T | F | T | T | | F | F |
F | F | T | Always True (tautology)

7. Determine whether f(x) = (x²+1)/(x²+2) ; x ∈ ℕ is bijective or not. Answer: Injective, but not surjective.
Not bijective.

8. Prove argument: “All dogs are carnivorous,” “Some animals are dogs,” therefore “Some animals are
carnivorous.” Answer: Let D(x): x is a dog; C(x): x is carnivorous; A(x): x is an animal Premises: ∀x
(D(x) → C(x)), ∃x (A(x) ∧ D(x)) Conclusion: ∃x (A(x) ∧ C(x)). The argument is valid.

9. Classify the sets as finite or infinite: A = {months in the year}: Finite (12 elements) B = {even integers}:
Infinite C = {lines parallel to x-axis}: Infinite D = {x ∈ ℝ | x¹⁰⁰ + 29x⁵⁰ – 1 = 0}: Finite (at most 100 real
roots) E = {circles through origin}: Infinite

10. Relation R on A (people living today), pRq ⇔ same first name: Answer: Reflexive, symmetric,
transitive. (It is an equivalence relation.)

11. Is h: ℤ → ℤ, h(n) = 4n – 1 onto? Answer: No, it is not onto (not every integer in the codomain can be
reached).

12. For f: ℝ \ {1} → ℝ \ {1}, f(x) = (x + 1)/(x – 1): Injective: Yes Surjective: Yes Bijective: Yes Inverse: f⁻¹(x) = (x
+ 1)/(x – 1)

1
13. Explicit formulas for sequences: 1) 0, 1, –2, 3, –4, 5, …: aₙ = (–1)ⁿ⁺¹ n, n ≥ 0 2) 2, 6, 12, 20, 30, 42, 56, …:
aₙ = n² + n + 2, n ≥ 1

14. Mathematical induction: 1) Prove 1 + 2 + 2² + … + 2ⁿ = 2ⁿ⁺¹ – 1, n ≥ 0: Proof: Base case n=0 holds.
Inductive step: Assume true for n=k; show for n=k+1: 1 + 2 + ... + 2ᵏ + 2ᵏ⁺¹ = (2ᵏ⁺¹ – 1) + 2ᵏ⁺¹ = 2ᵏ⁺² – 1
True for all n ≥ 0. 2) Series 1/2 + 1/4 + 1/8 + … (infinite geometric): Sum = 1

15. U = {1, 2, 3, 4, 5}, C = {1, 3}, find A: (i) A ∪ B = U, A ∩ B = ∅, B = {1}: A = {2, 3, 4, 5} (ii) A ⊂ B, A ∪ B =
{4, 5}: A = {4}, {5}, or {4, 5} (iii) A ∩ B = {3}, A ∪ B = {2, 3, 4}, B ∪ C = {1, 2, 3}: A = {2, 3, 4} (iv) A ∩ B =
∅, B ∩ C = ∅, A ∪ B = {1, 2}: A = {1}, {2}, or {1, 2}

You might also like