Re: permutation question

This is quoted from a math proof

"the average is simply the sum of the times over all
permutations of
the input divided by n factorial, it's equivalent to
choosing a random
permutation of the input."

I just realized I have no idea what this statement
means. How can a
random permutation of the input be equivalent to the
sum of the times
over all permutations of the input divided by n
factorial? Can someone
give me a concrete example?

take a dice.

the average of all possibilities of a single throw = the average of a single random throw.
.

Relevant Pages

  • Action of a sum of permutations on a set
    ... viewed as a sum of permutations of the symmetric group in n ... letters, which in turn are viewed as multilinear words, is equal to ...
    (sci.math.research)
  • Re: Bad understanding of GF
    ... I am using a generating function to model a small partition problem ... From the set with replacement how many ways can I sum to six with ... permutations, is oversimpification. ... the number of ways to get sum i with j summands: ...
    (sci.math)
  • Re: Help with Permutations
    ... >>>In order to keep track of the progress through the algorithm, ... >>>be able to calculate the total number of permutations in advance. ... >> Derek Holt. ... >is inside the sum or outside but not 1265. ...
    (sci.math)
  • Re: permutation question
    ... the input divided by n factorial, it's equivalent to choosing a random ... random permutation of the input be equivalent to the sum of the times ... over all permutations of the input divided by n factorial? ... Ken Pledger. ...
    (sci.math)
  • Re: Help with Permutations
    ... >>Gives permutations: ... >>In order to keep track of the progress through the algorithm, ... I implemented your iterated sum formula using Maple 9.5. ... Obviously the above answer is way too big, so I tried to find the bug ...
    (sci.math)