Study guide

7.1 Elementary Algebra, Polynomials, Roots, and Factorization

GRE Subject Test: Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Single-Variable Differential Calculus

1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves

2 Chapter 2: Single-Variable Integral Calculus

2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria

3 Chapter 3: Sequences, Infinite Series & Power Series

3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds

4 Chapter 4: Multivariable Differential Calculus

4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers

5 Chapter 5: Multivariable Integration & Vector Calculus

5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem

6 Chapter 6: Ordinary Differential Equations

6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters

7 Chapter 7: Elementary Algebra & Number Theory

7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient

8 Chapter 8: Linear Algebra: Vector Spaces & Transformations

8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis

9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory

9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem

10 Chapter 10: Abstract Algebra: Groups, Rings & Fields

10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields

11 Chapter 11: Introductory Real Analysis

11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence

12 Chapter 12: Complex Analysis

12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem

13 Chapter 13: Topology, Geometry & Numerical Analysis

13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature

14 Chapter 14: Probability, Statistics & Discrete Mathematics

14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions

7.1 Elementary Algebra, Polynomials, Roots, and Factorization

Key Takeaways Explain This Topic AI

The Division Algorithm and Remainder Theorem establish that dividing P(x) by x - c leaves remainder P(c), meaning x - c divides P(x) if and only if P(c) = 0.

Vieta's formulas connect the roots of a degree-n polynomial to its coefficients via elementary symmetric polynomials, giving the sum of roots as -a_{n-1}/a_n and the product of roots as (-1)^n a_0/a_n.

The Fundamental Theorem of Algebra states that every non-constant complex polynomial factors completely into linear factors over C; over R, irreducibles are restricted to linear polynomials and quadratics with negative discriminant.

Eisenstein's criterion provides a sufficient test for irreducibility over Q: if a prime p divides all non-leading coefficients, p does not divide the leading coefficient, and p^2 does not divide the constant term, then the polynomial is irreducible over Q.

Elementary algebra requires disciplined control of domains, exponents, radicals, logarithms, rational expressions, and inequality sign changes before polynomial theorems are applied.

Last updated: September 2026

7.1 Polynomial Algebra, Roots, and the Fundamental Theorem of Algebra

Polynomial algebra on the GRE Mathematics Subject Test emphasizes root structure, symmetric polynomials, and field-dependent irreducibility criteria. Mastery of Vieta's formulas, Descartes' Rule of Signs, and Eisenstein's criterion enables solving advanced algebra items efficiently.

Division Algorithm, Remainder Theorem, and Factor Theorem

Polynomial rings over a field F \mathbb{F} F (such as Q \mathbb{Q} Q , R \mathbb{R} R , or C \mathbb{C} C ) possess a Euclidean division structure analogous to Z \mathbb{Z} Z .

Division Algorithm

For P ( x ) , D ( x ) ∈ F [ x ] P(x), D(x) \in \mathbb{F}[x] P ( x ) , D ( x ) ∈ F [ x ] with D ( x ) ≠ 0 D(x) \neq 0 D ( x )  = 0 , there exist unique polynomials Q ( x ) , R ( x ) ∈ F [ x ] Q(x), R(x) \in \mathbb{F}[x] Q ( x ) , R ( x ) ∈ F [ x ] satisfying: P ( x ) = D ( x ) Q ( x ) + R ( x ) where R ( x ) = 0 or deg ⁡ ( R ) < deg ⁡ ( D ) P(x) = D(x)Q(x) + R(x) \quad \text{where } R(x) = 0 \text{ or } \deg(R) < \deg(D) P ( x ) = D ( x ) Q ( x ) + R ( x ) where R ( x ) = 0 or de g ( R ) < de g ( D )

Remainder and Factor Theorems

When the divisor is linear, D ( x ) = x − c D(x) = x - c D ( x ) = x − c :

