Scribd Logo
Upload

Welcome to Scribd!

  • Proof

    Uploaded by

    Qianli Xia
    2 views1 page
    The author discusses two opposite operations - one that moves two boxes adjacently (W2) and one that moves one box from its neighbors to itself (W3). The author shows that when W1 is at its maximum value, neither operation can increase the multiplicity. This leads to inequalities relating the box numbers nk-1, nk, and nk+1, from which the final result follows from an equality.

    Original Description:

    Inequality

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The author discusses two opposite operations - one that moves two boxes adjacently (W2) and one that moves one box from its neighbors to itself (W3). The author shows that when W1 is at its maximum value, neither operation can increase the multiplicity. This leads to inequalities relating the box numbers nk-1, nk, and nk+1, from which the final result follows from an equality.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    Proof

    Uploaded by

    Qianli Xia
    The author discusses two opposite operations - one that moves two boxes adjacently (W2) and one that moves one box from its neighbors to itself (W3). The author shows that when W1 is at its maximum value, neither operation can increase the multiplicity. This leads to inequalities relating the box numbers nk-1, nk, and nk+1, from which the final result follows from an equality.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    BRIEF ARTICLE

    THE AUTHOR

    Q20.
    Consider two opposite operations, one moves two to adjacnet boxes (W2 ), and the other
    moves one from its neighbours’ to itself’s (W3 ).
    N!
    W1 =
    ...nk−1 !nk !nk+1 !...
    N!
    W2 =
    ...(nk−1 + 1)!(nk − 2)!(nk+1 + 1)!...
    N!
    W2 =
    ...(nk−1 − 1)!(nk + 2)!(nk+1 − 1)!...
    When W1 is at maximum, both operation should not increase the multiplicity, hence
    (when taking n large)
    W1 nk−1 nk+1
    ≥1⇒ ≥1
    W2 n2k
    W1 n2k
    ≥1⇒ ≥1
    W3 nk−1 nk+1
    The result then follows from the equality.

    You might also like