generates a list of all possible ntuples of elements from list.


generates a list of all possible tuples whose i^(th) element is from listi.


  • The elements of list are treated as distinct, so that Tuples[list,n] for a list of length k gives output of length kn.
  • Tuples[list,n] is equivalent to Tuples[Table[list,n]].
  • The order of elements in Tuples[list,n] is based on the order of elements in list, so that Tuples[{a1,,ak},n] gives {{a_(1),a_(1),...,a_(1)},{a_(1),a_(1),...,a_(2)},...,{a_(k),a_(k),...,a_(k)}}.
  • Tuples[list,{n1,n2,}] generates a list of all possible n_(1)n_(2) arrays of elements in list.
  • The object list need not have head List. The head at each level in the arrays generated by Tuples will be the same as the head of list.


open allclose all

Basic Examples  (3)

All possible 3-tuples of 0 and 1:

The first element given is always picked first:

All ways of picking one element from each list:

Generalizations & Extensions  (3)

Each occurrence of an element is picked separately:

All possible 2×2 arrays formed from a and b:

Tuples with any head:

Applications  (8)

Digits of successive base-2 numbers:

All possible trigrams of A and B:

Neighborhood rules for an elementary cellular automaton:

Digit sequences, or evolution of a substitution system:

2D lattice of points:

Connect pairs of points in all possible ways:

Properties & Relations  (4)

Tuples[list,n] is equivalent to Tuples[Table[list,n]]:

All possible digit sequences:

Results from Outer involve extra sublists:

Subsets picks each element at most once, and treats reorderings as equivalent:

Possible Issues  (1)

With one argument, Tuples picks an element from each sublist:

With two arguments, Tuples treats each sublist as a complete element:

Neat Examples  (6)

3D lattice of points:

Introduced in 2004