Remainder Theorem: Dividing P ( x ) P(x) P ( x ) by x − c x - c x − c yields a constant remainder equal to P ( c ) P(c) P ( c ) : P ( x ) = ( x − c ) Q ( x ) + P ( c ) P(x) = (x - c)Q(x) + P(c) P ( x ) = ( x − c ) Q ( x ) + P ( c ) .

Factor Theorem: x − c x - c x − c divides P ( x ) P(x) P ( x ) in F [ x ] \mathbb{F}[x] F [ x ] if and only if P ( c ) = 0 P(c) = 0 P ( c ) = 0 .

Multiplicity: Root c c c has multiplicity m ≥ 1 m \ge 1 m ≥ 1 if ( x − c ) m ∣ P ( x ) (x - c)^m \mid P(x) ( x − c ) m ∣ P ( x ) and ( x − c ) m + 1 ∤ P ( x ) (x - c)^{m+1} \nmid P(x) ( x − c ) m + 1 ∤ P ( x ) , equivalent to P ( c ) = ⋯ = P ( m − 1 ) ( c ) = 0 P(c) = \dots = P^{(m-1)}(c) = 0 P ( c ) = ⋯ = P ( m − 1 ) ( c ) = 0 with P ( m ) ( c ) ≠ 0 P^{(m)}(c) \neq 0 P ( m ) ( c )  = 0 .

  • Rational Root Theorem and Descartes' Rule of Signs
  • Rational Root Theorem

Let P ( x ) = a n x n + ⋯ + a 1 x + a 0 ∈ Z [ x ] P(x) = a_n x^n + \dots + a_1 x + a_0 \in \mathbb{Z}[x] P ( x ) = a n ​ x n + ⋯ + a 1 ​ x + a 0 ​ ∈ Z [ x ] with a n ≠ 0 , a 0 ≠ 0 a_n \neq 0, a_0 \neq 0 a n ​  = 0 , a 0 ​  = 0 . If r = p / q ∈ Q r = p/q \in \mathbb{Q} r = p / q ∈ Q is a rational root in lowest terms ( gcd ⁡ ( p , q ) = 1 \gcd(p, q) = 1 g cd ( p , q ) = 1 ), then: p ∣ a 0 and q ∣ a n p \mid a_0 \quad \text{and} \quad q \mid a_n p ∣ a 0 ​ and q ∣ a n ​

For monic polynomials ( a n = 1 a_n = 1 a n ​ = 1 ), rational roots must be integer divisors of a 0 a_0 a 0 ​ .

Descartes' Rule of Signs

Let P ( x ) ∈ R [ x ] P(x) \in \mathbb{R}[x] P ( x ) ∈ R [ x ] have non-zero real coefficients:

Positive Real Roots: The number of positive real roots (counting multiplicity) equals sign changes v v v between consecutive non-zero coefficients of P ( x ) P(x) P ( x ) , or differs from v v v by an even integer ( v − 2 k v - 2k v − 2 k , k ≥ 0 k \ge 0 k ≥ 0 ).

Negative Real Roots: The number of negative real roots equals sign variations in coefficients of P ( − x ) P(-x) P ( − x ) , or differs by an even integer.

Vieta's Formulas and Symmetric Polynomials

Vieta's formulas connect the roots r 1 , … , r n ∈ C r_1, \dots, r_n \in \mathbb{C} r 1 ​ , … , r n ​ ∈ C of P ( x ) = a n x n + ⋯ + a 0 = a n ∏ i = 1 n ( x − r i ) P(x) = a_n x^n + \dots + a_0 = a_n \prod_{i=1}^n (x - r_i) P ( x ) = a n ​ x n + ⋯ + a 0 ​ = a n ​ ∏ i = 1 n ​ ( x − r i ​ ) to its coefficients:

Sum of roots: e 1 = ∑ i = 1 n r i = − a n − 1 a n e_1 = \sum_{i=1}^n r_i = -\frac{a_{n-1}}{a_n} e 1 ​ = ∑ i = 1 n ​ r i ​ = − a n ​ a n − 1 ​ ​

