NUMBER THEORY

APPLICATIONS
WHAT IS NUMBER THEORY? WHY
NUMBER THEORY IS IMPORTANT?
Number theory states that it is a branch of pure
mathematics devoted to the study of natural numbers
and integers. It is the study of the set of positive
whole numbers usually called the set of natural
numbers. This theory is experimental and
theoretical. Number theory, also known as 'higher
arithmetic', is one of the oldest branches of
mathematics and is used to study the properties of
positive integers.
Number theory helps to study the relationships
between different sorts of numbers. Natural
numbers are separated into a variety of times.
Here are some of the familiar and unfamiliar
examples with quick number theory introduction.
WHAT ARE THE DIFFERENT NUMBER
THEORY APPLICATIONS?
• Odd Numbers
• Odd numbers are those that are not divisible by the number 2. 

• Even Numbers
• Even numbers are integers that are divisible by the number 2.

• Square Numbers
• Numbers that are multiplied by themselves are called square numbers
or perfect square numbers.

• Cube Numbers
• Numbers that are multiplied by themselves 3 times are called cube
numbers
• Prime Numbers
• Prime numbers are numbers that have only 2 factors, 1 and the
number itself. 

• Composite Numbers
• Unlike prime numbers that have only 2 factors, composite numbers are
those that have more than 2 factors. In other words, composite
numbers can be divisible by more than two numbers. 

• Fibonacci Numbers
• A series of numbers where a number is the addition of the last two
numbers, starting with 0 and 1 is known as the Fibonacci sequence.
The numbers in this series or sequence are known as Fibonacci
numbers.
Applications of number theory allow the
development of mathematical algorithms that
can make information (data) unintelligible to
everyone except for intended users. In addition,
mathematical algorithms can provide real
physical security to data, allowing only
authorized users to delete or update data.
 WHAT ARE THE APPLICATONS OF PRIME
NUMBERS?

• Prime numbers are numbers that have only

2 factors, 1 and the number itself. 
• For example, 3 is a prime number because it
has only two factors, 1 and 3. In the same way,
2, 5, 7, 11 are prime numbers
DISCUSS BRIEFLY THE EARLY MODERN
NUMBER THEORIES:
Fermat's theorem, also known as Fermat's
little theorem and Fermat's primality test, in
number theory, the statement, first given in
1640 by French mathematician Pierre de
Fermat, that for any prime number p and any
integer a such that p does not divide a (the
pair are relatively prime), p divides exactly
into ap − a.
Euler's number is an important constant
that is found in many contexts and is the
base for natural logarithms. An irrational
number represented by the letter e, Euler's
number is 2.71828..., where the digits go on
forever in a series that never ends or
repeats (similar to pi).
Lagrange's theorem is a theorem that
states that for any finite group G, the order
of every subgroup of G divides the order of
G. The theorem is named after Joseph-
Louis Lagrange.
One of Legendre's theorems on the
Diophantine equation ax^2+by^2+cz^2=0
provides necessary and sufficient
conditions on the existence of nonzero
rational solutions of this equation, which
helps determine the existence of rational
points on a conic.
The Gauss–Markov theorem states that
in a linear homoskedastic regression
model, the minimum variance linear
unbiased estimator of the regression
coefficient is the least squares estimator.