Sitemap

Basic Concepts Of Discrete Mathematics

2 min readApr 10, 2014

--

Discrete mathematics is the branch of mathematics which is the study of discrete mathematical structure. There are two types of data, one is continuous and the other is discrete. The discrete mathematics is the study of discrete data rather than the continuous data. It is also called finite mathematics. Discrete mathematics covered set theory, graph theory, mathematical induction, combination, determinants, permutations, logic, series, sequence, etc. To understand the discrete mathematics in a better way you can ask online discrete math help. Go through the article to approach the discrete mathematics in a proper manner.

Set Theory:

Set is basically the collection of objects. In discrete mathematics set theory focus more on finite sets. The set is inclose between “{ }”. For example, the set of even numbers {2,4,6,8}. There are some basic operations of set theory are union, intersection, complement, symmetric difference, Cartesian products and power set. (Click here) to know more about the Set Theory.

Logic:

Logic means in mathematics is reasoning. There are three basic logic negation, conjunction and disjunction. We called them Not (~), And (˄) and Or (˅) respectively.

1. Not(~) → It is a negation operation. If the statement input is true, then the not output is false.

2. And (˄) → It is also called as conjunction. And operand join two statements. If one of the statement is false, then the result is false. If both the statements are true then only the result is true.

Get John Marsh’s stories in your inbox

Join Medium for free to get updates from this writer.

3. OR (˅) → It is also called as disjunction. OR operand join two statements. If one of the statement is true then result is true. If both the statements are false then result is false.

Graph Theory:

As the name suggests the study of the graphs is called the graph theory. The properties of the graph are as follows,
1. Symmetry graph.
2. Assortativity graph
3. Cycle graph
4. Complete graph
5. Path graph

Combination:

The selection of the number of objects at a time are called combination. Order does not matter for the combination.

Permutation:

Permutation is the re-arrangement of the numbers of a set. Order does matter for the permutation. We can tell permutation is an ordered combination. Basically permutations are two types
1. Repetition
2. Not repetition

Important tips:

• Discrete mathematics deal with the finite sets.
• Understand the logic.
• Ask help from free tutoring online.
• Gain concepts of basic mathematics.
• Understand the applied math concepts.

--

--

John Marsh
John Marsh

Written by John Marsh

Enthusiastic, Optimistic, Nature Lover. An Education Counselor by Profession