Pairwise products: e 2 = ∑ 1 ≤ i < j ≤ n r i r j = a n − 2 a n e_2 = \sum_{1 \le i < j \le n} r_i r_j = \frac{a_{n-2}}{a_n} e 2 ​ = ∑ 1 ≤ i < j ≤ n ​ r i ​ r j ​ = a n ​ a n − 2 ​ ​

Degree- k k k sum: e k = ∑ 1 ≤ i 1 < ⋯ < i k ≤ n r i 1 … r i k = ( − 1 ) k a n − k a n e_k = \sum_{1 \le i_1 < \dots < i_k \le n} r_{i_1} \dots r_{i_k} = (-1)^k \frac{a_{n-k}}{a_n} e k ​ = ∑ 1 ≤ i 1 ​ < ⋯ < i k ​ ≤ n ​ r i 1 ​ ​ … r i k ​ ​ = ( − 1 ) k a n ​ a n − k ​ ​

Product of all roots: e n = ∏ i = 1 n r i = ( − 1 ) n a 0 a n e_n = \prod_{i=1}^n r_i = (-1)^n \frac{a_0}{a_n} e n ​ = ∏ i = 1 n ​ r i ​ = ( − 1 ) n a n ​ a 0 ​ ​

Power Sums and Newton's Identities

Power sums p k = ∑ i = 1 n r i k p_k = \sum_{i=1}^n r_i^k p k ​ = ∑ i = 1 n ​ r i k ​ satisfy p 1 = e 1 p_1 = e_1 p 1 ​ = e 1 ​ , p 2 = e 1 2 − 2 e 2 p_2 = e_1^2 - 2e_2 p 2 ​ = e 1 2 ​ − 2 e 2 ​ , and ∑ i = 1 n 1 r i = e n − 1 e n = − a 1 a 0 \sum_{i=1}^n \frac{1}{r_i} = \frac{e_{n-1}}{e_n} = -\frac{a_1}{a_0} ∑ i = 1 n ​ r i ​ 1 ​ = e n ​ e n − 1 ​ ​ = − a 0 ​ a 1 ​ ​ .

Fundamental Theorem of Algebra and Irreducibility Over Fields

A polynomial is irreducible in F [ x ] \mathbb{F}[x] F [ x ] if it cannot factor into non-constant polynomials of lower degree in F [ x ] \mathbb{F}[x] F [ x ] .

Field Irreducible Polynomials Factorization Structure

C \mathbb{C} C Linear polynomials only ( a x + b ax + b a x + b ) Degree- n n n polynomials split into n n n linear factors (FTA).

R \mathbb{R} R Linear and quadratics with Δ < 0 \Delta < 0 Δ < 0 Non-real roots appear in conjugate pairs a ± b i a \pm bi a ± bi . Degree ≥ 3 \ge 3 ≥ 3 always factors.

Q \mathbb{Q} Q Arbitrary degree polynomials Analyzed via Gauss's Lemma, Eisenstein, or mod p p p reduction.

Gauss's Lemma and Eisenstein's Criterion

Gauss's Lemma: A primitive polynomial P ( x ) ∈ Z [ x ] P(x) \in \mathbb{Z}[x] P ( x ) ∈ Z [ x ] is irreducible in Z [ x ] \mathbb{Z}[x] Z [ x ] if and only if it is irreducible in Q [ x ] \mathbb{Q}[x] Q [ x ] .

Eisenstein's Criterion: Let P ( x ) = a n x n + ⋯ + a 0 ∈ Z [ x ] P(x) = a_n x^n + \dots + a_0 \in \mathbb{Z}[x] P ( x ) = a n ​ x n + ⋯ + a 0 ​ ∈ Z [ x ] . If a prime p p p satisfies:

p ∤ a n p \nmid a_n p ∤ a n ​

p ∣ a i p \mid a_i p ∣ a i ​ for all i ∈ { 0 , 1 , … , n − 1 } i \in \{0, 1, \dots, n-1\} i ∈ { 0 , 1 , … , n − 1 }

