I'm in an argument with a friend over rolling a dice several times, for example rolling 5 times. His argument is, that is far more difficult to roll out 1-1-1-1-1 than any other combination (for example 1-5-2-4-3) as the results of the rolls distribute in a Gauss manner so the edges are somehow less probable. His arguments have to do with Bayes theory. My intuition tells just the opposite since the dices have no memmory and one roll isn't conditioned by the latter, so any combination is equally probable. I know that dices are a very recurrent topic here but I haven't found an straight answer to my question...
In the final terms it seems is a discussion of the Bayessian against frequentist approaches to probabilistics. We're not going to solve it today... I abandon you since we have a duel at twelve o'clock in the church yard.
EDIT As I'm seeing many comments and answers here I would like to point out that the discussion is about combinations WITHOUT PERMUTATIONS, that is 12345 is different of 54321. Furthermore, I said 5 rolls to put a concrete example, but what we were discussing was for a large number of rolls (take large as the number you want...)


We can calculate $$\left(\sum_{i=1}^6 x_i\right)^5$$
We can expand this with the Multinomial theorem. The coefficients before each monomial is the number of configurations to get the occurrences of the corresponding exponents. For example, the term $x_1^2x_2^2x_3$ will tell us that there are as many combinations of 2 ones, 2 twos and one three as the coefficient before it.
For the general case this coefficient will be $$\frac{n!}{\prod_{i=1}^n e_i!}$$ where $e_i$ are the exponents, i.e. the individual occurrences.
In the extreme case if all exponents are one it becomes all possible permutations: $n!$ which is $5! = 120$ configurations.
And if one exponent is n and all other 0:
$$\frac{n!}{n!0!0!\cdots} = \frac{n!}{n!} = 1$$