• Aucun résultat trouvé

1. Prime numbers

N/A
N/A
Protected

Academic year: 2022

Partager "1. Prime numbers"

Copied!
2
0
0

Texte intégral

(1)

DNL 2

de

Maths / English P RIME N UMBERS Worksheet # 2-0a-6

1. Prime numbers

Definition: The factors (or divisors) of any whole number are the numbers that divide exactly into the given number.

Example: 4 is a factor of 12 because 4 divides into 12. The other factors are 1; 2; 3; 6 and 12.

1 is a factor of any natural number. Every number is a factor of itself.

Definition: A prime number is a whole number greater than 1 that has only two factors, 1 and itself.

The first fifteen prime numbers are 2; 3; 5; 7; 11; 13; 17; 19; 23; 29; 31; 37; 41; 43 and 47.

It is easy to find the first prime numbers with Eratosthenes’ sieve.

1 is not a prime number since it has only one factor, not two different ones.

2 is the first prime number, it is also the only even prime number: “2 is the oddest prime number”.

Composite numbers are numbers which have more than two factors, such as 6; 10 or 77.

The prime factorisation (US : factorization) of a whole number is the representation of that number as a product of factors which are all prime numbers. It is possible to find the prime factors of any given number by successively dividing the number by the prime numbers in increasing order. Start with the smallest number that divides exactly, repeat as many times as necessary with the same prime number, then try the next prime number in the same way, and stop when you are left with 1.

Exercise 1 : write down the following numbers as the product of their prime factors.

Then find all their different factors.

a) 24 b) 60 c) 108 d) 126 e) 70 f) 100 g) 65536

Vocabulary: composite numbers – to divide into a number – divisor – factor – prime factorisation – prime number – (Eratosthenes’) sieve

2014/15 - 2

de

- Worksheet #2-0a-6 P

RIME

N

UMBERS

page 1/2

(2)

2. Highest common factor and lowest common multiple

Definition: The highest common factor (HCF) of two or more numbers is the largest factor that is common to each of the given numbers.

In other words, the HCF is the largest number that will divide exactly into each of the numbers.

Whenever you __________ ______ a fraction to its __________ _______, you divide both the _____________ and the _______________ by their __________ _________ _________.

In order to get the HCF of 2 numbers, you can use Euclid’s algorithm.

In order to get the HCF of 2 or more numbers, you can express each of the numbers as the product of its prime factors, take all the factors that are common and multiply them together.

Definition: The least common multiple (LCM) of two or more numbers is the smallest multiple that is common to each of the given numbers.

In other words, the LCM is the smallest number into which each of the numbers divides exactly.

Whenever you add or subtract fractions, the most convenient common denominator is the LCM.

The product of any 2 numbers is always equal to the product of their HCF and their LCM.

Exercise 2 : find the highest common factor in each of the following:

a) 6 and 10 b) 16 and 36 c) 24 and 40 d) 14 and 35

e) 18 and 63 f) 11 ; 55 and 99 g) 27 ; 36 and 63 h) 45 ; 75 and 105

Exercise 3 : find the lowest common multiple in each of the following:

a) 6 and 10 b) 16 and 36 c) 24 and 40 d) 14 and 35

e) 18 and 63 f) 11 ; 55 and 99 g) 27 ; 36 and 63 h) 45 ; 75 and 105

Exercise 4 :

Prove that the HCF of any two positive integers always divides into their LCM.

Vocabulary: (Euclid’s) algorithm – HCF – highest common factor – LCM – least common multiple

2014/15 - 2

de

- Worksheet #2-0a-6 P

RIME

N

UMBERS

page 2/2

Références

Documents relatifs

In this paper, we focus on the counting function n(g, 2) of two-generator numerical semigroups of genus g, which is known to also count certain special factorizations of 2g.. Yet

By contrast, the PRIMEINC algorithm studied by Brandt and Damg˚ard [4] (basically, pick a random number and increase it until a prime is found) only consumes roughly as many random

If Green and Tao can indeed prove the extended prime k-tuplets conjecture for any admissible k-tuple of linear forms that does not contain a difficult pair, then this will be an

They as- sume first that the Generalized Riemann Hypothesis holds (in other words, marvellous formulas analogous to (3) can be used to count primes of the form qn + a up to x),

Throughout this paper, we shall use the following notations: N denotes the set of the positive integers, π( x ) denotes the number of the prime numbers not exceeding x, and p i

We define a partition of the set of integers k in the range [1, m−1] prime to m into two or three subsets, where one subset consists of those integers k which are < m/2,

We present the formalization of Dirichlet’s theorem on the infinitude of primes in arithmetic progressions, and Selberg’s elementary proof of the prime number theorem, which

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des