qwertyuiopasdfghjklzxcvbnmqwerty

uiopasdfghjklzxcvbnmqwertyuiopasd
fghjklzxcvbnmqwertyuiopasdfghjklzx
cvbnmqwertyuiopasdfghjklzxcvbnmq
wertyuiopasdfghjklzxcvbnmqwertyui
opasdfghjklzxcvbnmqwertyuiopasdfg
Discrete Mathematics in the Real Life
hjklzxcvbnmqwertyuiopasdfghjklzxc
Mathematics Project

vbnmqwertyuiopasdfghjklzxcvbnmq
wertyuiopasdfghjklzxcvbnmqwertyui
GAIRIK SAJJAN(191112015014)
opasdfghjklzxcvbnmqwertyuiopasdfg
SANDIP DAS(191112015029)
MAMON SAHID(191112015024)
SUDESHNA PANDA(191212015049)

hjklzxcvbnmqwertyuiopasdfghjklzxc
vbnmqwertyuiopasdfghjklzxcvbnmq
wertyuiopasdfghjklzxcvbnmqwertyui
opasdfghjklzxcvbnmqwertyuiopasdfg
hjklzxcvbnmrtyuiopasdfghjklzxcvbn
mqwertyuiopasdfghjklzxcvbnmqwert
yuiopasdfghjklzxcvbnmqwertyuiopas
 ACKNOWLEDGEMENT

I respect and thank Dr.  Saikat Maity(HOD,CSE,JIS UNIVERSITY) and DR. SANHITA BANERJEE

CHATTARAJ(HOD,MATHEMATICS,JIS UNIVERSITY), for providing me an opportunity to do the

project work in ‘DISCRETE MATHEMATICS IN THE REAL WORLD’ and giving us all support and

guidance which made me complete the project duly. I am extremely thankful to him for providing

such a nice support and guidance, although he had busy schedule.

2|Page
 Index

Topic Name Page No.

Introduction 3
Short discussion about different topics in
Discrete Mathematics 4-6
Application of discrete mathematics
7-11
Everyday applications in technical 7-9
field
Research and corporate 9-11
applications
Other Applications 11-12
Conclusion 12

3|Page
 INTRODUCTION
Discrete Mathematics is part of everyone’s life. In every instant of life
everyone has connectivity with mathematics. By every aspect,
mathematics is used in our real life. We have various applications of
mathematics.
Mathematics can be broadly classified into two categories −
 Continuous Mathematics − It is based upon continuous
number line or the real numbers. It is characterized by the fact
that between any two numbers, there are almost always an
infinite set of numbers. For example, a function in continuous
mathematics can be plotted in a smooth curve without breaks.

 Discrete Mathematics − It involves distinct values; i.e.

between any two points, there are a countable number of
points. For example, if we have a finite set of objects, the
function can be defined as a list of ordered pairs having these
objects, and can be presented as a complete list of those pairs
There are various topics in Discrete mathematics. To be specific,
they are –

Sets, Relations and Functions

Mathematical Logic
Group theory
Counting Theory
Probability
Mathematical Induction and Recurrence Relations
Graph Theory
Boolean Algebra

Short discussion about different topics in Discrete Mathematics

4|Page
Set Theory
Set theory is the mathematical theory of well-determined collections, called sets, of objects that are
called members, or elements, of the set. Pure set theory deals exclusively with sets, so the only sets under
consideration are those whose members are also sets. The theory of the hereditarily-finite sets, namely those
finite sets whose elements are also finite sets, the elements of which are also finite, and so on, is formally
equivalent to arithmetic. So, the essence of set theory is the study of infinite sets, and therefore it can be
defined as the mathematical theory of the actual—as opposed to potential—infinite.The notion of set is so
simple that it is usually introduced informally, and regarded as self-evident. In set theory, however, as is usual
in mathematics, sets are given axiomatically, so their existence and basic properties are postulated by the
appropriate formal axioms. The axioms of set theory imply the existence of a set-theoretic universe so rich
that all mathematical objects can be construed as sets. Also, the formal language of pure set theory allows one
to formalize all mathematical notions and arguments. Thus, set theory has become the standard foundation for
mathematics, as every mathematical object can be viewed as a set, and every theorem of mathematics can be
logically deduced in the Predicate Calculus from the axioms of set theory.

Mathematical Logic
Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics. It
bears close connections to metamathematics, the foundations of mathematics, and theoretical computer
science.[1] The unifying themes in mathematical logic include the study of the expressive power of formal
systems and the deductive power of formal proof systems.Since its inception, mathematical logic has both
contributed to, and has been motivated by, the study of foundations of mathematics. This study began in the
late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and analysis. In the
early 20th century it was shaped by David Hilbert's program to prove the consistency of foundational theories.
Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified
the issues involved in proving consistency. Work in set theory showed that almost all ordinary mathematics
can be formalized in terms of sets, although there are some theorems that cannot be proven in common axiom
systems for set theory. Contemporary work in the foundations of mathematics often focuses on establishing
which parts of mathematics can be formalized in particular formal systems (as in reverse mathematics) rather
than trying to find theories in which all of mathematics can be developed.

Group Theory
In mathematics and abstract algebra, group theory studies the algebraic structures known as groups. The
concept of a group is central to abstract algebra: other well-known algebraic structures, such as rings, fields,
and vector spaces, can all be seen as groups endowed with additional operations and axioms. Groups recur
throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear
algebraic groups and Lie groups are two branches of group theory that have experienced advances and have
become subject areas in their own right.
Various physical systems, such as crystals and the hydrogen atom, may be modelled by symmetry groups.
Thus group theory and the closely related representation theory have many important applications
in physics, chemistry, and materials science. Group theory is also central to public key cryptography.The
early history of group theory dates from the 19th century. One of the most important mathematical
achievements of the 20th century was the collaborative effort, taking up more than 10,000 journal pages and
mostly published between 1960 and 1980, that culminated in a complete classification of finite simple groups.
Counting Theory
In daily lives, many a times one needs to find out the number of all possible outcomes for a series of events.
For instance, in how many ways can a panel of judges comprising of 6 men and 4 women be chosen from
among 50 men and 38 women? How many different 10 lettered PAN numbers can be generated such that the
first five letters are capital alphabets, the next four are digits and the last is again a capital letter. For solving
these problems, mathematical theory of counting are used. Counting mainly encompasses fundamental
counting rule, the permutation rule, and the combination rule.

5|Page
Probability
Probability is the branch of mathematics concerning numerical descriptions of how likely an event is to occur,
or how likely it is that a proposition is true. The probability of an event is a number between 0 and 1, where,
roughly speaking, 0 indicates impossibility of the event and 1 indicates certainty. The higher the probability of
an event, the more likely it is that the event will occur. A simple example is the tossing of a fair (unbiased)
coin. Since the coin is fair, the two outcomes ("heads" and "tails") are both equally probable; the probability
of "heads" equals the probability of "tails"; and since no other outcomes are possible, the probability of either
"heads" or "tails" is 1/2 (which could also be written as 0.5 or 50%).These concepts have been given
an axiomatic mathematical formalization in probability theory, which is used widely in areas of study such
as statistics, mathematics, science, finance, gambling, artificial intelligence, machine learning, computer
science, game theory, and philosophy to, for example, draw inferences about the expected frequency of
events. Probability theory is also used to describe the underlying mechanics and regularities of complex
systems.

Mathematical Induction and Recurrence Relations

Mathematical induction is a mathematical proof technique. It is essentially used to prove that a statement P(n)
holds for every natural number n = 0, 1, 2, 3, . . . ; that is, the overall statement is a sequence of infinitely
many cases P(0), P(1), P(2), P(3), . . . . Informal metaphors help to explain this technique, such as falling
dominoes or climbing a ladder.
Mathematical induction proves that we can climb as high as we like on a ladder, by
proving that we can climb onto the bottom rung (the basis) and that from each rung we can climb up to the
next one (the step).
-Concrete Mathematics
A recurrence relation is an equation that defines a sequence based on a rule that gives the next term as a
function of the previous term(s).The simplest form of a recurrence relation is the case where the next term
depends only on the immediately previous term. If we denote the nnth term in the sequence by xnxn, such a
recurrence relation is of the form

xn+1=f(xn)

Graph Theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model
pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points)
which are connected by edges (also called links or lines). A distinction is made between undirected graphs,
where edges link two vertices symmetrically, and directed graphs, where edges link two vertices
asymmetrically; see Graph (discrete mathematics) for more detailed definitions and for other variations in the
types of graph that are commonly considered. Graphs are one of the prime objects of study in discrete
mathematics.

Boolean Algebra

6|Page
In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of
the variables are the truth values true and false, usually denoted 1 and 0, respectively. Instead of elementary
algebra, where the values of the variables are numbers and the prime operations are addition and
multiplication, the main operations of Boolean algebra are the conjunction (and) denoted as ∧,
the disjunction (or) denoted as ∨, and the negation (not) denoted as ¬. It is thus a formalism for
describing logical operations, in the same way that elementary algebra describes numerical operations.
Boolean algebra was introduced by George Boole in his first book The Mathematical Analysis of
Logic (1847), and set forth more fully in his An Investigation of the Laws of Thought (1854). According
to Huntington, the term "Boolean algebra" was first suggested by Sheffer in 1913, although Charles Sanders
Peirce gave the title "A Boolean Algebra with One ConsCant" to the first chapter of his "The Simplest
Mathematics" in 1880. Boolean algebra has been fundamental in the development of digital electronics, and is
provided for in all modern programming languages. It is also used in set theory and statistics.

Applications of Discrete Mathematics in

7|Page
 different fields of Science
