MathDB

Suppose there are

n\geq{5}

different points arbitrarily arranged on a circle, the labels are

1, 2,\dots

, and

n

, and the permutation is

S

. For a permutation , a “descending chain” refers to several consecutive points on the circle , and its labels is a clockwise descending sequence (the length of sequence is at least

2

), and the descending chain cannot be extended to longer .The point with the largest label in the chain is called the "starting point of descent", and the other points in the chain are called the “non-starting point of descent” . For example: there are two descending chains

5, 2

and

4, 1

5, 2, 4, 1, 3

arranged in a clockwise direction, and

5

and

4

are their starting points of descent respectively, and

2, 1

is the non-starting point of descent . Consider the following operations: in the first round, find all descending chains in the permutation

S

, delete all non-starting points of descent , and then repeat the first round of operations for the arrangement of the remaining points, until no more descending chains can be found. Let

G(S)

be the number of all descending chains that permutation

S

has appeared in the operations,

A(S)

be the average value of

G(S)

of all possible n-point permutations

S

. (1) Find

A(5)

. (2)For

n\ge{6}

, prove that

\frac{83}{120}n-\frac{1}{2} \le A(S) \le \frac{101}{120}n-\frac{1}{2}.

4

Problems(2)