Processing math: 60%
Research article

Some new identities of a type of generalized numbers involving four parameters

  • Received: 16 March 2022 Revised: 25 April 2022 Accepted: 26 April 2022 Published: 07 May 2022
  • MSC : 11B39, 11B83

  • This article deals with a Horadam type of generalized numbers involving four parameters. These numbers generalize several celebrated numbers in the literature such as the generalized Fibonacci, generalized Lucas, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers. We present some new identities concerned with the generalized numbers of four parameters. An explicit expression for these numbers is developed, and a mixed recurrence relation between two certain families of the generalized numbers is given, and after that, some new identities are presented and proved. A large number of identities between several celebrated numbers are obtained as special cases of our developed ones. Furthermore, some of the identities that were previously published in other articles can be deduced as special ones of our new identities.

    Citation: Waleed Mohamed Abd-Elhameed, Amr Kamel Amin, Nasr Anwer Zeyada. Some new identities of a type of generalized numbers involving four parameters[J]. AIMS Mathematics, 2022, 7(7): 12962-12980. doi: 10.3934/math.2022718

    Related Papers:

    [1] Jiali Wu, Maoning Tang, Qingxin Meng . A stochastic linear-quadratic optimal control problem with jumps in an infinite horizon. AIMS Mathematics, 2023, 8(2): 4042-4078. doi: 10.3934/math.2023202
    [2] Ramkumar Kasinathan, Ravikumar Kasinathan, Dumitru Baleanu, Anguraj Annamalai . Well posedness of second-order impulsive fractional neutral stochastic differential equations. AIMS Mathematics, 2021, 6(9): 9222-9235. doi: 10.3934/math.2021536
    [3] H. H. G. Hashem, Hessah O. Alrashidi . Qualitative analysis of nonlinear implicit neutral differential equation of fractional order. AIMS Mathematics, 2021, 6(4): 3703-3719. doi: 10.3934/math.2021220
    [4] Zhibo Cheng, Lisha Lv, Jie Liu . Positive periodic solution of first-order neutral differential equation with infinite distributed delay and applications. AIMS Mathematics, 2020, 5(6): 7372-7386. doi: 10.3934/math.2020472
    [5] Sivajiganesan Sivasankar, Ramalingam Udhayakumar, Abd Elmotaleb A.M.A. Elamin, R. Samidurai, Sina Etemad, Muath Awadalla . Attractive solutions for Hilfer fractional neutral stochastic integro-differential equations with almost sectorial operators. AIMS Mathematics, 2024, 9(5): 11486-11510. doi: 10.3934/math.2024564
    [6] Yuanfu Shao . Dynamics and optimal harvesting of a stochastic predator-prey system with regime switching, S-type distributed time delays and Lévy jumps. AIMS Mathematics, 2022, 7(3): 4068-4093. doi: 10.3934/math.2022225
    [7] Chunli You, Linxin Shu, Xiao-bao Shu . Approximate controllability of second-order neutral stochastic differential evolution systems with random impulsive effect and state-dependent delay. AIMS Mathematics, 2024, 9(10): 28906-28930. doi: 10.3934/math.20241403
    [8] Dennis Llemit, Jose Maria Escaner IV . Value functions in a regime switching jump diffusion with delay market model. AIMS Mathematics, 2021, 6(10): 11595-11609. doi: 10.3934/math.2021673
    [9] Yijia Zhang, Tao Xie, Yunlong Ma . Robustness analysis of exponential stability of Cohen-Grossberg neural network with neutral terms. AIMS Mathematics, 2025, 10(3): 4938-4954. doi: 10.3934/math.2025226
    [10] Qi Wang, Chenxi Xie, Qianqian Deng, Yuting Hu . Controllability results of neutral Caputo fractional functional differential equations. AIMS Mathematics, 2023, 8(12): 30353-30373. doi: 10.3934/math.20231550
  • This article deals with a Horadam type of generalized numbers involving four parameters. These numbers generalize several celebrated numbers in the literature such as the generalized Fibonacci, generalized Lucas, Fibonacci, Lucas, Pell, Pell-Lucas, Fermat, Fermat-Lucas, Jacobsthal, Jacobsthal-Lucas, balancing, and co-balancing numbers. We present some new identities concerned with the generalized numbers of four parameters. An explicit expression for these numbers is developed, and a mixed recurrence relation between two certain families of the generalized numbers is given, and after that, some new identities are presented and proved. A large number of identities between several celebrated numbers are obtained as special cases of our developed ones. Furthermore, some of the identities that were previously published in other articles can be deduced as special ones of our new identities.



    Order statistic (OS) plays an important role in nonparametric statistics. Under the assumption of large sample size, relative investigations are mainly focused on asymptotic distributions of some functions of these OSs. Among these studies, the elegant one provided by Bahadur in 1966 (see [1]) is the central limit theorem on OSs. As was revealed there, under the situation of an absolute continuous population, the sequence of some normalized OSs usually has an asymptotic standard normal distribution. That is useful in the construction of a confidence interval for estimating some certain quantile of the population. Comparatively, study on some moment convergence of the mentioned sequence is also significant, for instance, if we utilize a sample quantile as an asymptotic unbiased estimator for the corresponding quantile of the population, then the analysis of the second moment convergence of the sequence is significant if we want to make an approximation of the mean square error of the estimate.

    However, the analysis of moment convergence of OSs is usually very difficult, the reason, as was interpreted by Thomas and Sreekumar in [2], may lie in the fact that the moment of OS is usually very difficult to obtain.

    For a random sequence, although it is well-known that the convergence in distribution does not necessarily guarantee the corresponding moment convergence, usually, that obstacle can be sufficiently overcome by the additional requirement of the uniform integrability of the sequence. For instance, we can see [3] as a reference dealing with some extreme OSs under some populations. In that article Wang et al. discussed uniform integrability of the sequence of some normalized extreme OSs and derived equivalent moment expressions there.

    Here in the following theorem we discuss the moment convergence for some common OSs rather than extreme ones.

    Theorem 1. For a population X distributed according to a continuous probability density function (pdf) f(x), let p(0,1) and xp be the pquantile of X satisfying f(xp)>0. Let (X1,...,Xn) be a random sample arising from X and Xi:n be the ith OS. If the cumulative distribution function (cdf) F(x) of X has an inverse function G(x) satisfying

    |G(x)|Bxq(1x)q (1.1)

    for some constants B>0,q0 and all x(0,1), then for arbitrary δ>0, we have

    limnEXδi:n=xδp,

    provided limn+i/n=p or equivalently rewritten as i/n=p+o(1).

    Remark 1. Now we use the symbol z for the integer part of a positive number z and mn,p for the p-quantile of a random sample (X1,,Xn), namely, mn,p=(Xpn:n+Xpn+1:n)/2 if pn is an integer and mn,p=Xpn+1:n otherwise. As both limiting conclusions limnEXδpn:n=xδp and limnEXδpn+1:n=xδp hold under the conditions of Theorem 1 and mδn,p is always squeezed by Xδpn:n and Xδpn+1:n, according to the Sandwich Theorem, we have limnEmδn,p=xδp.

    Remark 2. For a continuous function H(x) where x(0,1), if

    limx0+H(x)=limx1H(x)=0,

    then there is a constant C>0 such that the inequality |H(x)|C holds for all x(0,1). By that reason, the condition (1.1) can be replaced by the statement that there exists some constant V0 such that

    limx0+G(x)xV(1x)V=limx1G(x)xV(1x)V=0.

    Remark 3. As the conclusion is on moment convergence of OSs, one may think that the moment of the population X in Theorem 1 should exist. That is a misunderstanding because the existence of the moment of the population is actually unnecessary. We can verify that by a population according to the well-known Cauchy distribution Xf(x)=1π(1+x2) where x(,+), in this case, the moment EX of the population does not exist whereas the required conditions in Theorem 1 are satisfied. Even for some population without any moment of positive order, the conclusion of Theorem 1 still holds, for instance, if f(x)=1x(ln(x))2I[e,)(x) (where the symbol IA(x) or IA stands for the indicator function of a set A), then we have the conclusion

    G(x)=e1x1I(0,1)(x),

    which leads to

    limx0+G(x)x(1x)=limx1G(x)x(1x)=0,

    and therefore the condition (1.1) holds, thus we can see that Theorem 1 is workable. That denies the statement in the final part of paper [4] exclaiming that under the situation Xf(x)=1x(ln(x))2I[e,)(x) any OS does not have any moment of positive order.

    According to Theorem 1, we known that the OS Xi:n of interest is an asymptotic unbiased estimator of the corresponding population quantile xp. Now we explore the infinitesimal type of the mean error of the estimate and derive

    Theorem 2. Let (X1,...,Xn) be a random sample from X who possesses a continuous pdf f(x). Let p(0,1) and xp be the pquantile of X satisfying f(xp)>0 and Xi:n be the ith OS. If the cdf F(x) of X has an inverse function G(x) with a continuous derivative function G(x) in (0,1) and there is a constant U0 such that

    limx0+(G(x)xU(1x)U)=limx1(G(x)xU(1x)U)=0, (1.2)

    then under the assumption i/n=p+O(n1) which indicates the existence of the limit limx0+i/np1/n, the following proposition stands

    |E(Xi:nxp)|=O(1/n). (1.3)

    Remark 4. Obviously we can see that |E(mn,pxp)|=O(1/n) under the conditions of Theorem 2.

    For i.i.d random variables(RVs) X1,...,Xn with an identical expectation μ and a common finite standard deviation σ>0, the famous Levy-Lindeberg central limit theorem reveals that the sequence of normalized sums

    {ni=1Xinμnσ,n1}

    converges in distribution to the standard normal distribution N(0,12) which we denote that as

    ni=1XinμnσDN(0,12).

    In 1964, Bengt presented his work [5] showing that if it is further assumed that E|X1|k<+ for some specific positive k, then the m-th moment convergence conclusion

    E(ni=1Xinμnσ)mEZm,n+, (1.4)

    holds for any positive m satisfying mk. Here and throughout our paper, we denote Z a RV of standard normal distribution N(0,12).

    Let f(x) be a continuous pdf of a population X and xr be the rquantile of X satisfying f(xr)>0. Like the Levy-Lindeberg central limit theorem, Bahadur interpreted in [1] (1966) that for the OS Xi:n, following convergence conclusion holds

    f(xr)(Xi:nxr)r(1r)/nDN(0,12),

    provided i/nr as n.

    Later in 1967, Peter studied moment convergence on similar topic. He obtained in [6] that for some ε>0, r(0,1) and pn=i/n, if the limit condition

    limxxε[1F(x)+F(x)]=0

    holds, then the conclusion

    E(Xi:nxin+1)k=[pn(1pn)/nf(xpn)]kxk2πex2/2dx+o(nk/2)

    is workable for positive integer k and rni(1r)n as n+.

    In addition to the mentioned reference dealing with moment convergence on OSs, we find some more desirable conclusions on similar topic provided by Reiss in reference [7] in 1989, from which we excerpt the one of interest as what follows.

    Theorem 3. Respectively let f(x) and F(x) be the pdf and cdf of a population X. Let p(0,1) and xp be the pquantile of X satisfying f(xp)>0. Assume that on a neighborhood of xp the cdf F(x) has m+1 bounded derivatives. If a positive integer i satisfies i/n=p+O(n1) and E|Xs:j|< holds for some positive integer j and s{1,...,j} and a measurable function h(x) meets the requirement |h(x)||x|k for some positive integer k, then

    Eh(n1/2f(xp)(Xi:nxp)p(1p))=h(x)d(Φ(x)+φ(x)m1i=1ni/2Si,n(x))+O(nm/2). (1.5)

    Here the function φ(x) and Φ(x) are respectively the pdf and cdf of a standard normal distribution while Si,n(x), a polynomial of x with degree not more than 3i1 and coefficients uniformly bounded over n, especially

    S1,n(x)=[2q13p(1p)+p(1p)f(xp)2(f(xp))2]x2+npi+1pp(1p)+2(2p1)3p(1p).

    Remark 5. By putting h(x)=x2 and m=2, we derive under the conditions of Theorem 3 that as n+,

    E(n1/2f(xp)(Xi:nxp)p(1p))2=x2d(Φ(x)+φ(x)n12S1,n(x))+O(n1)1.

    Therefore, we see that the sequence

    {E(n1/2f(xp)(Xi:nxp)p(1p))2,nN0}

    is uniformly bounded over nN0. Here N0 is the positive integer number that the moment EX2i:n exists when nN0. In accordance with the inequality |Eξ|Eξ2 if only the moment Eξ2 exists, the sequence

    {E(n1/2f(xp)(Xi:nxp)p(1p)),nN0}

    is also uniformly bounded, say, by a number L over n{N0,N0+1,...}. Now that

    |En1/2f(xp)(Xi:nxp)p(1p)|L,nN0,

    we have

    |E(Xi:nxp)|L[p(1p)/f(xp)]n1/2,nN0. (1.6)

    Under the conditions in Theorem 2, when we estimate a population quantile xp by an OS Xi:n, usually the estimate is not likely unbiased, compared with the two conclusions (1.3) and (1.6), the result (1.3) in Theorem 2 is more accurate.

    Remark 6. For a random sample (Y1,Y2,...,Yn) from a uniformly distributed population YU[0,1], we write Yi:n the ith OS. Obviously, conditions in Theorem 3 are fulfilled for any positive integer m2. That yields

    E(n1/2(Yi:np)p(1p))2=x2d(Φ(x)+φ(x)n1/2S1,n(x))+O(n1)=1+O(n1/2),

    and

    E(n1/2(Yi:np)p(1p))6=x6d(Φ(x)+φ(x)5i=1ni/2Si,n(x))+O(n3)=x6φ(x)dx+5i=1αi(n)ni/2+O(n3)=15+5i=1αi(n)ni/2+O(n3),

    where for each i=1,2,...,5, αi(n) is uniformly bounded over n.

    As is above analyzed, we conclude that under the assumption i/n=p+O(n1),

    E(Yi:np)2p(1p)n1andE(Yi:np)615p3(1p)3n3. (1.7)

    Based on Theorems 1 and 3, here we give some alternative conditions to those in Theorem 3 to embody its range of applications including situations even when the population X in Theorem 3 has no definite moment of any positive order. We obtain:

    Theorem 4. Let (X1,...,Xn) be a random sample derived from a population X who has a continuous pdf f(x). Let p(0,1) and xp be the pquantile of X satisfying f(xp)>0 on a neighborhood of xp and the following three conditions hold,

    (i) The cdf F(x) of X has an inverse function G(x) satisfying

    |G(x)|BxQ(1x)Q (1.8)

    for some constants B>0,Q0 and all x(0,1).

    (ii) F(x) has m+1 bounded derivatives where m is a positive integer.

    (iii) Let i/n=p+O(n1) and ai:n=xp+O(n1) as n+.

    Then the following limiting result holds as n+

    E(f(xp)(Xi:nai:n)p(1p)/n)m=EZm+O(n1/2). (1.9)

    Remark 7. For the mean ¯Xn of the random sample (X1,...,Xn) of a population X whose moment EXm exists, according to conclusion (1.4), we see

    E(¯Xnμ)m=(σn)mEZm+o(nm/2),

    which indicates that the mth central moment of sample mean E(¯Xnμ)m is usually of infinitesimal O(nm/2).

    Here under the conditions of Theorem 4, if EXi,n=xp+O(n1) (we will verify in later section that for almost all continuous populations we may encounter, this assertion holds according to Theorem 2), then by Eq (1.9), we are sure that the central moment E(Xi:nEXi:m)m is also of an infinitesimal O(nm/2). Moreover, by putting ai:n=xp, we derive under the assumptions of Theorem 4 that

    E(f(xp)(Xi:nxp)p(1p)/n)m=EZm+O(n1/2).

    Similar to Remark 1, we can also show by Sandwich Theorem that

    E(f(xp)(mn,pxp)p(1p)/n)m=EZm+O(n1/2) (1.10)

    indicating that if we use the sample pquantile mn,p to estimate xp, the corresponding population pquantile, then E(mn,pxp)m=O(nm/2).

    For estimating a parameter of a population without an expectation, estimators based on functions of sample moments are always futile because of uncontrollable fluctuation. Alternatively, estimators obtained by some functions of OSs are usually workable. To find a desirable one of that kind, approximating some moment expressions of OSs is therefore significant. For instance, let a population X be distributed according to a pdf

    f(x,θ1,θ2)=θ2π[θ22+(xθ1)2],<x<+, (1.11)

    where constants θ2>0 and θ1 is unknown. Here x0.56=0.19076θ2+θ1 and x0.56+x0.44=2x0.5=2θ1. To estimate x0.5=θ1, we now compare estimators mn,0.5 and (mn,0.56+mn,0.44)/2. Under large sample size, we deduce according to conclusion (1.10) that

    E(mn,0.56+mn,0.442θ1)2=E((mn,0.56x0.56)+(mn,0.44x0.44)2)2E(mn,0.56x0.56)2+E(mn,0.44x0.44)22=0.44×0.56(f(x0.56))2n1+O(n3/2)=0.2554πθ2n1+O(n3/2),

    whereas

    E(mn,0.5θ1)2=0.785πθ2n1+O(n3/2).

    Obviously, both estimators mn,0.5 and (mn,0.56+mn,0.44)/2 are unbiased for θ1. For large n, the main part 0.2554πθ2n1 of the mean square error (MSE) E[(mn,0.56+mn,0.44)/2θ1]2 is even less than one-third of 0.785πθ2n1, the main part of the MSE E(mn,0.5θ1)2. That is the fundamental reason why Sen obtained in [8] the conclusion that the named optimum mid-range (mn,0.56+mn,0.44)/2 is more effective than the sample median mn,0.5 in estimating θ1.

    By statistical comparison of the scores presented in following Table 1 standing for 30 returns of closing prices of German Stock Index(DAX), Mahdizadeh and Zamanzade reasonably applied the previously mentioned Cauchy distribution (1.11) as a stock market return distribution with θ1 and θ2 being respectively estimated as ^θ1=0.0009629174 and ^θ2=0.003635871 (see [9]).

    Table 1.  Scores for 30 returns of closing prices of DAX.
    0.0011848 -0.0057591 -0.0051393 -0.0051781 0.0020043 0.0017787
    0.0026787 -0.0066238 -0.0047866 -0.0052497 0.0004985 0.0068006
    0.0016206 0.0007411 -0.0005060 0.0020992 -0.0056005 0.0110844
    -0.0009192 0.0019014 -0.0042364 0.0146814 -0.0002242 0.0024545
    -0.0003083 -0.0917876 0.0149552 0.0520705 0.0117482 0.0087458

     | Show Table
    DownLoad: CSV

    Now we utilize (mn,0.56+mn,0.44)/2 as a quick estimator of θ1 and derive a value 0.00105955 which roughly closes to the estimate value 0.0009629174 in reference [9].

    Even now there are many estimate problems (see [10] for a reference) dealing with situations when a population have no expectation, as above analysis, further study on moment convergence for some OSs may be promising.

    Lemma 1. (see [11] and [12]) For a random sequence {ξ1,ξ2,} converging in distribution to a RV ξ which we write as ξnDξ, if d>0 is a constant and the following uniform integrability holds

    limssupnE|ξn|dI|ξn|ds=0,

    then limnE|ξn|d=E|ξ|d and accordingly limnEξnd=Eξd.

    Remark 8. As discarding some definite number of terms from {ξ1,ξ2,} does not affect the conclusion limnE|ξn|d=E|ξ|d, the above condition lims+supnE|ξn|dI|ξn|ds=0 can be replaced by lims+supnME|ξdn|I|ξdn|s=0 for any positive constant M>0.

    Lemma 2. For p(0,1) and a random sample (ξ1,ξ2,,ξn) from a population possessing a continuous pdf f(x), if the p-quantile xp of the population satisfies f(xp)>0, then for the i-th OS ξi:n where i/n=p+o(1), we have ξi:nDxp.

    Proof. Obviously, the sequence {f(xp)(ξi:nxp)p(1p)/n,n=1,2,...} has an asymptotic standard normal distribution N(0,12), thus we see that the statistic ξi:n converges to xp in probability. That leads to the conclusion ξi:nDxp by the reason that, for a sequence of RVs, the convergence to a constant in probability is equivalent to the convergence in distribution.

    Clarification before presenting the proof:

    ● Under the assumption i/n=p+o(1) when n, we would better think of i as a function of n and use the symbol an instead of i. Nevertheless, for simplicity concern, we prefer no adjustment.

    ● Throughout our paper, C1, C2, are some suitable positive constants.

    As inp(0,1) when n, we only need care large numbers n,i and ni.

    Let an integer K>δq be given and M>0 be such a number that if nM, then all the following inequalities i1δq>0, niδq>0, niK>0 and i+Kn<v=1+p2 hold simultaneously. Here the existence of v in the last inequality is ensured by the fact i+Knp as n.

    According to Lemmas 1 and 2 as well as Remark 8, to prove Theorem 1 we only need to show that

    limsδ+supnME|Xδi:n|I|Xδi:n|sδ=0. (3.1)

    That is

    lims+supnM|u|s|u|δn!(i1)!(ni)!Fi1(u)f(u)[1F(u)]nidu=0.

    To show that equation, it suffices for us to prove respectively

    lims+supnM+s|u|δn!(i1)!(ni)!Fi1(u)f(u)[1F(u)]nidu=0

    and

    lims+supnMs|u|δn!(i1)!(ni)!Fi1(u)f(u)[1F(u)]nidu=0.

    Equivalently by putting x=F(u), we need to prove respectively

    limt1supnM1t|Gδ(x)|n!(i1)!(ni)!xi1(1x)nidx=0 (3.2)

    as well as

    limt0+supnMt0|Gδ(x)|n!(i1)!(ni)!xi1(1x)nidx=0.

    As both proofs are similar in fashion, we chose to prove the Eq (3.2) only. Actually, according to the given condition |G(x)|Bxq(1x)q, we see

    limt1supnM1t|Gδ(x)|n!(i1)!(ni)!xi1(1x)nidxBδlimt1supnM1tn!(i1)!(ni)!xi1δq(1x)niδqdxBδlimt1supnM1tn!(i1)!(ni)!(1x)niδqdxBδlimt1supnMn!(i1)!(ni)!(1t)niK(1t)K+1δqBδlimt1supnMn!(1t)niK(i1)!(ni)!C1limx0+supnMn!×ni!(ni)!xniK. (3.3)

    Here the positive number C1>0 exists because n/i=1/p+o(1) where p(0,1).

    Now applying the Stirling's formula n!=2πn(n/e)neθ12n where θ(0,1) (see [13]), we have

    limx0+supnMn!×ni!(ni)!xniKC2limx0+supnM2πn(n/e)n×n2πi(i/e)i2π(ni)((ni)/e)nixniKC3limx0+supnMnn×niini(ni)nixniK=C3limx0+supnMnnii(ni)ninnixniK=C3limx0+supnM1(in)i(1in)ninnixniK=C3limx0+supnM1[(in)in(1in)1in]nnnixniK. (3.4)

    Noting that

    (in)in(1in)1inpp(1p)1p,

    as n, we see that there exists a positive constant, say Q>0 such that

    (in)in(1in)1inQpp(1p)1p

    for all n. Consequently,

    limx0+supnM1[(in)in(1in)1in]nnnixniKlimx0+supnM1[Qpp(1p)1p]nnnixniKC4limx0+supnM1[Qpp(1p)1p]nnxniK. (3.5)

    Due to the assumptions \frac{i+K}{n} < v = \frac{1+p}{2} < 1 as n\geq M , we derive

    \begin{eqnarray} &&\mathop {\lim }\limits_{x \to 0 + } \mathop {\sup }\limits_{n\geq M} \frac{1}{{{{\left[ {Q{p^p}{{(1 - p)}^{1 - p}}} \right]}^n}}}\sqrt n {x^{n - i-K}}\\ &&\le \mathop {\lim }\limits_{x \to 0 + } \mathop {\sup }\limits_{n\geq M} \frac{1}{{{{\left[ {Q{p^p}{{(1 - p)}^{1 - p}}} \right]}^n}}}\sqrt n {x^{n - vn}}\\ && = \mathop {\lim }\limits_{x \to 0 + } \mathop {\sup }\limits_{n\geq M} {\left[ {\frac{{{x^{1 - v}}}}{{Q{p^p}{{(1 - p)}^{1 - p}}}}} \right]^n}\sqrt n\\ && \leq \mathop {\lim }\limits_{u \to 0 + } \mathop {\sup }\limits_{n\geq1} {u^n}\sqrt{n} . \end{eqnarray} (3.6)

    Finally, by the fact that if u > 0 is given sufficiently small, then the first term of the sequence \left\{ {{u^n}\sqrt n, n \ge 1} \right\} is the maximum, thus we can confirm

    \begin{eqnarray} \mathop {\lim }\limits_{u \to 0 + } \mathop {\sup }\limits_{n\geq 1} {u^{n}\sqrt{n}} = \mathop {\lim }\limits_{u \to 0 + } u = 0. \end{eqnarray} (3.7)

    Combining the five conclusions numbered from (3.3) to (3.7), we obtain Eq (3.2).

    Here we would like to assume U > 1 (or we may use U+2 instead of U ).

    By the reason interpreted in Remark 2 and according to condition (1.2), we see that there is a constant A > 0 satisfying

    \begin{eqnarray} \lvert G'''(x)\cdot x^{U}(1-x)^{U}\lvert\leq A. \end{eqnarray} (3.8)

    Now we define Y = F(X) and Y_{i:n} = F(X_{i:n}) or equivalently X = G(Y) and X_{i:n} = G(Y_{i, n}) , we have G(p) = x_p . Obviously, the conclusions in Remark 6 are workable here.

    By the Taylor expansion formula we have

    G(Y_{i:n}) = G(p)+G'(p)(Y_{i:n}-p)+\frac{G''(p)}{2!}(Y_{i:n}-p)^2+\frac{1}{3!}G'''(\xi)(Y_{i:n}-p)^3,

    where

    \xi\in(min(Y_{i:n}, p), max(Y_{i:n}, p)).

    Noting that almost surely 0 < min(Y_{i:n}, p) < \xi < max(Y_{i:n}, p) < 1 , we obtain

    \begin{eqnarray} &&\vert EG(Y_{i:n})-G(p)-G'(p)E(Y_{i:n}-p)-\frac{G''(p)}{2}E(Y_{i:n}-p)^2\vert\\ && = \vert E[\frac{G'''(\xi)}{3!}(Y_{i:n}-p)^3]\vert\leq\frac{1}{6}\vert E[A\xi^{-U}(1-\xi)^{-U}(Y_{i:n}-p)^3]\vert\\ &&\leq\frac{1}{6}\vert E\{A[p(1-p)]^{-U} Y_{i:n}^{-U}(1-Y_{i:n})^{-U}(Y_{i:n}-p)^3\}\vert\\ &&\leq\frac{1}{6}\vert E\{A[p(1-p)]^{-U}(Y_{i:n}-p)^3\}\vert\\ &&\leq \frac{1}{6}A[p(1-p)]^{-U}\sqrt{E(Y_{i:n}-p)^6} = O(n^{-3/2}) \end{eqnarray} (3.9)

    by Eq (3.8). Here the last step is in accordance to (1.7).

    Now we can draw the conclusion that

    \begin{eqnarray} EG(Y_{i:n})-G(p)-G'(p)E(Y_{i:n}-p)-\frac{1}{2}G''(p)E(Y_{i:n}-p)^2 = o(n^{-1}). \end{eqnarray} (3.10)

    That is

    \begin{eqnarray} EX_{i:n}-x_p-G'(p)(\frac{i}{n+1}-p)-\frac{1}{2}G''(p)E(Y_{i:n}-p)^2 = o(n^{-1}), \end{eqnarray} (3.11)

    provided i/n = p+O(n^{-1}) .

    Still according to conclusion (1.7), we have

    E(Y_{i:n}-p)^2 = O(n^{-1}).

    Finally, as i/n = p+O(n^{-1}) also guarantees i/(n+1)-p = O(n^{-1}) , we can complete the proof of E(X_{i:n}-x_p) = O(n^{-1}) or equivalently

    \vert E(X_{i:n}-x_p)\vert = O(n^{-1})

    by the assertion of (3.11).

    As EZ = 0 , the proposition holds when m = 1 , now we only consider the case of m\geq2 . By Theorem 1, we see EX_{i:n}^2\to x_{p}^{2} , therefore E\vert X_{s:j}\vert exists for some integer j and s\in\{1, ..., j\} and Theorem 3 is workable here when we put h(x) = x^m . We derive

    \begin{eqnarray} &&E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}\right)^m = \int_{-\infty}^{\infty}x^{m}d\left(\Phi(x)+\varphi(x)\sum\limits_{i = 1}^{m-1}n^{-i/2}S_{i, n}(x)\right)+O(n^{-m/2}) \\&& = EZ^{m}+\sum\limits_{i = 1}^{m-1}\left(n^{-i/2}\int_{-\infty}^{\infty}x^{m}d\left(\varphi(x)S_{i, n}(x)\right)\right)+O(n^{-m/2}). \end{eqnarray} (3.12)

    Moreover, for given positive integer m\geq2 , as the coefficients in polynomial S_{i, n}(x) are uniformly bounded over n and \varphi'(x) = -x \varphi(x) , the sequence of the integrals

    \left\{\int_{-\infty}^{\infty}x^{m}d\left(\varphi(x)S_{i, n}(x)\right), n = 1, 2, ...\right\}

    is also uniformly bounded over n . That indicates that

    \begin{eqnarray} E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}\right)^m = EZ^{m}+O(n^{-1/2}) \end{eqnarray} (3.13)

    according to conclusion (3.12).

    As a consequence, we can conclude that for explicitly given m\geq 2 the sequence

    \begin{eqnarray} \left\{E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}\right)^m, n = 1, 2, ...\right\} \end{eqnarray} (3.14)

    is uniformly bounded over n . Moreover, due to the inequality

    \left\lvert E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}\right)\right\lvert\leq \sqrt{E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}\right)^2},

    we see that the sequence

    \left\{E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}\right), n = 1, 2, ...\right\}

    is also uniformly bounded over n .

    Now that a_{i:n} = x_p+O(n^{-1}) , we complete the proof by the following reasoning

    \begin{eqnarray} &&E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-a_{i:n})}{\sqrt{p(1-p)}}\right)^m\\ && = E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}+\frac{n^{1/2}f(x_p)(x_p-a_{i:n})}{\sqrt{p(1-p)}}\right)^m\\ && = \sum\limits_{u = 0}^{m}\left[\binom{m}{u}\left(\frac{n^{1/2}f(x_p)(x_p-a_{i:n})}{\sqrt{p(1-p)}}\right)^{m-u}E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}\right)^u\right]\\ && = \sum\limits_{u = 2}^{m}\left[\binom{m}{u}\left(\frac{n^{1/2}f(x_p)(x_p-a_{i:n})}{\sqrt{p(1-p)}}\right)^{m-u}E\left(\frac{n^{1/2}f(x_p)(X_{i:n}-x_p)}{\sqrt{p(1-p)}}\right)^u\right]+O(n^{-1/2})\\ && = \sum\limits_{u = 2}^{m}\left[\binom{m}{u}\left(\frac{n^{1/2}f(x_p)(x_p-a_{i:n})}{\sqrt{p(1-p)}}\right)^{m-u}\left(EZ^{u}+O(n^{-1/2})\right)\right]+O(n^{-1/2})\\ && = EZ^{m}+O(n^{-1/2}). \end{eqnarray} (3.15)

    Now we consider the applicability of our theorems obtained so far. As other conditions can be trivially or similarly verified, here we mainly focus on the verification of condition (1.2).

    Example 1: Let the population X have a Cauchy distribution with a pdf f(y) = \frac{1}{\pi(1+y^2)}, -\infty < y < +\infty, correspondingly the inverse function of the cdf of X can be figured out to be

    G(x) = -\frac{1}{tan(\pi x)}, 0 < x < 1,

    satisfying

    \mathop {\lim }\limits_{x \to 0 + }G'''(x)x^5(1-x)^5 = \mathop {\lim }\limits_{x \to 1- }G'''(x)x^5(1-x)^5 = 0.

    Example 2: For X\sim f(x) = \frac{1}{x(\ln(x))^{2}}I_{[e, \infty)}(x) , we have

    G(x) = e^{\frac{1}{x-1}}I_{(0, 1)}(x),

    and

    \mathop {\lim }\limits_{x \to 0 + }G'''(x)x(1-x) = \mathop {\lim }\limits_{x \to 1- }G'''(x)x(1-x) = 0.

    Example 3: For X\sim N(0, 1^2) , on that occasion, f(y) = \frac{1}{\sqrt{2\pi}}e^{-\frac{y^2}{2}} , f'(y) = -yf(y) and y = G(x)\Leftrightarrow x = F(y) = \int_{ - \infty }^y {\frac{1}{{\sqrt {2\pi } }}{e^{ - \frac{{{{t }^2}}}{{2}}}}dt} , therefore, as x \to 0 + , we have

    \begin{eqnarray} \frac{{{{\left( {G(x)} \right)}^2}}} {{ - \ln \left( {x(1 - x)} \right)}} &\sim& \frac{{{{\left( {G(x)} \right)}^2}}} {{ - \ln x }} = \frac{{{y^2}}} {{ - \ln (F(y))}}\mathop \sim \limits^{y \to - \infty } \frac{{ - 2yF(y)}} {{f(y)}} \\ & = & - 2\left[\frac{(yF(y))'}{(f(y))'}\right] = -2\left[\frac{F(y)+y f(y)}{-y f(y)}\right] = -2\left[\frac{F(y)}{-y f(y)}-1\right]. \end{eqnarray}

    Noting that as x = F(y)\to 0+ or equivalently y\to-\infty ,

    \begin{eqnarray} \frac{F(y)}{-y f(y)}\sim\frac{f(y)}{-f(y)-y f'(y)} = \frac{f(y)}{-f(y)+y^2 f(y)} = \frac{1}{-1+y^2}\to 0, \end{eqnarray} (4.1)

    we have as x\to 0+ ,

    \frac{{{{\left( {G(x)} \right)}^2}}} {{ - \ln \left( {x(1 - x)} \right)}}\to 2.

    By the same fashion, we can show as x\to 1- that

    \begin{eqnarray} \frac{{{{\left( {G(x)} \right)}^2}}} {{ - \ln \left( {x(1 - x)} \right)}}\to 2. \end{eqnarray}

    In conclusion, for x\to 0+ as well as for x\to 1- ,

    \begin{eqnarray} {\left( {G(x)} \right)}^2\sim {{ - 2\ln \left( {x(1 - x)} \right)}}. \end{eqnarray} (4.2)

    Accordingly, there exists a positive M > 0 such that for all x\in (0, 1) ,

    \begin{eqnarray} {\left( {G(x)} \right)^2} \leq M\lvert {\ln (x(1 - x))}\lvert = -M {\ln (x(1 - x))}. \end{eqnarray} (4.3)

    No matter if x\to 0+ or x\to 1- , we get

    \begin{eqnarray} \lvert{G}'''(x) \lvert& = & \left\lvert\frac{{ - f''(y)f(y) + 3{{(f'(y))}^2}}} {{{{(f(y))}^5}}}\right\lvert = \left\lvert\frac{{ - (y^2-1){{\left( {f(y)} \right)}^2} + 3{{\left( { - yf(y)} \right)}^2}}} {{{{(f(y))}^5}}}\right\lvert \\ & = & \frac{{2y^2+1}} {{{{(f(y))}^3}}}\mathop \sim \limits^{\lvert y \lvert \to \infty } \frac{{2y^2}} {{{{(f(y))}^3}}} = 2\frac{{{{({G}(x))}^2}}} {{{{(f({G}(x)))}^3}}} \sim \frac{{ -4\ln (x(1 - x))}} {{{{(f({G}(x)))}^3}}}. \end{eqnarray} (4.4)

    Here the last step holds in accordance to Eq (4.2).

    For x\to 0+ as well as for x\to 1- ,

    \begin{eqnarray} \frac{{ -4\ln (x(1 - x))}} {{{{(f({G}(x)))}^3}}}& = &4\frac{{ { - \ln (x(1 - x))}}} {{{{\left( {\frac{1} {{\sqrt {2\pi } }}} \right)}^3}\exp ( - \frac{{3{{\left( {{G}(x)} \right)}^2}}} {{2}})}} = \frac{4(\sqrt {2\pi })^3 \left[- \ln (x(1 - x))\right]} {{\exp \left(- \frac{{3{{( {{G}(x)} )}^2}}} {{2}}\right)}} \\ & = & 4(\sqrt {2\pi })^3\left[- \ln (x(1 - x))\right] {{\left[\exp \left( {{{( {{G}(x)} )}^2}} \right)\right]^\frac{3}{{4}}}} \\ &\leq& 4(\sqrt {2\pi })^3\left[- \ln (x(1 - x))\right] {{\left[\exp \left( -M {\ln (x(1 - x))} \right)\right]^\frac{3}{{4}}}} \\ & = & 4(\sqrt {2\pi })^3\left[- \ln (x(1 - x))\right] {{\left(x(1 - x)\right)^\frac{-3M}{{4}}}}. \end{eqnarray} (4.5)

    Thus we can see the achievement of condition (1.2) by

    \begin{eqnarray} \mathop {\lim }\limits_{x\to 0+} \left(G'''(x)\cdot x^{M}(1-x)^{M}\right) = \mathop {\lim }\limits_{x\to 1-} \left(G'''(x)\cdot x^{M}(1-x)^{M}\right) = 0. \end{eqnarray} (4.6)

    Remark 9. For a RV X with a cdf F(x) possessing an inverse function G(x) , we can prove that if \sigma > 0 and \mu\in(-\infty, +\infty) are constants, then the cdf of the RV \sigma X+\mu will have an inverse function \sigma G(x)+\mu . Thus for the general case X\sim N(\mu, \sigma^2) , we can still verify the condition (1.2).

    Example 4: For a population X\sim U[a, b] , G(x) = (b-a)x+a is the inverse function of the cdf of X . As G^{'''}(x) = 0 , the assumption of condition (1.2) holds.

    Generally, for any population distributed over an interval [a, b] according to a continuous pdf f(x) , if G{'''}(0+) and G{'''}(1-) exist, then the condition (1.2) holds.

    For length concern, here we only point out without detailed proof that for a population X according to a distribution such as Gamma distribution (including special cases such as the Exponential and the Chi-square distributions) and beta distribution and so on, the requirement of condition (1.2) can be satisfied.

    For a random sample (X_1, ..., X_n) derived from a population X which is uniformly distributed over the interval [0, 1] , the moment of the i- th OS EX_{i:n} = i/(n+1)\to p if i/n\to p\in(0, 1) as n\to \infty . Let a_{i:n} = i/n . According to conclusion (1.9) where f(x_p) = 1 and x_p = p\in(0, 1) , we have for integer m\geq2 ,

    \begin{eqnarray} E\left(X_{i:n}-a_{i:n}\right)^m& = &\int_{0}^{1}\frac{(x-\frac{i}{n})^{m}n!}{(i-1)!(n-i)!}x^{i-1}(1-x)^{n-i}dx+o(n^{-m/2})\\ & = & EZ^{m}\left(p(1-p)\right)^{\frac{m}{2}}n^{-\frac{m}{2}}+o(n^{-m/2}). \end{eqnarray} (4.7)

    That results in

    \begin{eqnarray} \frac{n!\int_{0}^{1}(nx-i)^{m}x^{i-1}(1-x)^{n-i}dx}{(i-1)!(n-i)!n^m} = EZ^{m}(p-p^2)^{\frac{m}{2}}n^{-\frac{m}{2}}+o(n^{-m/2}), \end{eqnarray} (4.8)

    or equivalently

    \begin{eqnarray} \frac{n!\sum\limits_{j = 0}^{m}[\binom{m}{j}n^{j}(-i)^{m-j} B(i+j, n+1-i)]}{(i-1)!(n-i)!n^m} = EZ^{m}(p-p^2)^{\frac{m}{2}}n^{-\frac{m}{2}}+o(n^{-m/2}). \end{eqnarray}

    Consequently we have the following equation

    \begin{eqnarray} \frac{n!\sum\limits_{j = 0}^{m}[\binom{m}{j}n^{j}(-i)^{m-j} \frac{\Gamma(i+j)\Gamma(n+1-i)}{\Gamma(i+j+n+1-i)}]}{(i-1)!(n-i)!n^m} = EZ^{m}(p-p^2)^{\frac{m}{2}}n^{-\frac{m}{2}}+o(n^{-m/2}), \end{eqnarray}

    which yields

    \begin{eqnarray} \frac{n!\sum\limits_{j = 0}^{m}[\binom{m}{j}n^{j}(-i)^{m-j} \frac{(i-1+j)!}{(n+j)!}]}{(i-1)!n^m} = EZ^{m}(p-p^2)^{\frac{m}{2}}n^{-\frac{m}{2}}+o(n^{-m/2}). \end{eqnarray} (4.9)

    As i/n\to p\in(0, 1) when n\to+\infty , the above equation indicates that

    \begin{eqnarray} \frac{\sum\limits_{j = 0}^{m}[\binom{m}{j}n^{j}(-i)^{m-j} \frac{(i-1+j)!(n+m)!}{(i-1)!(n+j)!}]}{n^{2m}} = EZ^{m}(p-p^2)^{\frac{m}{2}}n^{-\frac{m}{2}}+o(n^{-m/2}). \end{eqnarray} (4.10)

    For convenience sake, now we denote \sum_{k = u}^{v} = 0 and \prod_{k = u}^{v} = 1 if v < u . Noting for given explicit integers m\geq2 and j\in\{0, 1, ..., m\} the expression

    \begin{eqnarray} \binom{m}{j}n^{j}(-i)^{m-j} \frac{(i-1+j)!(n+m)!}{(i-1)!(n+j)!} = \binom{m}{j}(-1)^{m-j}\left(i^{m-j} \prod\limits_{k = 1}^{j}[(i-1)+k]\right) \left(n^{j}\prod\limits_{k = j+1}^{m}(n+k)\right) \end{eqnarray} (4.11)

    is a multinomial of i and n . We see that the nominator of the LHS of Eq (4.10) is also a multinomial which we now denote as

    \sum\limits_{j = 0}^{m}\left[\binom{m}{j}n^{j}(-i)^{m-j} \frac{(i-1+j)!(n+m)!}{(i-1)!(n+j)!}\right]: = \sum\limits_{s = 0}^{m}\sum\limits_{t = 0}^{m}a_{s, t}^{(m)}i^{m-s}n^{m-t}.

    Equivalently, we derive

    \begin{eqnarray} \label{ndnt} \sum\limits_{j = 0}^{m}\left\{\binom{m}{j}(-1)^{m-j}[i^{m-j} \prod\limits_{k = 1}^{j}(i-1+k)] [n^{j}\prod\limits_{k = j+1}^{m}(n+k)]\right\} = \sum\limits_{k = 0}^{2m}\sum\limits_{s+t = k}a_{s, t}^{(m)}i^{m-s}n^{m-t}. \end{eqnarray}

    By Eq (4.10), we see for any given p\in(0, 1) , if i/n\to p\in(0, 1) as n\to+\infty , then

    \begin{eqnarray} \frac{\sum\nolimits_{k = 0}^{2m}\sum\nolimits_{s+t = k}a_{s, t}^{(m)}i^{m-s}n^{m-t}}{n^{3m/2}} = EZ^{m}\left(p(1-p)\right)^{\frac{m}{2}}+o(1). \end{eqnarray} (4.12)

    Noting that

    \sum\limits_{s+t = k}a_{s, t}^{(m)}i^{m-s}n^{m-t} = \left(\sum\limits_{s+t = k}a_{s, t}^{(m)}p^{m-s}\right)n^{2m-k}+o(n^{2m-k}),

    we see in accordance to (4.12) that

    \begin{eqnarray} \frac{\sum\nolimits_{k = 0}^{2m}[(\sum\nolimits_{s+t = k}a_{s, t}^{(m)}p^{m-s})n^{2m-k}+o(n^{2m-k})]}{n^{3m/2}} = EZ^{m}(p-p^2)^{\frac{m}{2}}+o(1). \end{eqnarray} (4.13)

    That indicates that if a non-negative integer k satisfies 2m-k > 3m/2 , or equivalently 0\leq k < m/2 , then the coefficient of n^{2m-k} in the nominator of LHS of Eq (4.13) must be zero for any given p\in(0, 1) , namely

    \sum\limits_{s+t = k}a_{s, t}^{(m)}p^{m-s} = 0, s+t = k < m/2

    holds for any p\in (0, 1) . Thereby, for the case of non-negative integers s and t satisfying s+t = k < m/2 , we see that the equation a_{s, t}^{(m)} = 0 surely holds.

    It is funny to notice that for big m , we immediately have the following three corresponding equations

    \sum\limits_{j = 0}^{m}(-1)^{m-j}\binom{m}{j} = 0,
    \sum\limits_{j = 2}^{m}\binom{m}{j} (-1)^{m-j}\frac{j(j-1)}{2} = 0,

    and

    \sum\limits_{j = 2}^{m-1}\binom{m}{j}(-1)^{m-j}\frac{j(j-1)}{2}\frac{(m-j)(m+j+1)}{2} = 0,

    according to the conclusions a_{0, 0}^{(m)} = 0 , a_{1, 0}^{(m)} = 0 and a_{1, 1}^{(m)} = 0 .

    As for the structure of a_{s, t}^{(m)} when s\geq2 , t\geq1 and m > 2(s+t) , obviously s < m-t holds on this occasion and the term a_{s, t}^{(m)}i^{m-s}n^{m-t} in the multinomial

    \begin{eqnarray} &&\sum\limits_{j = 0}^{m}\left\{\binom{m}{j}(-1)^{m-j}[i^{m-j} \prod\limits_{k = 1}^{j}(i-1+k)][n^{j}\prod\limits_{k = j+1}^{m}(n+k)]\right\}\\&& = \sum\limits_{j = 0}^{m}\left\{\binom{m}{j}(-1)^{m-j}[i^{m-j} \prod\limits_{k = 0}^{j-1}(i+k)][n^{j}\prod\limits_{k = j+1}^{m}(n+k)]\right\}\\&& = \sum\limits_{j = 0}^{m}\left\{\binom{m}{j}(-1)^{m-j}[i^{m-j+1} \prod\limits_{k = 1}^{j-1}(i+k)][n^{j}\prod\limits_{k = j+1}^{m}(n+k)]\right\}\\ && = (\sum\limits_{j = 0}^{s}+\sum\limits_{j = s+1}^{m-t}+\sum\limits_{j = m-t+1}^{m})\left\{\binom{m}{j}(-1)^{m-j}[i^{m-j+1} \prod\limits_{k = 1}^{j-1}(i+k)][n^{j}\prod\limits_{k = j+1}^{m}(n+k)]\right\} \end{eqnarray}

    is also the term a_{s, t}^{(m)}i^{m-s}n^{m-t} in the multinomial

    \begin{eqnarray} &&\sum\limits_{j = s+1}^{m-t}\left\{\binom{m}{j}(-1)^{m-j}[i^{m-j+1} \prod\limits_{k = 1}^{j-1}(i+k)][n^{j}\prod\limits_{k = j+1}^{m}(n+k)]\right\}. \end{eqnarray}

    Noting for given j\in\{s, ..., m-t\} , the monomial

    \left(\sum\limits_{1\leq u_{1} < u_{2} < ... < u_{s}\leq j-1}u_{1} u_{2} ...r_{s}\right)i^{m-s}

    is the term with degree m-s in the polynomial of i

    [i^{m-j+1} \prod\limits_{k = 1}^{j-1}(i+k)],

    while the monomial

    \left(\sum\limits_{j+1\leq v_{1} < v_{2} < ... < v_{t}\leq m}v_{1}v_{2}...v_{t}\right)n^{m-t}

    is the term with degree m-t in the polynomial of n

    [n^{j}\prod\limits_{k = j+1}^{m}(n+k)],

    we see for s+t < m/2 ,

    a_{s, t}^{(m)} = \sum\limits_{j = s+1}^{m-t}\left(\binom{m}{j}(-1)^{m-j}\sum\limits_{1\leq u_1 < ... < u_{s}\leq j-1}u_1 ...u_{s}\sum\limits_{j+1\leq v_1 < ... < v_t\leq m}v_{1}...v_{t}\right).

    Now that a_{s, t}^{m} = 0 holds provided s+t = k < m/2 according to Eq (4.13), we conclude the following Theorem.

    Theorem 5. If s , t and m are integers satisfying s\geq2 , t\geq1 and m > 2(s+t) , then

    \sum\limits_{j = s+1}^{m-t}\left(\binom{m}{j}(-1)^{m-j}\sum\limits_{1\leq u_1 < u_2 < ... < u_{s}\leq j-1}u_1 ...u_{s}\sum\limits_{j+1\leq v_1 < v_2 < ... < v_t\leq m}v_{1}...v_{t}\right) = 0.

    Example 5: For big integer m , according to Theorem 5, we have a_{2, 1}^{(m)} = 0 and a_{2, 2}^{(m)} = 0 . Correspondingly, we obtain equations

    \begin{eqnarray} \sum\limits_{j = 3}^{m-1}\left(\binom{m}{j}(-1)^{m-j}\frac{(\sum\limits_{i = 1}^{j-1}i)^2-(\sum\limits_{i = 1}^{j-1}i^2)}{2} \frac{(m+j+1)(m-j)}{2}\right) = 0, \end{eqnarray}

    and

    \begin{eqnarray} \sum\limits_{j = 3}^{m-2}\left(\binom{m}{j}(-1)^{m-j}\frac{(\sum\limits_{i = 1}^{j-1}i)^2-(\sum\limits_{i = 1}^{j-1}i^2)}{2} \frac{(\sum\limits_{i = j+1}^{m}i)^2-(\sum\limits_{i = j+1}^{m}i^2)}{2}\right) = 0. \end{eqnarray}

    Both equations can be verified by the aid of Maple software.

    Let real \delta > 0 and integer m > 0 be given. For a population satisfying condition (1.1), no matter if the population has an expectation or not, the moment of X_{i:n}^{\delta} exists and the sequence \{EX_{i:n}^{\delta}, n\geq1\} converges for large i and n satisfying i/n\to p\in(0, 1) . Under some further trivial assumptions, for large integer n the m- th moment of the standardized sequence \{X_{i:n}, n\geq1\} can be approximated by the m- th moment of a standard normal distribution EZ^m .

    Due to the fact that the existence requirement of some expectation X_{s:j} in Theorem 3 has always been hard to be verified for a population without an expectation, for a long time, real-life world data corresponding to that population of interest has been unavailable in the vast majority of references. Now that the alternative condition (1.8) is presented, maybe things will improve in the future and we still have a long way to go.

    This work was supported by the Science and Technology Plan Projects of Jiangxi Provincial Education Department, grant number GJJ180891.

    There exists no conflict of interest between authors.



    [1] T. Koshy, Fibonacci and Lucas numbers with applications, John Wiley & Sons, 2011.
    [2] U. K. Dutta, P. K. Ray, On the finite reciprocal sums of Fibonacci and Lucas polynomials, AIMS Mathematics, 4 (2019), 1569–1581. https://doi.org/10.3934/math.2019.6.1569 doi: 10.3934/math.2019.6.1569
    [3] W. C. Chu, N. N. Li, Power sums of Fibonacci and Lucas numbers, Quaest. Math., 34 (2011), 75–83. https://doi.org/10.2989/16073606.2011.570298 doi: 10.2989/16073606.2011.570298
    [4] R. Battaloglu, Y. Simsek, On new formulas of Fibonacci and Lucas numbers involving golden ratio associated with atomic structure in chemistry, Symmetry, 13 (2021), 1334. https://doi.org/10.3390/sym13081334 doi: 10.3390/sym13081334
    [5] V. E. Hoggatt, M. Bicknell, Roots of Fibonacci polynomials, Fibonacci Quart., 11 (1973), 271–274.
    [6] Y. K. Ma, W. P. Zhang, Some identities involving Fibonacci polynomials and Fibonacci numbers, Mathematics, 6 (2018), 334. https://doi.org/10.3390/math6120334 doi: 10.3390/math6120334
    [7] P. Trojovskỳ, Fibonacci numbers with a prescribed block of digits, Mathematics, 8 (2020), 639. https://doi.org/10.3390/math8040639 doi: 10.3390/math8040639
    [8] W. M. Abd-Elhameed, Y. H. Youssri, N. El-Sissi, M. Sadek, New hypergeometric connection formulae between Fibonacci and Chebyshev polynomials, Ramanujan J., 42 (2017), 347–361. https://doi.org/10.1007/s11139-015-9712-x doi: 10.1007/s11139-015-9712-x
    [9] W. M. Abd-Elhameed, N. A. Zeyada, New formulas including convolution, connection and radicals formulas of k-Fibonacci and k-Lucas polynomials, Indian J. Pure Appl. Math., 2022. https://doi.org/10.1007/s13226-021-00214-5
    [10] J. B. Muskat, Generalized Fibonacci and Lucas sequences and rootfinding methods, Math. Comp., 61 (1993), 365–372. https://doi.org/10.1090/S0025-5718-1993-1192974-3 doi: 10.1090/S0025-5718-1993-1192974-3
    [11] P. Trojovskỳ, On terms of generalized Fibonacci sequences which are powers of their indexes, Mathematics, 7 (2019), 700. https://doi.org/10.3390/math7080700 doi: 10.3390/math7080700
    [12] E. Özkan, İ Altun, A. Göçer, On relationship among a new family of k-Fibonacci, k-Lucas numbers, Fibonacci and Lucas numbers, Chiang Mai J. Sci., 44 (2017), 1744–1750.
    [13] H. H. Gulec, N. Taskara, K. Uslu, A new approach to generalized Fibonacci and Lucas numbers with binomial coefficients, Appl. Math. Comput., 220 (2013), 482–486. https://doi.org/10.1016/j.amc.2013.05.043 doi: 10.1016/j.amc.2013.05.043
    [14] Y. Yazlik, N. Taskara, A note on generalized-Horadam sequence, Comput. Math. Appl., 63 (2012), 36–41. https://doi.org/10.1016/j.camwa.2011.10.055 doi: 10.1016/j.camwa.2011.10.055
    [15] P. K. Ray, Identities concerning k-balancing and k-Lucas-balancing numbers of arithmetic indexes, AIMS Mathematics, 4 (2019), 308–315. https://doi.org/10.3934/math.2018.2.308 doi: 10.3934/math.2018.2.308
    [16] O. Yayenie, A note on generalized Fibonacci sequences, Appl. Math. Comput., 217 (2011), 5603–5611. https://doi.org/10.1016/j.amc.2010.12.038 doi: 10.1016/j.amc.2010.12.038
    [17] A. P. Chaves, P. Trojovskỳ, A quadratic Diophantine equation involving generalized Fibonacci numbers, Mathematics, 8 (2020), 1010. https://doi.org/10.3390/math8061010 doi: 10.3390/math8061010
    [18] D. Andrica, O. Bagdasar, Pseudoprimality related to the generalized Lucas sequences, Math. Comput. Simulat., 2021. (In press). https://doi.org/10.1016/j.matcom.2021.03.003
    [19] D. Andrica, O. Bagdasar, On some new arithmetic properties of the generalized Lucas sequences, Mediterr. J. Math., 18 (2021), 47. https://doi.org/10.1007/s00009-020-01653-w doi: 10.1007/s00009-020-01653-w
    [20] U. Bednarz, M. Wołowiec-Musiał, Distance Fibonacci polynomials, Symmetry, 12 (2020), 1540. https://doi.org/10.3390/sym12091540 doi: 10.3390/sym12091540
    [21] Y. Choo, On the reciprocal sums of products of balancing and Lucas-balancing numbers, Mathematics, 9 (2021), 350. https://doi.org/10.3390/math9040350 doi: 10.3390/math9040350
    [22] S. Çelik, I. Durukan, E. Özkan, New recurrences on Pell numbers, Pell-Lucas numbers, Jacobsthal numbers, and Jacobsthal-Lucas numbers, Chaos Soliton. Fract., 150 (2021), 111173. https://doi.org/10.1016/j.chaos.2021.111173 doi: 10.1016/j.chaos.2021.111173
    [23] P. Trojovskỳ, S. Hubálovskỳ, Some Diophantine problems related to k-Fibonacci numbers, Mathematics, 8 (2020), 1047. https://doi.org/10.3390/math8071047 doi: 10.3390/math8071047
    [24] E. Tchammou, A. Togbé, On some Diophantine equations involving balancing numbers, Arch. Math., 57 (2021), 113–130. https://doi.org/10.5817/AM2021-2-113 doi: 10.5817/AM2021-2-113
    [25] J. J. Bravo, J. L. Herrera, F. Luca, On a generalization of the Pell sequence, Math. Bohem., 146 (2021), 199–213. https://doi.org/10.21136/MB.2020.0098-19 doi: 10.21136/MB.2020.0098-19
    [26] W. M. Abd-Elhameed, Y. H. Youssri, A novel operational matrix of Caputo fractional derivatives of Fibonacci polynomials: Spectral solutions of fractional differential equations, Entropy, 18 (2016), 345. https://doi.org/10.3390/e18100345 doi: 10.3390/e18100345
    [27] W. M. Abd-Elhameed, Y. H. Youssri, Spectral tau algorithm for certain coupled system of fractional differential equations via generalized Fibonacci polynomial sequence, Iran. J. Sci. Technol. Trans. Sci., 43 (2019), 543–554. https://doi.org/10.1007/s40995-017-0420-9 doi: 10.1007/s40995-017-0420-9
    [28] W. M. Abd-Elhameed, Y. H Youssri, Generalized Lucas polynomial sequence approach for fractional differential equations, Nonlinear Dyn., 89 (2017), 1341–1355. https://doi.org/10.1007/s11071-017-3519-9 doi: 10.1007/s11071-017-3519-9
    [29] W. M. Abd-Elhameed, Y. H. Youssri, Spectral solutions for fractional differential equations via a novel Lucas operational matrix of fractional derivatives, Rom. J. Phys., 61 (2016), 795–813.
    [30] M. Irfan, F. A. Shah, Fibonacci wavelet method for solving the time-fractional bioheat transfer model, Optik, 241 (2021), 167084. https://doi.org/10.1016/j.ijleo.2021.167084 doi: 10.1016/j.ijleo.2021.167084
    [31] B. P. Moghaddam, A. Dabiri, A. M. Lopes, J. A. T. Machado, Numerical solution of mixed-type fractional functional differential equations using modified Lucas polynomials, Comput. Appl. Math., 38 (2019), 46. https://doi.org/10.1007/s40314-019-0813-9 doi: 10.1007/s40314-019-0813-9
    [32] Y. H. Youssri, W. M. Abd-Elhameed, A. S. Mohamed, S. M. Sayed, Generalized Lucas polynomial sequence treatment of fractional pantograph differential equation, Int. J. Appl. Comput. Math., 7 (2021), 27. https://doi.org/10.1007/s40819-021-00958-y doi: 10.1007/s40819-021-00958-y
    [33] W. M. Abd-Elhameed, N. A. Zeyada, New identities involving generalized Fibonacci and generalized Lucas numbers, Ind. J. Pure Appl. Math., 49 (2018), 527–537. https://doi.org/10.1007/s13226-018-0282-7 doi: 10.1007/s13226-018-0282-7
    [34] B. Sury, A polynomial parent to a Fibonacci–Lucas relation, Am. Math. Mon., 121 (2014), 236. https://doi.org/10.4169/amer.math.monthly.121.03.236 doi: 10.4169/amer.math.monthly.121.03.236
    [35] D. Marques, A new Fibonacci–Lucas relation, Am. Math. Mon., 122 (2015), 683.
    [36] W. M. Abd-Elhameed, N. A. Zeyada, A generalization of generalized Fibonacci and generalized Pell numbers, Int. J. Math. Edu. Sci. Technol., 48 (2017), 102–107. https://doi.org/10.1080/0020739X.2016.1170900 doi: 10.1080/0020739X.2016.1170900
    [37] A. F. Horadam, Basic properties of a certain generalized sequence of numbers, Fibonacci Quart., 3 (1965), 161–176.
    [38] A. F. Horadam, Generating functions for powers of a certain generalised sequence of numbers, Duke Math. J., 32 (1965), 437–446. https://doi.org/ 10.1215/S0012-7094-65-03244-8 doi: 10.1215/S0012-7094-65-03244-8
    [39] H. Feng, Z. Z. Zhang, Computational formulas for convoluted generalized Fibonacci and Lucas numbers, Fibonacci Quart., 41 (2003), 144–151.
    [40] R. Melham, Generalizations of some identities of Long, Fibonacci Quart., 37 (1999), 106–110.
    [41] A. F. Horadam, Associated sequences of general order, Fibonacci Quart., 31 (1993), 166–172.
    [42] W. Koepf, Hypergeometric summation, an algorithmic approach to summation and special function identities, 2 Eds., Springer Universitext Series, 2014.
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2126) PDF downloads(115) Cited by(5)

Figures and Tables

Tables(1)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog