Canonical Representation of an Integer
The canonical representation, or standard form, of a positive integer \(n\) is its unique prime factorization written as a product of prime powers with the primes in increasing order. For any integer \(n > 1\), it can be written as \(n = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}\), where \(p_1 < p_2 < \cdots < p_k\) are prime numbers and the exponents \(a_i\) are positive integers.
The Fundamental Theorem of Arithmetic guarantees that the set of prime factors for any integer is unique. The canonical representation builds on this by adding a convention for ordering, making the representation itself unique, not just the set of factors. For example, the number 72 can be factored as `2 * 3 * 2 * 3 * 2`. The set of prime factors is {2, 2, 2, 3, 3}. The canonical representation groups these factors and orders the prime bases: `2^3 * 3^2`.
This standardized form is extremely useful in number theory. For instance, given the canonical representations of two numbers, `a` and `b`, their greatest common divisor (GCD) and least common multiple (LCM) can be found easily. If \(a = \prod p_i^{\alpha_i}\) and \(b = \prod p_i^{\beta_i}\) (where some exponents can be zero to include all primes present in either `a` or `b`), then \(\text{gcd}(a, b) = \prod p_i^{\min(\alpha_i, \beta_i)}\) and \(\text{lcm}(a, b) = \prod p_i^{\max(\alpha_i, \beta_i)}\). This provides a powerful computational tool. Furthermore, many important functions in number theory, such as the number of divisors `d(n)` or the sum of divisors `σ(n)`, have simple formulas based on the exponents in the canonical representation. For example, \(d(n) = (a_1+1)(a_2+1)\cdots(a_k+1)\). This form essentially provides a unique ‘fingerprint’ for every integer, encoding its entire multiplicative structure.
UNESCO Nomenclature: 1101
– Pure mathematics
Precursors
- The Fundamental Theorem of Arithmetic
- Development of exponential notation
- Formalization of number theory as a distinct branch of mathematics
Applications
- calculating the greatest common divisor (GCD) and least common multiple (LCM) of numbers
- defining number-theoretic functions like the divisor function and Euler’s totient function
- simplifying fractions
- analyzing the multiplicative structure of integers
Potential Innovations Ideas
Due to scrapping bot traffic, currently more than 40k per day, this content is reserved to community members.
> Login < or > Register < (100% free) to access this, so as all other restricted content and tools.
Related to: canonical representation, standard form, prime factorization, number theory, greatest common divisor, least common multiple, prime power, integer, exponent, multiplicative function.