Topicm2c688c363b40d794_1528449000663_0Topic

Divisibility of natural numbersnatural numbersnatural numbers

Levelm2c688c363b40d794_1528449084556_0Level

Third

Core curriculumm2c688c363b40d794_1528449076687_0Core curriculum

I. Real numbers. The student:

1) performs mathematical operations (addition, subtraction, multiplication, division, exponentiation, square root, logarithms) in a set of real numbers;

2) proves simple theorems regarding the divisibility of integers and remainders of division not more difficult than:

a) the proof of divisibility of products of four consecutive natural numbersnatural numbersnatural numbers by 24;

b) the proof of property: if the number divided by 5 gives the remainder of 3, then its third power when divided by 5 gives the remainder of 2.

Timingm2c688c363b40d794_1528449068082_0Timing

45 minutes

General objectivem2c688c363b40d794_1528449523725_0General objective

Performing calculations on real numbers, also using a calculator, applying the rules of mathematical operations in transforming algebraic expressions and using these skills to solve problems in real and theoretical contexts.

Specific objectivesm2c688c363b40d794_1528449552113_0Specific objectives

1. Communicating in English, developing mathematical, scientific, technical and IT competences, developing learning skills.

2. Developing accounting efficiency in the field of performing operations on natural numbersnatural numbersnatural numbers.

3. Consolidation and systematization of knowledge on divisibility in the set of natural numbersnatural numbersnatural numbers.

Learning outcomesm2c688c363b40d794_1528450430307_0Learning outcomes

The studnet:

- performs operations in a set of natural numbersnatural numbersnatural numbers,

- uses the theory of divisibility to solve arithmetic problems.

Methodsm2c688c363b40d794_1528449534267_0Methods

1. Mind map.

2. Case study.

Forms of workm2c688c363b40d794_1528449514617_0Forms of work

1. Individual work.

2. Group work.

Lesson stages

Introductionm2c688c363b40d794_1528450127855_0Introduction

Students working in small groups create mind maps containing the most important information about natural numbersnatural numbersnatural numbers.

After finishing the task, the groups present their work and place the results on the display board.

Procedurem2c688c363b40d794_1528446435040_0Procedure

Task
Students work in groups. They recall the most important divisibility rules of numbers. Division:
By 2 – The number is divisible by 2 if the digit of unity is 0, 2, 4, 6, 8.
By 3 – The number is divisible by 3 if the sum of its digits is a number divisible by 3.
By 4 – The number is divisible by 4 if it contains two last digits divisible by four or whose two last digits are zeros.
By 5 – The number is divisible by 5 if the last digit of this number is 0 or 5.
By 6 – The number is divisible by 6 if it is divisible simultaneously by 2 and by 3.
By 9 – The number is divisible by 9 if the sum of its digits is divisible by 9.
By 10 – The number is divisible by 10 if the last digit of this number is 0.
By 25 – The number is divisible by 25 if its last two digits are divisible by 25 or the last two digits are zeros.
By 100 – The number is divisible by 100 if its last two digits are zeros.

They wonder how, by not doing the division, one can check whether the number is divisible by 12, by 15 or by 18. They make the hypotheses and check them by solving problems.

Task
The place of hundreds has been denoted as X in the number 57992X48. Enter a number in place of X, so that the number received is divisible by 12. Provide all the possible solutions.

Task
Students work individually using computers. Their task is to observe the calculation of LCM and GCD of two numbers. Then do analogous calculation of LCM and GCD of numbers 324, 243, 289.

[Slideshow]

The teacher initiates a discussion about the relationship between the product of two numbers, their least common multiplethe Least Common Multiple (LCM)least common multiple and the greatest common divisorthe Greatest Common Divisor (GCD)greatest common divisor.

The conclusions are expressed in the following formula:

LCM(a,b)=abGCD(a,b)

where:
a and b - are positive natural numbersnatural numbersnatural numbers.

Task
Students use the formula to find two natural numbersnatural numbersnatural numbers, whose product is 9666, and their greatest common divisorthe Greatest Common Divisor (GCD)greatest common divisor is equal to 27.

