Scribd
Upload
11 views16 pages

Lec 1

Discrete Structures is a branch of mathematics focusing on distinct objects, essential in fields like computer science and cryptography. Key topics include set theory, logic, graph theory, combinatorics, and Boolean algebra, with propositions forming the foundation of mathematical logic. The document also discusses types of propositions and provides examples along with tasks to identify and negate propositions.

Uploaded by

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

Lec 1

Discrete Structures is a branch of mathematics focusing on distinct objects, essential in fields like computer science and cryptography. Key topics include set theory, logic, graph theory, combinatorics, and Boolean algebra, with propositions forming the foundation of mathematical logic. The document also discusses types of propositions and provides examples along with tasks to identify and negate propositions.

Uploaded by

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

Discrete Structures

(CSC102)

Lecture 01
Introduction to Discrete Structure
Discrete Structure is a branch of mathematics that deals with distinct and separate objects.
Unlike continuous mathematics, which deals with smooth variations (such as calculus),
discrete mathematics focuses on countable, non-continuous elements. It is widely used in
computer science, cryptography, data structures, and artificial intelligence.

Key topics in discrete structures:


• Set Theory (Operations on sets, functions, and relations)
• Logic and Propositional Calculus (Mathematical reasoning and proofs)
• Graph Theory (Graphs, trees, and networks)
• Combinatorics (Counting and arrangements)
• Boolean Algebra (Logical circuits and digital design)
Definition of Logic
Logic is the study of formal reasoning. It provides a framework to determine
the truth or falsity of statements using structured rules.

Logical reasoning is crucial in:


• Mathematical Proofs (Verifying theorems and properties)
• Algorithm Design (Creating efficient computing methods)
• Artificial Intelligence (Decision-making and automated reasoning)

Logical reasoning is based on propositions, which are statements that have a


definite truth value (true or false).
Proposition & Examples
A proposition is a declarative statement that is either true (T) or false
(F) but not both. Propositions are the foundation of mathematical logic
and proofs.

Examples of Propositions (Senior-Level Mathematical Understanding)


• "7 is a prime number." (True)

• "The sum of any two even numbers is always odd."


(False, because the sum of two even numbers is always even.)
Advanced Mathematical Propositions
Set Theory Proposition:
• "For all sets A and B, if A⊆B and B⊆A then A=B."
• This proposition states that if two sets contain the same elements, then
they are equal.

Number Theory Proposition:


• "If P is a prime number greater than 2, then P is always an odd
number."
• This is a true statement because the only even prime number is 2.
Graph Theory Proposition:
• "A connected graph with N vertices and N−1 edges is a tree."
• This is a well-known theorem in graph theory, which is always true.

Combinatorics Proposition:
• "The number of ways to arrange N distinct objects in a sequence is n!."
• This is the formula for permutations.

Logical Proposition in Proofs:


• "If N is an integer and N^2 is even, then N is also even."
• This can be proven using contrapositive logic, an essential proof technique
in discrete mathematics.
Types of Propositions
Atomic Proposition:
• A simple statement without logical operators.
• Example: "10 is a perfect square.“

Compound Proposition:
• A proposition is formed by combining multiple atomic propositions
using logical operators.
• Example: "If a function is continuous and differentiable, then it is also
integrable."
Class Task-1
Question:
Identify whether the following statements are propositions or not.
Justify your answer.

a) "Every prime number greater than 2 is odd.“

b) "What is the sum of two prime numbers?“

c) "If it rains, the ground will be wet."


Solution of Task-1
a) "Every prime number greater than 2 is odd.“

• This statement can be evaluated as true or false.


• All prime numbers except 2 are indeed odd.
• Since it has a definite truth value (true), it is a proposition.
b) "What is the sum of two prime numbers?“

• This is a question, not a declarative statement.


• It does not have a truth value (it’s neither true nor false).
• Therefore, it is not a proposition.
c) "If it rains, the ground will be wet.“

• This is a conditional (if-then) statement.


• It can be evaluated based on real-world conditions (e.g. if rain always
leads to a wet ground).
• Since it has a truth value, it is a proposition.
Final Answer:

(a) is a proposition

(b) is NOT a proposition

(c) is a proposition
Class Task-2
• Question:
• Write the logical negation of the following statement:
"If a number is divisible by 4, then it is also divisible by 2."
Solution of Task-2
Let:
• P: "A number is divisible by 4."
• Q: "The number is divisible by 2.“

• The given statement is an implication:


• P→Q
• which reads as "If P, then Q."
Apply the Negation Rule
• The negation of an implication P→Q follows the logical identity:

• ¬(P→Q)≡P∧¬Q

• which means:
"P is true, but Q is false."
Interpret the Negation in Words

• The negation of the given statement is:


"A number is divisible by 4, but it is not divisible by 2.“

• This contradicts basic divisibility rules because any number divisible


by 4 is always divisible by 2. Thus, the negation is a false statement in
standard arithmetic.
• However, logically, this is the correct negation.

You might also like