33% found this document useful (3 votes)
8K views

Math Project

The document discusses prime numbers, composite numbers, and divisibility rules. It defines prime numbers as whole numbers greater than 1 that are only divisible by 1 and itself. Composite numbers are numbers greater than 1 with more than two factors. It then provides properties of prime numbers and examples of divisibility rules for numbers like 2, 3, 4, 5, 6, 8, 9, and 10 to determine if a number is divisible without long division. The document traces the history of work on prime numbers back to ancient Greek mathematicians like Eratosthenes.

Uploaded by

Ashvika JM
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33% found this document useful (3 votes)
8K views

Math Project

The document discusses prime numbers, composite numbers, and divisibility rules. It defines prime numbers as whole numbers greater than 1 that are only divisible by 1 and itself. Composite numbers are numbers greater than 1 with more than two factors. It then provides properties of prime numbers and examples of divisibility rules for numbers like 2, 3, 4, 5, 6, 8, 9, and 10 to determine if a number is divisible without long division. The document traces the history of work on prime numbers back to ancient Greek mathematicians like Eratosthenes.

Uploaded by

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

2

Prime numbers and


divisibility rules
-
J.M.ASHVIKA
XI D
Index
i. PRIME NUMBERS
ii. COMPOSITE NUMBERS 2

iii. Properties of Prime Numbers


iv. Prime Numbers vs Composite Numbers
v. Co-primes
vi. Examples of co-prime numbers
vii. Why is 1 not a Prime Number?
viii. Is There a Pattern in Prime Numbers?
ix. History of Prime Numbers
x. Who discovered prime numbers?
xi. Real life applications of prime numbers
xii. Prime numbers in nature
xiii. Divisible
xiv. Divisible rule
xv. History of Divisible rule
xvi. Why do we have divisibility rules?
xvii. who came up with the divisibility rules?
xviii. Square Number
xix.
2
PRIME NUMBERS:
A prime number is a whole number greater
than 1 whose only factors are 1 and itself. A
factor is a whole number that can be divided 2

evenly into another number. The first few


prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23
and 29.

COMPOSITE NUMBERS:
Numbers that have more than two factors are
called composite numbers. The number 1 is
neither prime nor composite.
Properties of Prime Numbers:
Some of the important properties of prime
numbers are given below:
2
 A prime number is a whole number

greater than 1.
 It has exactly two factors, that is, 1 and

the number itself.


 There is only one even prime number,

that is, 2.
 Any two prime numbers are always co-

prime to each other.


 Every number can be expressed as the

product of prime numbers.


2

Prime Numbers vs Composite Numbers

Prime numbers Composite numbers


Numbers, greater than Numbers greater than
1, having only two 1 having at least three
factors, 1 and the factors
number itself
2 is the smallest and 4 is the smallest
the only even prime composite number
number
Examples of prime Examples of
numbers are 2, 3, 5, 7, composite numbers
11, 13, etc are 4, 6, 8, 9, 10, etc

Co-primes:
2

Co-prime numbers are always considered in


pairs, while a single number can be interpreted
as a prime number. If a pair of numbers has no
common factor apart from 1, then the numbers
are called co-prime numbers. Co-prime
numbers can be prime or composite, the only
criteria to be met is that the GCF of co-prime
numbers is always 1.

Examples of co-prime numbers:


 5 and 9 are co-primes.

 6 and 11 are co-primes.

 18 and 35 are co-primes.

Co-prime numbers need not necessarily be


prime numbers.

Why is 1 not a Prime Number?


The number 1 has only 1 factor. For a number
to be classified as a prime number, it should
have exactly two factors. Since 1 has less than
two factors, it is not a prime number. 2

Is There a Pattern in Prime Numbers?


The set of prime numbers between any two
numbers can be found by following a pattern.
The following figure shows a few prime
numbers encircled and striking off all the
numbers divisible by these prime numbers.
You can follow this pattern until you reach
the square root of the larger number, that is,
100
2

History of Prime Numbers


Prime numbers created human curiosity since
ancient times. Even today, mathematicians are
trying to find prime numbers with mystical
properties. Euclid proposed the theorem on
prime numbers - There are infinitely many
prime numbers. Eratosthenes was one of the
greatest scientists, who lived a few decades
after Euclid, designed a smart way to
determine all the prime numbers up to a given
number. This method is called the Sieve of
Eratosthenes.
Who discovered prime numbers ?
The prime number was discovered by
Eratosthenes (275-194 B.C., Greece). He took 2

the example of a sieve to filter out the prime


