TheoremBase

Finite Product Notation

Statement

Let n∈Nn\in\mathbb{N}, and let a1,…,an∈Ra_1,\dots,a_n\in\mathbb{R}. The finite product

∏i=1nai\prod_{i=1}^n a_i

is defined recursively as follows.

∏i=11ai=a1.\prod_{i=1}^1 a_i=a_1.

For every natural number n≥2n\ge 2, one sets

∏i=1nai=(∏i=1n−1ai)an.\prod_{i=1}^n a_i=\left(\prod_{i=1}^{n-1} a_i\right)a_n.

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…