25 Nov
2003
25 Nov
'03
5:56 p.m.
If we are given p_i and p_j as permutations of P_n, i.e. all possible re-arrangements of 1..n, how is P(n,k) defined?, whereby(n,k) is the number of permutations of 1,..,n whereby the maximum absolute difference between any 2 elements of p_i and p_j is k. e.g. P(4,0)=1 1234->1234 P(4,1)=? 1234->1234 1234->2143 2143->1234 3142->4213 p(4,2)=? 1234->1234 1234->2143 2143->4321 P(n,0)=1 P(n,n-1)=n! Jon Perry perry@globalnet.co.uk http://www.users.globalnet.co.uk/~perry/maths/ http://www.users.globalnet.co.uk/~perry/DIVMenu/ BrainBench MVP for HTML and JavaScript http://www.brainbench.com