p 2 ∤ a 0 p^2 \nmid a_0 p 2 ∤ a 0 ​ then P ( x ) P(x) P ( x ) is irreducible over Q \mathbb{Q} Q .

Shifted Eisenstein: Substituting x = y + c x = y + c x = y + c can reveal irreducibility. The cyclotomic polynomial Φ p ( x ) = x p − 1 x − 1 \Phi_p(x) = \frac{x^p - 1}{x - 1} Φ p ​ ( x ) = x − 1 x p − 1 ​ with x = y + 1 x = y + 1 x = y + 1 satisfies Eisenstein with prime p p p .

Reduction Modulo p p p : If monic P ( x ) ∈ Z [ x ] P(x) \in \mathbb{Z}[x] P ( x ) ∈ Z [ x ] reduces modulo prime p p p to an irreducible P ˉ ( x ) ∈ F p [ x ] \bar{P}(x) \in \mathbb{F}_p[x] P ˉ ( x ) ∈ F p ​ [ x ] of degree n n n , then P ( x ) P(x) P ( x ) is irreducible over Q \mathbb{Q} Q .

Step-by-Step Worked Problem

Problem: Let P ( x ) = x 3 − 3 x 2 + 4 x − 5 P(x) = x^3 - 3x^2 + 4x - 5 P ( x ) = x 3 − 3 x 2 + 4 x − 5 have roots r 1 , r 2 , r 3 ∈ C r_1, r_2, r_3 \in \mathbb{C} r 1 ​ , r 2 ​ , r 3 ​ ∈ C . Compute 1 r 1 2 + 1 r 2 2 + 1 r 3 2 \frac{1}{r_1^2} + \frac{1}{r_2^2} + \frac{1}{r_3^2} r 1 2 ​ 1 ​ + r 2 2 ​ 1 ​ + r 3 2 ​ 1 ​ .

Solution:

Identify coefficients: a 3 = 1 , a 2 = − 3 , a 1 = 4 , a 0 = − 5 a_3 = 1, a_2 = -3, a_1 = 4, a_0 = -5 a 3 ​ = 1 , a 2 ​ = − 3 , a 1 ​ = 4 , a 0 ​ = − 5 .

Compute Vieta values: e 1 = − ( − 3 ) / 1 = 3 e_1 = -(-3)/1 = 3 e 1 ​ = − ( − 3 ) /1 = 3 , e 2 = 4 / 1 = 4 e_2 = 4/1 = 4 e 2 ​ = 4/1 = 4 , e 3 = − ( − 5 ) / 1 = 5 e_3 = -(-5)/1 = 5 e 3 ​ = − ( − 5 ) /1 = 5 .

Expand using common denominator e 3 2 e_3^2 e 3 2 ​ : ∑ i = 1 3 1 r i 2 = e 2 2 − 2 e 1 e 3 e 3 2 \sum_{i=1}^3 \frac{1}{r_i^2} = \frac{e_2^2 - 2e_1 e_3}{e_3^2} i = 1 ∑ 3 ​ r i 2 ​ 1 ​ = e 3 2 ​ e 2 2 ​ − 2 e 1 ​ e 3 ​ ​

Evaluate: ∑ i = 1 3 1 r i 2 = 4 2 − 2 ( 3 ) ( 5 ) 5 2 = 16 − 30 25 = − 14 25 \sum_{i=1}^3 \frac{1}{r_i^2} = \frac{4^2 - 2(3)(5)}{5^2} = \frac{16 - 30}{25} = -\frac{14}{25} i = 1 ∑ 3 ​ r i 2 ​ 1 ​ = 5 2 4 2 − 2 ( 3 ) ( 5 ) ​ = 25 16 − 30 ​ = − 25 14 ​

GRE Exam Traps & Pitfalls

Trap 1: Assuming Vieta Sums of Squares Must Be Positive The sum of squared reciprocals evaluates to − 14 / 25 -14/25 − 14/25 . Non-real complex roots have squares with negative real components. Do not discard negative power sums.

Trap 2: Treating Descartes' Rule as an Exact Count Three sign variations in P ( x ) P(x) P ( x ) guarantees 3 or 1 positive roots, never an unconditional count of 3.

Trap 3: Overlooking p 2 ∤ a 0 p^2 \nmid a_0 p 2 ∤ a 0 ​ in Eisenstein If p 2 ∣ a 0 p^2 \mid a_0 p 2 ∣ a 0 ​ , Eisenstein fails and provides no information regarding irreducibility.

Trap 4: Conflating Real and Rational Irreducibility While x 4 + 1 x^4 + 1 x 4 + 1 is irreducible over Q \mathbb{Q} Q , it factors over R \mathbb{R} R as ( x 2 − 2 x + 1 ) ( x 2 + 2 x + 1 ) (x^2 - \sqrt{2}x + 1)(x^2 + \sqrt{2}x + 1) ( x 2 − 2 ​ x + 1 ) ( x 2 + 2 ​ x + 1 ) . Over R \mathbb{R} R , no polynomial of degree ≥ 3 \ge 3 ≥ 3 is irreducible.

Elementary Algebra Toolkit

Before using polynomial theorems, simplify without changing the solution set. Every manipulation carries conditions: a denominator cannot be zero, an even root requires a nonnegative radicand over the reals, and a logarithm requires a positive argument.

Exponents, radicals, and rational expressions

For positive bases where needed, a m a n = a m + n , ( a m ) n = a m n , a − n = 1 a n , a p / q = a p q . a^m a^n=a^{m+n},\qquad (a^m)^n=a^{mn},\qquad a^{-n}=\frac1{a^n},\qquad a^{p/q}=\sqrt[q]{a^p}. a m a n = a m + n , ( a m ) n = a mn , a − n = a n 1 ​ , a p / q = q a p ​ .

An even root represents the nonnegative principal root, so x 2 = ∣ x ∣ \sqrt{x^2}=|x| x 2 ​ = ∣ x ∣ , not always x x x . When rationalizing 1 / ( a + b ) 1/(\sqrt a+\sqrt b) 1/ ( a ​ + b ​ ) , multiply by the conjugate a − b \sqrt a-\sqrt b a ​ − b ​ .

To combine rational expressions, factor first and use a common denominator. Cancellation removes factors, not terms: x 2 − 9 x 2 − x − 6 = ( x − 3 ) ( x + 3 ) ( x − 3 ) ( x + 2 ) = x + 3 x + 2 , \frac{x^2-9}{x^2-x-6}=\frac{(x-3)(x+3)}{(x-3)(x+2)}=\frac{x+3}{x+2}, x 2 − x − 6 x 2 − 9 ​ = ( x − 3 ) ( x + 2 ) ( x − 3 ) ( x + 3 ) ​ = x + 2 x + 3 ​ ,

but the original domain still excludes both x = 3 x=3 x = 3 and x = − 2 x=-2 x = − 2 . A rational equation should be multiplied by its least common denominator only after excluded values are recorded; any resulting candidate must be checked in the original equation.

Equations and inequalities

Completing the square gives a x 2 + b x + c = a ( x + b 2 a ) 2 − b 2 − 4 a c 4 a , ax^2+bx+c=a\left(x+\frac{b}{2a}\right)^2-\frac{b^2-4ac}{4a}, a x 2 + b x + c = a ( x + 2 a b ​ ) 2 − 4 a b 2 − 4 a c ​ ,

and yields the quadratic formula x = − b ± b 2 − 4 a c 2 a . x=\frac{-b\pm\sqrt{b^2-4ac}}{2a}. x = 2 a − b ± b 2 − 4 a c ​ ​ .

The discriminant determines two distinct real roots, one repeated real root, or a nonreal conjugate pair according as it is positive, zero, or negative.

