A divisor function assigns a value to a positive integer based on its positive divisors. One of the most important divisor functions is τ(n), also written as d(n), which counts the positive divisors of n. To calculate this function efficiently, first express the integer as a product of prime powers. If n = p₁^a₁ × p₂^a₂ × ... × pₖ^aₖ, then the number of positive divisors is obtained by multiplying one more than each exponent. For example, 12 = 2² × 3¹, so it has (2 + 1)(1 + 1) = 6 positive divisors. Another important divisor function is σ(n), which calculates the sum of all positive divisors. These functions help describe the arithmetic structure of integers.
Divisor Functions and Number of Divisors
Divisor functions describe numerical properties of the positive divisors of an integer, including how many divisors it has and how those divisors are distributed.
If n = p₁^a₁ × p₂^a₂ × ... × pₖ^aₖ, then τ(n) = (a₁ + 1)(a₂ + 1)...(aₖ + 1).
Explanation
Variables
N
The positive integer being studied.
P₁, p₂, ..., pₖ
Distinct prime factors of n.
A₁, a₂, ..., aₖ
Positive integer exponents in the prime factorization.
Τ(n)
The number of positive divisors of n.
Example or application
A worked example has not yet been added.
Definition
A divisor function is a function that assigns a numerical value to an integer based on its positive divisors. The divisor-counting function τ(n) gives the number of positive divisors of n.
Purpose
To calculate and study the number, sum, and other properties of the divisors of positive integers.
Importance
Divisor functions are fundamental tools in number theory and are used to study perfect numbers, abundant numbers, multiplicative functions, and integer factorization.
Key Concepts
Positive divisors
Divisor-counting function
Prime factorization
Divisor exponent choices
Sum-of-divisors function
Arithmetic functions
Characteristics
The divisor-counting function is commonly written as τ(n) or d(n).
The number 1 has exactly one positive divisor.
A prime number has exactly two positive divisors.
The divisor-counting formula depends on the exponents in the prime factorization.
The divisor-counting function is multiplicative.
A perfect square has an odd number of positive divisors.
A non-square positive integer has an even number of positive divisors.
Types
| Name | Description |
|---|---|
Divisor-counting function | Counts the number of positive divisors of an integer. |
Sum-of-divisors function | Calculates the sum of all positive divisors of an integer. |
Proper-divisor sum function | Calculates the sum of positive divisors excluding the integer itself. |
Unitary divisor function | Counts or studies divisors that have no common prime factors with their complementary quotient. |
Components
Integer n
Prime factorization
Distinct prime factors
Exponents
Divisor count
Properties
τ(1) = 1.
If p is prime, then τ(p) = 2.
For a prime power pᵃ, τ(pᵃ) = a + 1.
The divisor-counting function is multiplicative for relatively prime arguments.
A positive integer is a perfect square if and only if every exponent in its prime factorization is even.
A positive integer has an odd number of positive divisors if and only if it is a perfect square.
Examples
| Problem | Solution |
|---|---|
Find the number of positive divisors of 12. | First, factorize 12 = 2² × 3¹. Apply the formula: τ(12) = (2 + 1)(1 + 1) = 3 × 2 = 6. Its divisors are 1, 2, 3, 4, 6, and 12. |
Find the number of positive divisors of 36. | 36 = 2² × 3². Therefore, τ(36) = (2 + 1)(2 + 1) = 9. |
How many positive divisors does 64 have? | 64 = 2⁶. Therefore, τ(64) = 6 + 1 = 7. |
Applications
Counting factors efficiently
Integer classification
Number theory research
Perfect-square identification
Divisor-sum calculations
Mathematical algorithms
Prerequisites
Prime factorization
Exponents
Factors and multiples
Positive integers
Multiplication
Learning Objectives
Define a divisor function.
Understand the divisor-counting function τ(n).
Calculate the prime factorization of an integer.
Apply the divisor-counting formula.
Explain why perfect squares have an odd number of divisors.
Distinguish divisor-counting and sum-of-divisors functions.
Common Mistakes
Using the prime factors themselves instead of their exponents in the formula.
Forgetting to add 1 to each exponent.
Counting only proper divisors when the question asks for all positive divisors.
Assuming the divisor-counting function is always multiplicative for any two integers.
Confusing τ(n) with σ(n).
Practice Questions
Find τ(18).
How many positive divisors does 100 have?
Calculate τ(72) using prime factorization.
Why does a prime number have exactly two positive divisors?
Why does every perfect square have an odd number of positive divisors?
What is the difference between τ(n) and σ(n)?
Key Takeaway
The divisor-counting function calculates the number of positive divisors directly from the exponents in an integer's prime factorization.
Related Topics
Prime Factorization
Sum of Divisors
Multiplicative Functions
Perfect Numbers
Greatest Common Divisor
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Arithmetic & Number Theory