Product

Input: Product(f(n), For(n, a, b))
$$\prod_{n=a}^{b} f(n)$$

Product of $f(n)$ for integers $n$ from $a$ to $b$, where $a$ and $b$ should be integers or $-\infty$ or $\infty$. If $b < a$, the product is empty and equal to the integer 1. The product $\prod_{n=0}^{\infty} f(n)$ is interpreted as $\lim_{N \to \infty} \prod_{n=0}^{N} f(n)$ and can be conditionally convergent.

Input: Product(f(n), For(n, a, b), P(n))
$$\prod_{\textstyle{n=a \atop P(n)}}^{b} f(n)$$

The same meaning as $\prod_{n=a}^{b} f(n)$, except that only terms satisfying the predicate $P(n)$ are included in the product.

Input: Product(f(x), ForElement(x, S))
$$\prod_{x \in S} f(x)$$

Product of $f(x)$ for all $x$ in the set $S$. The product is required to be absolutely convergent.

Input: Product(f(x), ForElement(x, S), P(x))
$$\prod_{\textstyle{x \in S \atop P(x)}} f(x)$$

Product of $f(x)$ for all $x$ in the set $S$ satisfying the predicate $P(x)$. The product is required to be absolutely convergent.

Input: Product(f(x), For(x), P(x))
$$\prod_{P(x)} f(x)$$

Product of $f(x)$ for all $x$ satisfying the predicate $P(x)$. The predicate $P(x)$ should define the domain of $x$ unambiguously; that is, it should include a statement such as $x \in S$ where $S$ is a known set. The product is required to be absolutely convergent.

Last updated: 2020-03-06 00:22:16