numbers from a list of natural numbers and
drain out the composite numbers.

Real life applications of prime numbers:


There are dozens of important uses for prime
numbers. Cicadas time their life cycles by
them, modern screens use them to define color
intensities of pixels, and manufacturers use
them to get rid of harmonics in their products.
However, these uses pale in comparison to the
fact that they make up the very basis of
modern computational security.
Whatever your thoughts are on prime
numbers, you use them every single day and
they make up an absolutely vital part of our
society. All this because they are an
irreducible part of the very fabric of the
universe.
Prime numbers in nature:
One of the amazing things about mathematics
is how its presence can be felt in nature. You
2

find it in the structure of a beehive, in the


scales of a pineapple, or even the petals of a
rose. Prime numbers can be seen in the scales
of a pineapple
Prime numbers also have an amazing presence
in nature. According to scientific research, it
was found that the cicada insects use prime
numbers to come out of their burrows and lay
eggs. Cicadas only leave their burrows in
intervals of 7, 13 or 17 years. It has been
theorized that they use prime numbers so that
predators cannot evolve accordingly and prey
on them. In other words, these insects use
prime numbers to ensure their survival. 

Divisible:
A prime number is
a whole number greater than 1 that
is exactly divisible by itself and 1 but no
other number.

Divisible rule: 2

A divisibility rule is a kind of shortcut that


helps us to identify if a given integer is
divisible by a divisor by examining its digits,
without performing the
whole division process. 
History of Divisible rule:
The earliest known divisibility test we have
found comes from the Babylonian Talmud.  It
was used to calculate the given year within a
Sabbatical Cycle, that is, it provides the
remainder obtained upon dividing an integer

Why do we have divisibility rules?


Divisibility rules of whole numbers are very
useful because they help us to quickly
determine if a number can be divided by 2, 3,
4, 5, 9, and 10 without doing long division.
This is especially useful when the numbers are
large.
who came up with the divisibility rules?
Although there are divisibility tests for
numbers in any radix, or base, and they are all 2

different, this article presents rules and


examples only for decimal, or base 10,
numbers. Martin Gardner explained and
popularized these rules in his September 1962
"Mathematical Games" column in Scientific
American.

Square Number
When an integer is multiplied by the same
integer, the resultant number is known as a
square number.
For example, when we multiply 5 × 5 = 52, we
get 25. Here, 25 is a square number.
2

Divisibility rules:

2
if the last digit is even (0, 2, 4, 6, or 8)
Example: 123,456 is divisible by 2, because
the last digit, 6, is even.
3
if the sum of its digits is divisible by 3
2

Example: 123,456 is divisible by 3, because 1


+ 2 + 3 + 4 + 5 + 6 = 21, which is divisible by
3. (21 ÷ 3 = 7)

4
if the number formed by the two last digits is
divisible by 4
Example: 123,456 is divisible by 4, because
56 is divisible by 4. (56 ÷ 4 = 14)

5
if it ends in 5 or 0
Examples: 123,456 is not divisible by 5,
because the last digit, 6, is not 0 or 5.
12,345 is divisible by 5, because the last digit
is 5.

6
if it is divisible by both 2 and 3
Example: 123,456 is divisible by 6, since it is
divisible by both 2 and 3.
2

7
if the number formed after the following two
steps is divisible by 7:
 First, remove the last digit
 Then, from the number remaining, subtract
two times the digit we just removed

8
if the number formed by the last three digits is
divisible by 8
Example: 123,456 is divisible by 8, because
456 is divisible by 8. (456 ÷ 8 = 57)

9
if the sum of its digits is divisible by 9
Examples: 123,456 is not divisible by 9, since
1 + 2 + 3 + 4 + 5 + 6 = 21 is not divisible by 9.
123,453 is divisible by 9, since 1 + 2 + 3 + 4 +
5 + 3 = 18 is divisible by 9. (18 ÷ 9 = 2)

10 2

if it ends in 0
Examples: 123,456 is not divisible by 10,
since its last digit, 6, is not 0. 123,450 is
divisible by 10, since its last digit is 0.

11
for two-digit numbers, if it is double
Examples: 11, 22, 33, 44, 55, 66, 77, 88, and
99 are each divisible by 11.
for larger numbers, if the number formed after
the following three steps is divisible by 11:
 find the sum of alternate digits
 find the sum of the remaining digits
 find the difference of these two sums

12
if it is divisible by both 3 and 4.
Example: 123,456 is divisible by 12, since it is
divisible by both 3 and 4.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy