Binomial Expansion Calculator
Expand binomial expressions using the binomial theorem with Pascal triangle coefficients. Enter values for instant results with step-by-step formulas.
Calculator
Adjust values & calculateAll Terms
Formula
Where C(n,k) = n! / (k!(n-k)!) is the binomial coefficient (also called 'n choose k'), a and b are the two terms of the binomial, n is the exponent (a non-negative integer), and k ranges from 0 to n generating n+1 total terms in the expansion.
Last reviewed: December 2025
Worked Examples
Example 1: Expanding (2x + 3)^4
Example 2: Finding the 5th Term of (x + 2)^7
Background & Theory
The Binomial Expansion Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Binomial Expansion Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
Formula
(a + b)^n = Sum from k=0 to n of C(n,k) * a^(n-k) * b^k
Where C(n,k) = n! / (k!(n-k)!) is the binomial coefficient (also called 'n choose k'), a and b are the two terms of the binomial, n is the exponent (a non-negative integer), and k ranges from 0 to n generating n+1 total terms in the expansion.
Worked Examples
Example 1: Expanding (2x + 3)^4
Problem: Use the binomial theorem to fully expand (2x + 3)^4 and identify all terms with their coefficients.
Solution: Using (a+b)^n with a=2, b=3, n=4:\nC(4,0)(2)^4(3)^0 = 1 x 16 x 1 = 16\nC(4,1)(2)^3(3)^1 = 4 x 8 x 3 = 96\nC(4,2)(2)^2(3)^2 = 6 x 4 x 9 = 216\nC(4,3)(2)^1(3)^3 = 4 x 2 x 27 = 216\nC(4,4)(2)^0(3)^4 = 1 x 1 x 81 = 81\nTotal = 16 + 96 + 216 + 216 + 81 = 625 = 5^4\nPascal row: [1, 4, 6, 4, 1]
Result: 16 + 96 + 216 + 216 + 81 = 625 | Verified: (2+3)^4 = 5^4 = 625
Example 2: Finding the 5th Term of (x + 2)^7
Problem: Find the 5th term in the binomial expansion of (x + 2)^7 using the general term formula.
Solution: The (k+1)th term = C(n,k) * a^(n-k) * b^k\nFor the 5th term, k = 4:\nT(5) = C(7,4) * (1)^(7-4) * (2)^4\nC(7,4) = 7! / (4! * 3!) = 5040 / (24 * 6) = 35\nT(5) = 35 * 1 * 16 = 560\nThe 5th term in the expansion is 560x^3\nPascal row for n=7: [1, 7, 21, 35, 35, 21, 7, 1]
Result: 5th term = 560 (coefficient 35 x 16) | Exponent of x: 3, Exponent of 2: 4
Frequently Asked Questions
What is the binomial theorem and what does it do?
The binomial theorem provides a formula for expanding any expression of the form (a + b) raised to a positive integer power n into a sum of individual terms. First proved in its general form by Isaac Newton, the theorem states that (a + b)^n equals the sum from k = 0 to n of C(n,k) times a^(n-k) times b^k, where C(n,k) is the binomial coefficient 'n choose k.' This eliminates the need for tedious repeated multiplication. For example, (x + y)^4 expands to x^4 + 4x^3y + 6x^2y^2 + 4xy^3 + y^4. The theorem is fundamental in algebra, probability theory, combinatorics, and calculus, forming the basis for many advanced mathematical concepts.
What are binomial coefficients and how are they calculated?
Binomial coefficients, written as C(n,k) or 'n choose k,' represent the number of ways to choose k items from a set of n items without regard to order. They are calculated using the formula C(n,k) = n! / (k! times (n-k)!), where ! denotes factorial. For example, C(5,2) = 5! / (2! times 3!) = 120 / (2 times 6) = 10. Binomial coefficients have many remarkable properties: they are always positive integers, they satisfy the symmetry property C(n,k) = C(n, n-k), and each coefficient equals the sum of two coefficients from the previous row in Pascal triangle. They appear throughout mathematics in counting problems, probability distributions, and polynomial expansions.
What is Pascal triangle and how does it relate to binomial expansion?
Pascal triangle is a triangular array of numbers where each entry is the sum of the two entries directly above it in the previous row. The rows of Pascal triangle, starting from row 0, give exactly the binomial coefficients for each power: row 0 is [1], row 1 is [1, 1], row 2 is [1, 2, 1], row 3 is [1, 3, 3, 1], and so on. These numbers serve as the coefficients in binomial expansions: (a+b)^3 = 1a^3 + 3a^2b + 3ab^2 + 1b^3. Named after Blaise Pascal who studied it in 1653, though it was known centuries earlier in China, Persia, and India. Pascal triangle contains many hidden patterns including Fibonacci numbers along diagonals, powers of 2 as row sums, and powers of 11 as concatenated row digits.
How do you find a specific term in a binomial expansion?
To find the (k+1)th term in the expansion of (a + b)^n, use the general term formula: T(k+1) = C(n,k) times a^(n-k) times b^k, where k ranges from 0 to n. Note that the first term corresponds to k=0, the second to k=1, and so on. For example, to find the 4th term of (2x + 3)^6, set k=3: T(4) = C(6,3) times (2x)^3 times 3^3 = 20 times 8x^3 times 27 = 4320x^3. The middle term occurs when k = n/2 for even n, and there are two middle terms when n is odd. Finding specific terms is useful in probability calculations and when you need only certain parts of an expansion rather than the full polynomial.
What is the sum of binomial coefficients for a given power?
The sum of all binomial coefficients for power n equals 2^n. This can be proven by substituting a = 1 and b = 1 into the binomial theorem: (1 + 1)^n = sum of C(n,k) for k = 0 to n, which gives 2^n. Similarly, substituting a = 1 and b = -1 gives 0 = sum of C(n,k) times (-1)^k, showing that the sum of even-positioned coefficients equals the sum of odd-positioned coefficients, each equaling 2^(n-1). For example, for n = 4, the coefficients are [1, 4, 6, 4, 1] with sum = 16 = 2^4, and even-position sum (1 + 6 + 1 = 8) equals odd-position sum (4 + 4 = 8). These identities have applications in combinatorics and information theory.
Can the binomial theorem be extended to non-integer exponents?
Yes, Newton generalized the binomial theorem to handle any real or even complex exponent, not just positive integers. The generalized binomial theorem states that (1 + x)^r for any real r equals the infinite series: 1 + rx + r(r-1)x^2/2! + r(r-1)(r-2)x^3/3! + ..., which converges for |x| < 1. The generalized binomial coefficients C(r,k) = r(r-1)(r-2)...(r-k+1)/k! can be negative or fractional. This extension is crucial in calculus for deriving Taylor series, computing square roots and cube roots as infinite series, and in physics for approximations like (1+x)^(-1) approximately equal to 1-x for small x. Newton used this generalization extensively in his development of calculus.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy