Equal Factors
Equal factors are a mathematical concept that plays a crucial role in understanding roots of numbers. Specifically, they refer to the repeated factors of a number that, when multiplied together, yield that number to a certain degree of multiplicity. For instance, the square root of a number \( x \) is a value \( q \) such that \( q \times q = x \). In the case of 9, the equal factors are 3 and 3, as both \( 3^2 \) and \( (-3)^2 \) equal 9. This concept extends beyond square roots to higher-degree roots, such as cube roots, which involve three equal factors.
Equal factors are also essential in the context of fractional exponents, allowing for the resolution of complex expressions like \( 64^{2/3} \). In addition to their role in mathematics, the factorization of large numbers is significant in cryptography. For example, the RSA cryptosystem relies on the difficulty of factoring the product of two large prime numbers, which underpins its security framework. This highlights not only the mathematical significance of equal factors but also their practical applications in modern technology.
On this Page
Subject Terms
Equal Factors
A factor is an important concept in mathematics. The factors of a mathematical object are the things which, when multiplied together, compose that object. Any composite number (that is, any number that is not prime) has at minimum one positive factor other than one and the number itself; furthermore, any composite number can be factored as the product of two or more prime numbers. The factors of the number 15, for instance, are 3 and 5, while the factors of x2 − 4 are (x − 2) and (x + 2). The breaking down of an object into these parts is called factorization. Factorization of integers is a matter of arithmetic, while the factorization of polynomials such as the aforementioned expression is the domain of algebra. Functions can also be factored into other functions: specifically, every function can be broken down into a surjective function and an injective function.
The prime factors of a positive integer are the prime numbers that can exactly divide the integer. In prime factorization, these factors are listed with their multiplicities. The multiplicity of a prime factor p of positive integer n is the largest exponent a for which pa exactly divides n. The number 360 is therefore factorized as 23 x 32 x 5. (The order of the factors is not important, but it is conventional to list them from least to greatest.)
Overview
Equal factors are important in understanding and working with roots. The nth root of a number x is an equal factor into which x can be factored, with a multiplicity of n. The square root of x, for instance, is a number q which, when multiplied by itself (q2), equals x. The factors of 9 are 1 × 9 and 3 × 3, so its equal factors are 3 and 3. Positive numbers have two square roots: both 32 and (–3)2 equal 9, for instance. The square root of a negative number is an imaginary number. A cube root is a root with a degree (or index) of 3; the cube root of 27 is 3, because 3 × 3 × 3 or 33 = 27. Higher multiplicity roots are referred to by ordinal number: ninth root, eleventh root, seventeenth root, and so on.
Equal factors are also used to resolve fractional exponents. For instance, 642/3 may at first seem perplexing, but a number qx/y equals the product of x of the y equal factors into which q is resolved. That is:
642/3 = 4 × 4 = 16
Factorization of very large numbers which are close in size but not close enough to be efficiently factorized by Fermat's factorization method is a difficult enough process that even dedicated computers cannot accomplish it in a reasonable amount of time. And for this reason, this process is a key component in modern cryptographic protocols. The RSA cryptosystem, named for Ron Rivest, Adi Shamir, and Leonard Adleman, was first described in 1977 and involves factoring the product of two very large prime numbers, which are kept secret except to the holder of the key. Almost forty years later, RSA remains feasibly unbreakable when used correctly.
Bibliography
Aigner, Martin, and Gunter M. Ziegler. Proofs from The Book. New York: Springer, 2014.
Grunbaum, Branko, and G. C. Shephard. Tilings and Patterns. New York: Dover, 2015.
Hanna, Gila. Explanation and Proof in Mathematics. New York: Springer, 2014.
Kahn, David. Attacking Trigonometry Problems. New York: Dover, 2015.
Larson, Ron. Algebra and Trigonometry. Boston: Cengage, 2015.
Millman, Richard, Peter Shiue, and Eric Brendan Kahn. Problems and Proofs in Numbers and Algebra. New York: Springer, 2015.