KEMBAR78
Discrete Structures Assignment Solutions | PDF | Arithmetic | Mathematics
Scribd
Upload
22 views2 pages

Discrete Structures Assignment Solutions

The document contains various mathematical concepts and proofs, including cardinality of sets, properties of binary relations, quantifiers, logical equivalences, and bijectivity of functions. It also discusses finite and infinite sets, mathematical induction, and explicit formulas for sequences. Additionally, it provides examples of relations and their properties, as well as solutions to specific problems involving sets and functions.

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 TXT, PDF, TXT or read online on Scribd
22 views2 pages

Discrete Structures Assignment Solutions

The document contains various mathematical concepts and proofs, including cardinality of sets, properties of binary relations, quantifiers, logical equivalences, and bijectivity of functions. It also discusses finite and infinite sets, mathematical induction, and explicit formulas for sequences. Additionally, it provides examples of relations and their properties, as well as solutions to specific problems involving sets and functions.

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 TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Cardinality of odd positive integers less than 10:


4 (Set: {1, 3, 5, 7})

2. Members of set S = {x | x is the square of an integer and x < 100}:


{0, 1, 4, 9, 16, 25, 36, 49, 64, 81}

3. Binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on {1, 2, 3}:
Neither reflexive, symmetric, nor transitive
(Not reflexive: (3,3) missing; Not symmetric: (2,1) present, (1,2) not; Not
transitive: (2,4), (3,2) present, (3,4) not)

4. Statement “Every student in class has studied Calculus” using quantifiers:


∀x (S(x) → C(x))
(S(x): x is a student in class; C(x): x has studied Calculus)

5. Prove ¬(p ∨ (¬p ∧ q)) ≡ ¬p ∧ ¬q by laws of logic:


¬(p ∨ (¬p ∧ q))
= ¬p ∧ ¬(¬p ∧ q) (De Morgan’s)
= ¬p ∧ (p ∨ ¬q) (De Morgan’s)
= (¬p ∧ p) ∨ (¬p ∧ ¬q) (Distributive)
= F ∨ (¬p ∧ ¬q) (Negation)
= ¬p ∧ ¬q (Identity)

6. Prove (p ∧ q) → (p ∨ q) ≡ T with truth table:


| 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 |
Tautology

7. Is f(x) = (x² + 1)/(x² + 2), x ∈ ℕ, bijective?


Injective: f(a) = f(b) ⇒ (a² + 1)/(a² + 2) = (b² + 1)/(b² + 2) ⇒ a² = b² ⇒ a = b
Not surjective: y = (x² + 1)/(x² + 2) < 1, cannot reach y = 2
Not bijective

8. Prove argument: “All dogs are carnivorous,” “Some animals are dogs,” therefore
“Some animals are carnivorous”:
D(x): x is a dog; C(x): x is carnivorous; A(x): x is an animal
Premise 1: ∀x (D(x) → C(x))
Premise 2: ∃x (A(x) ∧ D(x))
∃x (A(x) ∧ D(x)) ∧ ∀x (D(x) → C(x)) ⇒ ∃x (A(x) ∧ C(x))
Valid

9. Finite/infinite sets:
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 roots)
E = {circles through origin}: Infinite

10. Relation R on A (people living today), pRq ⇔ same first name:


Reflexive: pRp (same name)
Symmetric: pRq ⇒ qRp
Transitive: pRq, qRr ⇒ pRr
Reflexive, symmetric, transitive

11. Is h: ℤ → ℤ, h(n) = 4n – 1 onto?


Solve h(n) = m: 4n – 1 = m ⇒ n = (m + 1)/4
Counterexample: m = 0 ⇒ n = 1/4 ∉ ℤ
Not onto

12. For f: ℝ \ {1} → ℝ \ {1}, f(x) = (x + 1)/(x – 1):


Injective: f(a) = f(b) ⇒ (a + 1)/(a – 1) = (b + 1)/(b – 1) ⇒ a = b
Surjective: y = (x + 1)/(x – 1) ⇒ x = (y + 1)/(y – 1), defined for y ≠ 1
Inverse: f⁻¹(x) = (x + 1)/(x – 1)
Bijective

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:
Base: n = 0, 2⁰ = 1, 2¹ – 1 = 1, holds
Inductive step: Assume 1 + 2 + … + 2ᵏ = 2ᵏ⁺¹ – 1
For k + 1: (2ᵏ⁺¹ – 1) + 2ᵏ⁺¹ = 2ᵏ⁺² – 1, holds
True for all n ≥ 0
2) Series 1/2 + 1/4 + 1/8 + …: Infinite geometric series, 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