If we have a large number of distinct items and we want to single out a smaller number "k"and arrange those into a line; this is called an arrangement (k-permutation), if we single out all the items, this is called a permutation (n-permutation).
A combination involves choosing items from a finite population in which every item is uniquely identified, but the order in which the choices are made is unimportant.