It's often said that mathematics is useful in solving a very wide variety of
practical problems. Focus on discrete mathematics, which, broadly conceived,
underpins about half of pure mathematics and of operations research as well as
all of computer science. As time goes on, more and more mathematics that is
done, both in academia and in industry, is discrete. But what are the actual
applications people talk about when they say discrete mathematics can be
applied? What problems are being solved? This project attempts to address
those questions. There are short descriptions, of examples of discrete
mathematics as applied to our everyday lives and as used in important and
interesting research and corporate applications.

Discrete Mathematics is broadly useful in different trades of science. Those are

discussed shortly below-

 Everyday applications in technical fields

 Research and corporate applications
 Others

Everyday applications in technical fields

8|Page
 1. Computers: Computers Run software and store files. The software and files are both stored as
huge strings of 1s and 0s. Binary math is discrete mathematics.

2. Networks: Networks are, at base, discrete structures. The routers that run the internet are
connected by long cables. People are connected to each other by social media ("following" on
Twitter, "friending" on Facebook, etc.). The US highway system connects cities with roads.

3. Scheduling problems: Problems like deciding which nurses should work which shifts, or
which airline pilots should be flying which routes, or scheduling rooms for an event, or deciding
timeslots for committee meetings, or which chemicals can be stored in which parts of a
warehouse---are solved either using graph coloring or using combinatorial optimization, both
parts of discrete mathematics. One example is scheduling games for a professional sports league.

4. Machine Job Scheduling: Scheduling tasks to be completed by a single machine uses graph

theory. Scheduling tasks to be completed by a set of machines is a bin-packing problem, which is
part of discrete optimization. Google describes the issue for multiple types of jobs on multiple
machines.

5. Railway planning:   deciding how to expand train rail lines, train timetable scheduling, and
scheduling crews and equipment for train trips use both graph theory and linear algebra.

6. Computer graphics:  such as in video games we use linear algebra in order to transform
(move, scale, change perspective) objects. That's true for both applications like game
development, and for operating systems.

7. Voting systems: There are different methods for voting---not just the common cast-a-ballot-
for-exactly-one-candidate method. The study of possible voting methods and how well their
outcomes reflect the intent of the voters uses discrete mathematics.

9|Page
 8. Cell phone communications: Making efficient use of the broadcast spectrum for mobile
phones uses linear algebra and information theory. Assigning frequencies so that there is no
interference with nearby phones can use graph theory or can use discrete optimization.

9. Delivery Route Problems: If you need to leave home, visit a sequence of locations each
exactly once and then return home---such as might happen with a newspaper delivery route
or scheduling bread to be delivered from a bakery to grocery stores---this is known as
the travelling salesperson problem, or TSP. There is a definitive source on the history of, and
state-of-the-art work on TSP.

Research and corporate applications

1. Logistics: deals with managing inventory and supply chains, as well as transporting goods and
people to where and when they are needed. Many of the problems involved use discrete
optimization.

2. Cybersecurity: Graph theory is used in cybersecurity to identify hacked or criminal servers and

generally for network security.

10 | P a g e
 3. Archaeology: Archaeological softwares uses discrete math to construct 3D images from scans
of archaeological sites.

4. Voting: Determining voting districts, a process known as redistricting, is rife with problems and
influenced by politics. Many researchers in various fields work on methods for fair redistricting,
and some use lots of discrete math.

5. Epidemic prediction: The spread of infectious disease is affected by personal contacts and by
behaviors influenced by information. One model of epidemics uses graph theory by
encodingpersonal contacts and behaviors as layers in a large network.

6. Crystal structure model: We can model a crystal structure based on a set of electron

microscope images using discrete tomography. Linear programming can be used in discrete
tomography. Discrete tomography can also be used in medical imaging, to reconstruct an image
of an organ from just a few x-ray images.

7. Chemistry: Balancing chemical equations uses linear algebra, and understanding molecular

structure uses graph theory.

11 | P a g e
 8. Ranking producing: Many ways of producing rankings use both linear algebra and graph
theory. Specific examples include ranking relevance of search results using Google, ranking
teams for tournaments or chicken pecking orders, and ranking sports team performances or
restaurant preferences that include apparent paradoxen.

Other Important Applications

 Design of radar and sonar systems uses graph theory via Golomb rulers.
 Graph theory is used in neuroscience to study brain network organization (see abstract
here) and understand neuropathology for nervous system disorders.
 Understanding the spread of information through a social network---which includes trying
to make items go viral---uses graph theory.
 Linear algebra and graph theory are used in clustering analysis on geosocial data to locate
gangs and insurgencies.
 Changing patterns in lizard skin are described by discrete cellular automata.
 Graph theory is used in DNA sequencing.
 We can straighten an image taken by a misaligned camera using linear algebra.

Conclusion
As far as we have seen, Discrete Mathematics has huge applications in our
daily life. In everyday life starting from technology to research and corporate
world Discrete Mathematics has a huge role to play. As time goes on, more
and more mathematics that is done, both in academia and in industry, is
discrete. So, we can conclude that Discrete mathematics is an integral part of
our day to day life.

12 | P a g e
13 | P a g e