Mathematical reasoning that to nowadays represent more essential to say that verbal reasoning, plays a fundamental role in the development of our life and the progress of humanity. Such area as, social science, physics, management and computer science. But in computing, we need more of a particular branch of the mathematics so called: discrete mathematics. Discrete mathematics has become popular thanks to their applications in computer science. Notations and concepts of discrete mathematics are used to study problems in algorithmic and programming. Such method helps to think logically and mathematically. Information system along with Information Technology learning require to have a high understanding of Discrete math to build and putting project to a completion. So the process or ability of mastering such unique subject require a particular set of mathematical facts, this will let you know when and how to apply them to a project. Learning proof techniques and mathematical reasoning are the building block of understanding the real purpose of discrete maths.

From the historical point of view, computing has roots dating back to the mathematics of antiquity, through two main currents: algorithms, which systematizes the notion of computation and logic that formalizes the notion of demonstration. These two aspects are already strongly present in Greek science: Archimedes and Diophantus ‘calculate’ the area under a parabolic and solution of systems of equations in integers method, while Euclid has the notion of an axiomatic system for elementary geometry, and Aristotle of speech abstract propositional logic. It is piquant to note that these two fundamental currents still constitute the basis of modern computing.

Until the 19th century great mathematicians such as Newton, Leibniz, Euler or Gauss, invented original methods of numerical and symbolic computation. These methods were intended for a human calculator, but their systematic nature already foreshadows what will serve to lay the first foundations of computer science. In parallel, at the turn of the 20th century, the axiomatic current conquers many branches of mathematics, with for corollary of the methodological questions giving rise to a new discipline – mathematical logic. This current method of discrete math will be issues in particular a general theory of computability (Post, Turing, Kleene, and Church) and several theories of the demonstration (Gentzen, Herbrand, and Heyting). These listed theories are the second basis of computing: as soon as it will be necessary to formalize the notion of defining languages of programming specific to the unambiguous expression of algorithms, algorithm to verify the consistency of languages and programs, they will prove particularly valuable.

The discrete mathematics provides a rich and varied source of problems for exploration and communication. Discrete mathematics also helped to analyse and have several types of reasoning such as logical thinking (logic used in mathematics statements and arguments), relational thinking (solving a mathematical problem and describe the relationships), thinking quantitatively (element counting), analytical thinking (algorithms) and recursive thinking.

Although discrete maths is difficult to understand, it is a major skill to have when pursuing a career in computer science or mathematics, sciences, …

**...(download the rest of the essay above)**