Representação canônica de um número inteiro
A representação canônica, ou forma padrão, de um inteiro positivo [latex]n[/latex] é sua fatoração em primos única, escrita como um produto de potências de primos com os primos em ordem crescente. Para qualquer inteiro [latex]n > 1[/latex], ele pode ser escrito como [latex]n = p_1^{a_1} p_2^{a_2} cdots p_k^{a_k}[/latex], onde [latex]p_1 < p_2 < cdots < p_k[/latex] são números primos e os expoentes [latex]a_i[/latex] são inteiros positivos.
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 [latex]a = prod p_i^{alpha_i}[/latex] and [latex]b = prod p_i^{beta_i}[/latex] (where some exponents can be zero to include all primes present in either `a` or `b`), then [latex]text{gcd}(a, b) = prod p_i^{min(alpha_i, beta_i)}[/latex] and [latex]text{lcm}(a, b) = prod p_i^{max(alpha_i, beta_i)}[/latex]. 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, [latex]d(n) = (a_1+1)(a_2+1)cdots(a_k+1)[/latex]. This form essentially provides a unique ‘fingerprint’ for every integer, encoding its entire multiplicative structure.
UNESCO Nomenclature: 1101
Matemática pura
Precursores
- The Fundamental Theorem of Arithmetic
- Development of exponential notation
- Formalization of number theory as a distinct branch of mathematics
Aplicações
- 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
Ideias de Inovação Potencial
Devido ao tráfego de bots de coleta de dados, atualmente superior a 40 mil por dia, este conteúdo é reservado aos membros da comunidade.
> Login < ou > Registrar < (100% gratuito) para acessar isso, assim como todo o restante do conteúdo e das ferramentas restritas.
Related to: canonical representation, standard form, prime factorization, number theory, greatest common divisor, least common multiple, prime power, integer, exponent, multiplicative function.