MATHEMATICAL INDUCTION TO COMPUTER AND SYSTEMS ENGINEERING

Introduction
Discrete Mathematics is fundamental for computer science and it is valid to recognize that much
of the development of modern computing has its bases in the concepts that are studied in this
branch of the science of mathematics.
Mathematics is the basis of everything in this world, from the moment you are born you are
entering the mathematical world, in a certain way our universe is mathematical, that is, the
importance of mathematics in engineering is necessary, an engineer needs the ability to reason
and resolve complexities in the work area in which they operate.
When certain propositions, formulas, relations, theorems or algorithms hold for all positive
integers, their validity is demonstrated using the Principle of Mathematical Induction.
Central Theme
Mathematics is very important for the systems engineering career, the engineer must study
mathematics. There is no other way to adequately train analytical thinking, the development of
logic, demonstrative rigor, the sense of accuracy and acceptable approximation, numerical
objectivity, the propensity for measurement, and so many other qualities of good engineers.
There are several branches in this science of mathematics, and engineering curriculum designers
have real problems deciding what will and will not be included in the degree.
Differential and integral calculus is considered basic in engineering. But there are few engineers
who spend all day making derivatives and solving integrals in their work.
It is very interesting to know that those who develop the technical areas of engineering the most
during their professional life, or those who seek more advanced specializations or doctoral
studies, are precisely those who require calculus as an everyday tool.
Therefore, it is very important to highlight that those who aspire to the ideal of the technical
engineer, focused on solving the most difficult engineering problems, are also those who use
mathematical tools the most.
Relational databases play a role in almost every organization that must keep track of employees,
customers, or resources. A relational database connects the features of a given piece of
information. For example, in a database containing customer information, the relational aspect of
this database allows the computer system to know how to link the customer's name, address,
telephone number, and other pertinent information. All of this is done through the concept of
discrete set mathematics.
Logistics is the study of the organization of the flow of information, goods and services. Without
discrete mathematics, logistics would not exist. This is because logistics makes extensive use of
graphs and graph theory, a subfield of discrete mathematics.
Graph theory allows complex logistical problems to be simplified into graphs consisting of nodes
and lines. A mathematician can analyze these graphs according to the methods of graph theory to
determine the best routes for transportation or the solution of other logistical problems.
Algorithms
Algorithms are the rules by which a computer operates. These rules are created through the laws
of discrete mathematics. A computer programmer uses discrete mathematics to design efficient
algorithms. This design includes the application of discrete mathematics to determine the number
of steps an algorithm needs to complete, which implies the speed of the algorithm. Due to
applications of discrete mathematics in algorithms, today's computers run faster than ever.
Algorithm design is a mental activity carried out by professionals from different areas,
particularly mathematicians and engineers. It is considered one of the most difficult intellectual
activities, particularly when it has to be demonstrated that the algorithm is efficient and correct.
The necessary and sufficient tool to verify the certainty of an algorithm is the Principle of
Mathematical Induction. The algorithm is the fundamental raw material for the engineer and
especially for the systems engineer; With them programs are built and with programs complex
software applicable to all fields of human activity is built. The construction of an algorithm given
in the form of pseudocode is shown and, supported by the Principle of Mathematical Induction,
we carry out its verification.
Importance of discrete mathematics:

1. Introduce the student to logical reasoning and combinatorial reasoning techniques, and in
general, discrete methods.
2. Topics such as algorithms, mathematical induction, residual arithmetic, and number
systems are included.
3. A mathematical treatment of what a Boolean algebra is is made, based on the concept of
order relationship.
 4. The concept of graphs and finite time machines is introduced, emphasizing modeling and
applications.
5. Finally, issues of signal discretization are discussed, emphasizing the concept of
convolution summation, homogeneous and non-homogeneous difference equations. It
ends with the study of the Z transform.
6. A wide variety of applications are included, which seek to develop the student's
mathematical maturity through the study of an area so different from calculus.

Example of the use of mathematical induction in our professional school:

PROBLEM: Create an algorithm to find the sum of odd natural numbers.

ANALYSIS:
 Understand the problem
INPUT/Data OUTPUT/Result
2n-1 R
1 1
1+3 4
1+3+5 9
1+3+5+7 16
. .
. .
. .
1+3+5+7+…+(2n-1) ?

2n-1>0 R>0
 Model/Formula/Algorithm

1=1 ,1= [2(1)-1] a 1 1=12

1+3=4 ,3= [2(2)-1] a 2 4=22
1+3+5=9 ,5= [2(3)-1] a 3 9=32
1+3+5+7=16 ,7= [2(4)-1] a 4 16=4 2
…
a 1+ a 2 + a 3 + a 4 +…+a n = n2
[2(1)-1] + [2(2)-1] + [2(3)-1] +…+ [2( n )-1]=n2 , [2(n)-1] = a n

 Variables Dictionary
 Input Variable
n: Integer type
  Output Variable
2
n : Integer type
 Auxiliary Variables
a 1 ,a 2 ,a 3 ,a 4 ,…,a n : Integer type

 Pre/Post condition
Precondition:
n>0
Post condition
2
n >0

DESIGN:
 Algorithm in pseudocode
Start
#Dec. Of variables
VE: n: integer type
VS:n2 : integer type
GOES:a 1 ,a 2 ,a 3 ,a 4 ,…,a n : integer type
# INPUT enter number
#Precondition n > 0
∑of the n odd= Enter ( ) #∑of the n odd=int(input())
#PROCESS ∑of the odd n
1+3+5+7+…+ [2(n)-1]= n2
#OUTPUT display ∑of the odd “n”
#Postconditionn2 >0
PRINT n2
 check
P(n)=1+3+5+7+…+ [2(n)-]= n2
1) P(1) = 1 →P(1)=12 =1
2) P(n)=1+3+5+7+…+ [2(n)-1]= n2
3) P(n+1)= 1+3+5+7+…+ [2(n)-1] + [2(n)+1] =(n+1)2 Possible hypothesis

n + [2(n)+1]
2

n + 2(n) + 1
2

2
(n+1)

Conclusion
In summary, the use of mathematical induction, part of discrete mathematics, is very important
in our professional school since with it the different algorithms can be verified so that their
validity is certain. On the other hand, there is no other way to adequately train analytical
thinking, the development of logic, demonstrative rigor, the sense of accuracy and acceptable
approximation, numerical objectivity, the propensity for measurement, and so many others.
qualities of good engineers who develop this discrete mathematics; and the improvement of this
mathematics will mean that when creating an algorithm, we can verify it using it (mathematical
induction).
Bibliography

Grassmann, W. K. (1997). Matemática discreta y lógica. Prentice-Hall.

Padilla Gil, L., & Dóvila Escobar, J. (2007). T{ecnicas de demostración. Ingenio Libre Editorial.
Sierra, L. (2012). Algoritmos e Inducción.
Sominski, I. S. (2002). El método de la inducción matemática. Noriega Editores.