Adjective
n-ary (not comparable)
(mathematics) of, or relating to, n entities (where n is an arbitrary or large number)
An example of converting an n-ary tree to a binary tree The binary tree can be thought of as the original tree tilted sideways, with the black left edges representing first child and the blue right edges representing next sibling. Source: Internet
One such type of Gray code is the n-ary Gray code, also known as a non-Boolean Gray code. Source: Internet
Polyadic or multiary means n-ary for some nonnegative integer n. A 0-ary, or nullary, quasigroup is just a constant element of Q. A 1-ary, or unary, quasigroup is a bijection of Q to itself. Source: Internet
Finally, it is possible to generalize any of these concepts by replacing the binary operation with an arbitrary n-ary one (i.e. an operation taking n arguments). Source: Internet
Suppose that we wish to prove a statement about an n-ary operation implicitly defined from a binary operation, using mathematical induction on n. In this case it is natural to take 2 for the induction basis. Source: Internet
Arithmetic operators in Lisp are variadic functions (or n-ary ), able to take any number of arguments. Source: Internet