Squaring both sides or multiplying by an expression that might vanish can introduce extraneous roots. For example, x + 1 = x − 1 \sqrt{x+1}=x-1 x + 1 ​ = x − 1 first requires x ≥ 1 x\ge1 x ≥ 1 ; squaring gives x + 1 = ( x − 1 ) 2 x+1=(x-1)^2 x + 1 = ( x − 1 ) 2 , but every candidate must meet the domain restriction and original equation.

For inequalities, multiplying or dividing by a negative quantity reverses the inequality. Polynomial and rational inequalities are reliably solved with a sign chart: move all terms to one side, factor, mark zeros and undefined points, test each interval, and decide whether endpoints are included. For ( x − 1 ) ( x + 2 ) x − 3 ≤ 0 , \frac{(x-1)(x+2)}{x-3}\le0, x − 3 ( x − 1 ) ( x + 2 ) ​ ≤ 0 ,

critical values are − 2 , 1 , 3 -2,1,3 − 2 , 1 , 3 ; 3 3 3 is never included because the expression is undefined.

Absolute value is distance. For a > 0 a>0 a > 0 , ∣ u ∣ < a ⟺ − a < u < a , ∣ u ∣ > a ⟺ u < − a or u > a . |u|<a\iff -a<u<a,\qquad |u|>a\iff u<-a\text{ or }u>a. ∣ u ∣ < a ⟺ − a < u < a , ∣ u ∣ > a ⟺ u < − a or u > a .

More generally, ∣ x − c ∣ ≤ r |x-c|\le r ∣ x − c ∣ ≤ r describes the closed interval [ c − r , c + r ] [c-r,c+r] [ c − r , c + r ] .

Exponential and logarithmic equations

For b > 0 b>0 b > 0 , b ≠ 1 b\ne1 b  = 1 , the exponential b x b^x b x is one-to-one and has inverse log ⁡ b x \log_b x lo g b ​ x . Core identities are log ⁡ b ( x y ) = log ⁡ b x + log ⁡ b y , log ⁡ b ( x / y ) = log ⁡ b x − log ⁡ b y , log ⁡ b ( x r ) = r log ⁡ b x , \log_b(xy)=\log_bx+\log_by,\quad

\log_b(x/y)=\log_bx-\log_by,\quad

\log_b(x^r)=r\log_bx, lo g b ​ ( x y ) = lo g b ​ x + lo g b ​ y , lo g b ​ ( x / y ) = lo g b ​ x − lo g b ​ y , lo g b ​ ( x r ) = r lo g b ​ x ,

with every logarithm argument positive. Thus log ⁡ 2 ( x − 1 ) + log ⁡ 2 ( x − 3 ) = 3 \log_2(x-1)+\log_2(x-3)=3 lo g 2 ​ ( x − 1 ) + lo g 2 ​ ( x − 3 ) = 3

requires x > 3 x>3 x > 3 and becomes ( x − 1 ) ( x − 3 ) = 8 (x-1)(x-3)=8 ( x − 1 ) ( x − 3 ) = 8 . The algebraic candidates are x = 5 x=5 x = 5 and x = − 1 x=-1 x = − 1 , but only x = 5 x=5 x = 5 satisfies the logarithmic domain.

When unlike exponential bases cannot be rewritten compatibly, logarithms isolate the variable: 3 2 x − 1 = 7 3^{2x-1}=7 3 2 x − 1 = 7 gives x = ( 1 + log ⁡ 3 7 ) / 2 x=(1+\log_3 7)/2 x = ( 1 + lo g 3 ​ 7 ) /2 .

Common traps

Do not distribute a root across addition: a + b \sqrt{a+b} a + b ​ is generally not a + b \sqrt a+\sqrt b a ​ + b ​ . Do not cancel across sums. Retain excluded values after factor cancellation. Reverse an inequality only when multiplying or dividing by a negative number, and check all candidates produced by squaring, clearing denominators, or applying logarithms.

Loading diagram... Polynomial Irreducibility and Root Analysis Workflow