An extra task:
a) The number 408 is divisible by 17. Evaluate which of the numbers: K, L, M, N is also divisible by 17:
K = 408 + 17 · 24,
L = 12 · 408 - 17 · 15,
M = 3 · 408 + 289 · 7,
N = 4080 + 17 · 135.
b) Find the smallest natural number that is divisible by 2, 3 and 7, and whose remainder of dividing this number by 5 is 4.

Lesson summarym2c688c363b40d794_1528450119332_0Lesson summary

Students perform revision exercises.

Then they summarize the lesson together, formulating conclusions to remember.

- To check whether a given number is divisible by another, we use methods called divisibility rulesm2c688c363b40d794_1527752263647_0To check whether a given number is divisible by another, we use methods called divisibility rules.

- The prime factorization can be used to calculate their least common multiple and their greatest common divisor.m2c688c363b40d794_1527752256679_0The prime factorization can be used to calculate their least common multiple and their greatest common divisor.

- The relationship between the product of two numbers, their least common multiplethe Least Common Multiple (LCM)least common multiple of the greatest common divisorthe Greatest Common Divisor (GCD)greatest common divisor is expressed by the formula:

LCM(a,b)=abGCD(a,b)

where:
a and b - are positive natural numbersnatural numbersnatural numbers.

Selected words and expressions used in the lesson plan

composite numberscomposite numberscomposite numbers

divisorsdivisorsdivisors

natural numbersnatural numbersnatural numbers

prime numbersprime numbersprime numbers

relatively prime numbers (coprime numbers)relatively prime numbers (coprime numbers)relatively prime numbers (coprime numbers)

rules of divisibilityrules of divisibilityrules of divisibility

the Greatest Common Divisor (GCD)the Greatest Common Divisor (GCD)the Greatest Common Divisor (GCD)

the Least Common Multiple (LCM)the Least Common Multiple (LCM)the Least Common Multiple (LCM)

m2c688c363b40d794_1527752263647_0
m2c688c363b40d794_1527752256679_0
m2c688c363b40d794_1528449000663_0
m2c688c363b40d794_1528449084556_0
m2c688c363b40d794_1528449076687_0
m2c688c363b40d794_1528449068082_0
m2c688c363b40d794_1528449523725_0
m2c688c363b40d794_1528449552113_0
m2c688c363b40d794_1528450430307_0
m2c688c363b40d794_1528449534267_0
m2c688c363b40d794_1528449514617_0
m2c688c363b40d794_1528450127855_0
m2c688c363b40d794_1528446435040_0
m2c688c363b40d794_1528450119332_0
natural numbers1
natural numbers

liczby naturalne

R1H5Pxfl0qpSE1
wymowa w języku angielskim: natural numbers
the Least Common Multiple (LCM)1
the Least Common Multiple (LCM)

najmniejsza wspólna wielokrotność

RkXAIMP8z8kk81
wymowa w języku angielskim: the Least Common Multiple (LCM)
the Greatest Common Divisor (GCD)1
the Greatest Common Divisor (GCD)

największy wspólny dzielnik

RlmB1d6GbTuTU1
wymowa w języku angielskim: the Greatest Common Divisor (GCD)
composite numbers1
composite numbers

liczby złożone

R11ZkHPiCK40P1
wymowa w języku angielskim: composite numbers
divisors1
divisors

dzielniki liczb

R1d6mY7kOVzOj1
wymowa w języku angielskim: divisors
prime numbers1
prime numbers

liczby pierwsze

R15ZWO00EJYj11
wymowa w języku angielskim: prime numbers
relatively prime numbers (coprime numbers)1
relatively prime numbers (coprime numbers)

liczby względnie pierwsze

RzXLq1xgTm66k1
wymowa w języku angielskim: relatively prime numbers (coprime numbers)
rules of divisibility1
rules of divisibility

cechy podzielności liczb

RdE1AVSmpLZzH1
wymowa w języku angielskim: rules of divisibility