Scribd
Upload
8 views10 pages

3-Introduction To NT, Modu. Arith & Congruence-09!01!2024

This document provides an introduction to number theory and the division algorithm. It discusses how number theory is used in cryptography and its goal of discovering relationships between numbers. It then explains divisibility, providing examples, and defines the division algorithm using the notation a = qn + r, where a is divided by n to get the quotient q and remainder r. It provides examples of applying the division algorithm to positive and negative numbers.

Uploaded by

sankarperuri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
8 views10 pages

3-Introduction To NT, Modu. Arith & Congruence-09!01!2024

This document provides an introduction to number theory and the division algorithm. It discusses how number theory is used in cryptography and its goal of discovering relationships between numbers. It then explains divisibility, providing examples, and defines the division algorithm using the notation a = qn + r, where a is divided by n to get the quotient q and remainder r. It provides examples of applying the division algorithm to positive and negative numbers.

Uploaded by

sankarperuri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

Module 1

Fundamentals of Number Theory


Topic 1
Introduction to Number Theory
Introduction to Number Theory
• Number theory is pervasive in cryptographic algorithms.
• The main goal of number theory is to discover interesting and
unexpected relationships between different sorts of numbers
and to prove that these relationships are true.
How is number theory used in real life?
• The most important application of number theory is that it is
the key foundation of cryptography.
• Our strong encryption algorithms and systems have
developed because of the impetus provided by number
theory.
DIVISIBILITY AND THE DIVISION ALGORITHM
Divisibility
• We say that a nonzero b divides a if a = mb for some m, where
a, b, and m are integers.
• That is, b divides a if there is no remainder on division. The
notation b│a is commonly used to mean b divides a.
• Also, if b│a, we say that b is a divisor of a.
Cont…
• Example,
• The positive divisors of 24 are 1, 2, 3, 4, 6, 8, 12, and 24.
• Subsequently, we will need some simple properties of
divisibility for integers, which are as follows:

a = 11, b = 66, c = 198


11 | 66 = 6 X 11 = 66, R = 0
66 | 198 = 3 X 66 = 198, R=0
So, 11|198=18X11=198, R=0
Division Algorithm
• Given any positive integer n and any nonnegative integer a, if
we divide a by n, we get an integer quotient q and an integer
remainder r that obey the following relationship:
• a = qn + r 0 ≤ r < n; q = [a/n]
• For ex, a = 15, n = 5,
• 15 = q (5) + r
• 15= 3 x 5 + 0
So, 5│15, q = 3, r = 0
• Another example, a = 29, n = 3,
• 29 = q (3) + r
• 29 = 9 X 3 + 2
So, 3│29, q = 9, r = 2
• Both examples satisfies the condition
Cont…
Example:
• qn ≤ a and (q+1)n > a

• a = qn + r a = qn + r
• 7 (n) | 11 (a) = q = 1, r = 4 7 (n) | -11 (a) = q = -2, r = 3
• 11 = 1 X 7 + 4 -11 = (-2) X 7 + 3
• 7 ≤ 11 14>11
• When we have negative a value, q will be added one more value
in the procedure of positive a value
Exercise:
1. a = 123 and n = 9, q & r?
2. a = -123 and n = 9, q & r?
3. a = 36 and n = 5, q & n?
4. a = -36 and n = 5, q & n?
Answers
1. q = 13 & r = 6
2. q = -14 & r = 3
3. q=7&r=1
4. q = -8 & r = 4

You might also like