Chapter 3: Arithmetic Functions and Special Numbers: Learning Outcomes
Chapter 3: Arithmetic Functions and Special Numbers: Learning Outcomes
Learning Outcomes
ARITHMETIC FUNCTIONS
Definition
Any function whose domain of definition is the set of positive integers is said to be a number-theoretic
(or arithmetic) function. Among the arithmetic functions, the easiest to handle and the most natural, are
the functions (read as “tau”) and (read as “sigma”).
Definition
Given a positive integer , let ( ) (read as “tau of n”) denote the number of positive divisors of n.
Example:
Find the number of positive divisors of the following positive integers, 1, 4, 5, 9, 12, and 13.
1. 1
The positive divisor of 1 is 1 itself, hence ( ) .
2. 4
The positive divisors of 4 are 1, 2 and 4 itself, hence ( ) .
Page 35
SEd Math 314 Number Theory
3. 5
The positive divisors of 5 are 1 and 5 itself, hence ( ) .
4. 9
The positive divisors of 9 are 1, 3, and 9 itself, hence ( ) .
5. 12
The positive divisors of 12 are, 1, 2, 3, 4, 6, and 12 itself, hence ( ) .
6. 13
The positive divisors of 13 are 1 and 13 itself, hence ( ) .
Learning Activity
What did you observe? Did you observe that if is a prime number, ( ) . Additionally, if is large,
finding the number of positive divisors by enumeration is tedious. Can you find an easier way to
determine the number of positive divisors of any positive integer ?
( ) ( )( ) ( )
Example:
Reconsider 150 and 733 and find the number of their positive divisors.
1. 150
150 can be written as
( ) ( )( )( ) ( )( )( )
2. 1402
1402 can be written as
( ) ( )( ) ( )( )
Page 36
SEd Math 314 Number Theory
Learning Activity
Applying Theorem 3.1, find the number of positive divisors ( ) of the following positive integers:
1. 68 _________________________________
2. 95 _________________________________
3. 175 _________________________________
4. 564 _________________________________
5. 1050 _________________________________
Definition
Given a positive integer , let ( ) (read as “sigma of n”) denote the sum of the positive divisors of n.
Example:
Find the sum of the positive divisors of the following positive integers, 1, 4, 5, 7, 10, 18.
1. 2
The positive divisor of 1 is 1 itself, hence ( ) .
2. 4
The positive divisors of 4 are 1, 2 and 4 itself, hence ( ) .
3. 5
The positive divisors of 5 are 1 and 5 itself, hence ( ) .
4. 7
The positive divisors of 7 are 1, and 7 itself, hence ( ) .
5. 10
The positive divisors of 10 are 1, 2, 5, and 10 itself, hence ( ) .
6. 18
The positive divisors of 18 are 1, 2, 3, 6, 9, and 18 itself, hence ( )
.
Learning Activity
1. 59 _________________________________
2. 64 _________________________________
3. 150 _________________________________
4. 733 _________________________________
5. 1408 _________________________________
Page 37
SEd Math 314 Number Theory
Study the examples given above. What did you observe if n is prime? Take note that ( ) if and
only if n is prime. Moreover, if is very large, enumerating the positive divisors and finding its sum is
time consuming. Can you find an easier way?
( )
Example:
Find the sum of the positive divisors of 12.
( ) ( )
Example:
( ) ( )( )
Learning Activity
1. 26 _________________________________
2. 34 _________________________________
3. 175 _________________________________
4. 220 _________________________________
5. 447 _________________________________
SPECIAL NUMBERS
Perfect Numbers
Definition. A positive integer is said to be perfect if is equal to the sum of all its positive divisors,
excluding itself.
Page 38
SEd Math 314 Number Theory
Recall that the sum of the positive divisors of an integer is ( ). Therefore, we can say that if is
perfect, then
( )
or equivalently,
( ) .
Example:
1. 6
( )
( )
or equivalently
( )
2. 12
( )
( )
Learning Activity
1. 1 _________________________________
2. 112 _________________________________
3. 496 _________________________________
4. 1045 _________________________________
5. 8128 _________________________________
Example:
Page 39
SEd Math 314 Number Theory
Determine which of the following integers are abundant and deficient numbers:
1. 8
The positive divisors of 8 are 1, 2, 4, and 8. It follows that ( ) while
( ) . Since ( ) ( ), 8 is a deficient number.
2. 9
The positive divisors of 9 are 1, 3, and 9. It follows that ( ) while
( ) . Since ( ) ( ), 9 is a deficient number.
3. 12
The positive divisors of 12 are 1, 2, 3, 4, 6, and 12. It follows that ( )
while ( ) . Since ( ) ( ), 12 is an abundant number.
4. 36
The positive divisors of 36 are 1, 2, 3, 4, 6, 9, 12, 18, and 36. It follows that ( )
while ( ) . Since ( ) ( ), 36 is an
abundant number.
Learning Activity
1. 1 __________________________________
2. 18 __________________________________
3. 22 __________________________________
4. 24 __________________________________
5. 30 __________________________________
Definition. A positive integer is happy if the sum of the squares of its digits eventually ends in 1.
However, it is unhappy if the sum of the squares of the digits enters a repeating cycle.
Example:
Let us consider the two positive integers below and determine which is happy and which is unhappy
number.
1. 16
Page 40
SEd Math 314 Number Theory
2. 23
Learning Activity
1. 7 __________________________________
2. 19 __________________________________
3. 35 __________________________________
4. 44 __________________________________
5. 50 __________________________________
Definition. Two positive integers and are called an amicable pair or friendly numbers if is
equal to the sum of the positive divisors of except itself and, on the other hand, is equal to the sum
of the positive divisors of except itself.
In terms of the function, the amicable numbers say and are defined by the equations
( ) ( )
or equivalently
( ) ( )
The positive divisors of 220 are 1, 2, 4, 5, 10, 11, 22, 44, 55, 110 and 220 while the positive
divisors of 284 are 1, 2, 4, 71, 142, and 284. Now, we will show that
( )
( )
and
( )
( )
Learning Activity
Page 41
SEd Math 314 Number Theory
FIGURATE NUMBERS
Figurate numbers are numbers that are represented using arrays of dots and form regular polygons.
Triangular Numbers ( ) are numbers which can be represented using dots in an equilateral triangular
array.
Example:
1 3 6 10 15
( )
1. A number is triangular if and only if it is of the form for some (Pythagoras, circa
550 B.C.)
2. The integer is a triangular number if and only of is a perfect square. (Plutarch, circa 100
A.D.)
3. The sum of any two consecutive triangular numbers is a perfect square. (Nicomachus, circa 100
A.D.)
4. If is a triangular number, then so are , , and (Euler, 1775)
Square Numbers ( ) are numbers which can be represented by dots in a square arrangement or array. A
square number is of the form .
Example:
1 4 9 16 25
Pentagonal Numbers ( ) are numbers which can be represented by dots in a pentagonal array. A
( )
pentagonal number is of the form .
Example:
1 5 12 22 35
Page 42
SEd Math 314 Number Theory
Hexagonal Numbers ( ) are numbers which can be represented by dots in a hexagonal array. A
hexagonal number is of the form ( ).
Example:
1 6 15 28 45
Learning Activity
1. Draw the 6th triangular, square, pentagonal, and hexagonal numbers.
2. The figure below shows that 4th triangular number, 10, added to 5th triangular number, 15,
produces the 5th square number, 25.
a. Use a drawing to show that the fifth triangular number added to the sixth triangular
number is the sixth square number.
b. Verify that the 30th triangular number added to the 31st triangular number is the 31st
square number. Hint: Use a numerical approach, do not use drawing.
c. Use the th-term formulas to verify that the sum of the th triangular number and the
( ) triangular number is always the square number ( ) .
Assessment Task
Answer the following questions below. Show your complete solution.
B. Calculate the sum of the positive divisors ( ) of the following positive integers:
1. 24
2. 55
Page 43
SEd Math 314 Number Theory
3. 127
4. 436
5. 512
Reference
Page 44