Scribd
Upload
28 views2 pages

KU Discrete Math Formula Sheet

This document is a formula sheet for Discrete Mathematics covering key concepts in Set Theory, Propositional Logic, Relations and Functions, Combinatorics, Recurrence Relations, Graph Theory, and Groups. It includes important formulas, definitions, and properties such as De Morgan's Laws, permutation and combination formulas, and characteristics of graphs and groups. Additionally, it provides an exam tip to aid in understanding and applying the concepts.

Uploaded by

pk6200356792
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
28 views2 pages

KU Discrete Math Formula Sheet

This document is a formula sheet for Discrete Mathematics covering key concepts in Set Theory, Propositional Logic, Relations and Functions, Combinatorics, Recurrence Relations, Graph Theory, and Groups. It includes important formulas, definitions, and properties such as De Morgan's Laws, permutation and combination formulas, and characteristics of graphs and groups. Additionally, it provides an exam tip to aid in understanding and applying the concepts.

Uploaded by

pk6200356792
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 Mathematics - Kurukshetra University Formula Sheet

1. Set Theory

- n(A U B) = n(A) + n(B) - n(A n B)

- Power Set = 2^n subsets for a set with n elements

- De Morgan's Laws:

(A U B)' = A' n B'

(A n B)' = A' U B'

2. Propositional Logic

- AND: p AND q | OR: p OR q | NOT: NOT p | Implication: p -> q | Bi-implication: p <-> q

- Tautology: Always true | Contradiction: Always false

- Basic Laws: Identity, Domination, Double Negation, DeMorgan's

3. Relations and Functions

- Reflexive: (a, a) in R for all a in A

- Symmetric: (a, b) in R implies (b, a) in R

- Transitive: (a, b) and (b, c) in R implies (a, c) in R

- One-One: f(x1) != f(x2) when x1 != x2

- Onto: Every element in co-domain is mapped

4. Combinatorics & Counting

- Permutation: nPr = n! / (n - r)!

- Combination: nCr = n! / (r! * (n - r)!)

- Pigeonhole Principle: If n > m, then at least one box has 2 or more items

5. Recurrence Relations
- Linear homogeneous: a_n = r * a_(n-1) + s * a_(n-2)

- Solve by characteristic equation

6. Graph Theory

- Euler Circuit: All vertices of even degree

- Hamiltonian Path: Visit each vertex once

- Tree: Connected acyclic graph

- Spanning Tree: Includes all vertices with (n - 1) edges

7. Groups and Algebraic Structures

- Group: Set + binary operation: closed, associative, identity, inverse

- Lagrange's Theorem: Order of subgroup divides order of group

- Abelian Group: Commutative operation

Exam Tip: Draw diagrams, define each term clearly, use logic step-by-step.

You might also like