TheoremBase

The Binomial Theorem in a Commutative Ring

In a commutative ring the n-th power of a sum x+y is the sum over k from 0 to n of the binomial coefficient of n and k times xkx^k y(n−k)y^(n-k).

Statement

In the setting of Commutative Rings, Fields and Ordered Fields: Standard Notation, let RR, with ++, ⋅\cdot, 00 and 11, be a commutative ring, let binomial coefficients (nk)\binom{n}{k} be as in The Binomial Coefficient §binomial, and let x,y∈Rx,y\in R and n∈N0n\in\mathbb{N}_{0}.

(x+y)n=∑k=0n(nk)xkyn−k(x+y)^{n}=\sum_{k=0}^{n}\binom{n}{k}x^{k}y^{n-k}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…