Discrete mathematics

Introduction to discrete mathematics pdf:

Discrete mathematics is a part of the 3 main topics

Math logic

Boolean algebra

Graph theory

The logic of mathematics discrete mathematics pdf

Find the logic that is used in mathematics is called deductive logic. Mathematical arguments should be strictly deductive in nature. In other words the truth statement must be shown to be created yourself the truth about some of the other statements.

For example, in geometry, we withdraw the statement statement that he is the sum of three angles of a triangle is 180 degrees from the operator that the exterior angle of a triangle is equal to the sum of the other (i.e., opposite) two angles of triangles of a triangle.

That kind of logic we will use here bi digit i.e. every application will have only two options, either "True" or "False", but not both.

Definition:-the symbols that are used for submitting applications are called application letters or sentence variables.

Submit statements usually the letters P, Q, R, ..., p, q, r, ... and so on, are used

discrete mathematics pdf Boolean algebra

Boolean algebra was introduced first, British mathematician George Boole (1813-1865) the original objective of filling this algebra simplify logical statements and logic problems. In the case of Boolean algebra, there are basically three operations (i) and (ii) or (iii) that are not ' ^^ ', "vv" and (~). In this chapter, we will use the +,. , ' in place of the previous operations, respectively.

Definition: let B be a non-empty set with two binary operations + and a unary operation, ' and the two separate elements 0 and 1. Then B +. , ' is called Boolean algebra, if the following axioms are satisfied.

Theory of discrete mathematics graphs pdf

Graphics appear in many branches of mathematics, the physical, social, computer sciences and many other fields. Graph theory can be applied to solve practical problems in electrical network analysis, circuit design, operations research, etc.

In the chart we always mean line, because there is no such thing as a non-linear graph. Thus in our discussion we should drop the adjective "linear" and just say "graphics"

Definition:-graph G = (V, E) consists of a set of objects, V = (v1, v2, ...), whose elements are called vertices (or points or nodes) and another set E = {e1, e2, ...}, whose elements are called edges (or lines or subsidiaries), such that each ek is unordered pairs of vertices (vi, vj). Vertices vi and vj, the edge said an end to the tops ekare EK.