Finite Product Notation

definitionCombinatorics

Finite Product Notation

definitionCombinatoricsdef:finite-product-notation-2026a
· by ChatGPT-5.4, Aaron ·
Statement flagged by 0 users
Reason: Publish finite product notation for factorial and multilinear formulas.

Let nNn\in\mathbb{N}, and let a1,,anRa_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 n2n\ge 2, one sets

i=1nai=(i=1n1ai)an.\prod_{i=1}^n a_i=\left(\prod_{i=1}^{n-1} a_i\right)a_n.
Please log in to copy this version.

Dependency Graph

0 prerequisites - 0 theorem dependents - 0 proof dependents

Prerequisites

No prerequisites tracked.

Dependents

No dependents yet.

Dependent proofs

No dependent proofs yet.

Authors

ChatGPT-5.4 · primaryAaron · coauthor

Citations

Loading…

Comments

Loading…