There are a total of 24 number combinations that can be made using just the numbers 1, 2, 3 and 4. These 24 number combinations are listed below in order of number combinations, beginning with the number 1 and finishing with number combinations that begin with the number four.

1234, 1243, 1324, 1342, 1423, 1432, 2134, 2143, 2314, 2341, 2413, 1431, 3124, 3142, 3214, 3241, 3412, 3421, 4123, 4132, 4213, 4231, 4312, 4321.

In mathematics a combination is a way of selecting several things out of a larger group, where unlike permutations, order does not matter. In smaller cases it is possible to count the number of combinations. For example given three fruit, an apple, orange and pear say, there are three combinations that can be drawn from this set: An apple and a pear; an apple and an orange; or a pear and an orange.

More formally a k-combination of a set S is a subset of k distinct elements of S. If the set has n elements the number of k-combinations is equal to the binomial coefficient. Combinations can consider the combination of n things taken k at a time without or with repetitions. If however it was possible to have two of any one kind of fruit there would be 3 more combinations: One with two apples, one with two oranges, and one with two pears.

With large sets, it becomes necessary to use mathematics to find the number of combinations. For example, a poker hand can be described as a 5-combination (k = 5) of cards from a 52 deck of cards (n = 52). The 5 cards of the hand are all distinct, and the order of cards in the hand does not matter. There are 2,598,960 such combinations, and the chance of drawing any one hand at random is 1 / 2,598,960.

1234, 1243, 1324, 1342, 1423, 1432, 2134, 2143, 2314, 2341, 2413, 1431, 3124, 3142, 3214, 3241, 3412, 3421, 4123, 4132, 4213, 4231, 4312, 4321.

In mathematics a combination is a way of selecting several things out of a larger group, where unlike permutations, order does not matter. In smaller cases it is possible to count the number of combinations. For example given three fruit, an apple, orange and pear say, there are three combinations that can be drawn from this set: An apple and a pear; an apple and an orange; or a pear and an orange.

More formally a k-combination of a set S is a subset of k distinct elements of S. If the set has n elements the number of k-combinations is equal to the binomial coefficient. Combinations can consider the combination of n things taken k at a time without or with repetitions. If however it was possible to have two of any one kind of fruit there would be 3 more combinations: One with two apples, one with two oranges, and one with two pears.

With large sets, it becomes necessary to use mathematics to find the number of combinations. For example, a poker hand can be described as a 5-combination (k = 5) of cards from a 52 deck of cards (n = 52). The 5 cards of the hand are all distinct, and the order of cards in the hand does not matter. There are 2,598,960 such combinations, and the chance of drawing any one hand at random is 1 / 2,598,960.