[[Thể loại:Trang cần được biên tập lại thuộc chủ đề Toán học]]
{\ \choose\ }
binomial coefficient
means [in the case of n = positive integer] the number of combinations of k elements drawn from a set of n elements.
[This may also be written as C[n, k], C[n; k], nCk, nCk, or ⟨ n k ⟩ {\displaystyle \left\langle {\begin{matrix}n\\k\end{matrix}}\right\rangle } .]
[ .5 7 ] = 5.5 4.5 3.5 2.5 1.5 .5 .5 1 2 3 4 5 6 7 = 33 2048 {\displaystyle {\begin{pmatrix}.5\\7\end{pmatrix}}={\frac {-5.5\cdot -4.5\cdot -3.5\cdot -2.5\cdot -1.5\cdot -.5\cdot .5}{1\cdot 2\cdot 3\cdot 4\cdot 5\cdot 6\cdot 7}}={\frac {33}{2048}}\,\!}
\left[\!\!{\ \choose\ }\!\!\right]
[when u is positive integer]
means reverse or rising binomial coefficient.
\left\{ \begin{array}{lr} \ldots \\ \ldots \end{array}\right.
pattern matching;
Switch statement
match... with
[The body of a piecewise-defined function can have any finite number [not only just two] expression-condition pairs.]
This symbol is also used in type theory for pattern matching the constructor of the value of an algebraic type. For example g [ n ] = match n with { x a y b {\displaystyle g[n]={\text{match }}n{\text{ with }}\left\{{\begin{array}{rl}x&\rightarrow a\\y&\rightarrow b\end{array}}\right.} does pattern matching on the function's arguments and means that g[x] is defined as a, and g[y] is defined as b.
[A pattern matching can have any finite number [not only just two] pattern-expression pairs.]
[This may also be written as f[X] if there is no risk of confusing the image of f under X with the function application f of X. Another notation is Im f, the image of f under its domain.]
[a, b] = ab ba, if a, b R [a ring or commutative algebra].
[AB, C] = A[B, C] + [A, C]B [ring theory].
[\] \!\,
Không thể phân tích cú pháp [lỗi cú pháp]: {\displaystyle [\,\] \!\,}
[\,\] \!\,
[This may also be written as f[X] if there is a risk of confusing the image of f under X with the function application f of X. Another notation is Im f, the image of f under its domain.]
ordered pair/triple/etc;
row vector; sequence
[Note that the notation [a,b] is ambiguous: it could be an ordered pair or an open interval. Set theorists and computer scientists often use angle brackets ⟨ ⟩ instead of parentheses.]
[a, b, c] is an ordered triple [or 3-tuple].
[] is the empty tuple [or 0-tuple].
greatest common divisor; hcf; gcd
[This may also be written hcf[a, b] or gcd[a, b].]
[\,\] \!\,[\,\] \!\,
] [ {\displaystyle ]\,\ [\!\,}
]\,\ [ \!\,]