In this paper, strong laws of large numbers for weighted sums of ■-mixing sequence are investigated. Our results extend the corresponding results for negatively associated sequence to the case of ■-mixing sequence.
Utilizing translation operators we get the powers sums on arithmetic progressions and the Bernoulli polynomials of order munder the form of differential operators acting on monomials. It follows that (d/dn-d/dz) appli...Utilizing translation operators we get the powers sums on arithmetic progressions and the Bernoulli polynomials of order munder the form of differential operators acting on monomials. It follows that (d/dn-d/dz) applied on a power sum has a meaning and is exactly equal to the Bernoulli polynomial of the same order. From this new property we get the formula giving powers sums in term of sums of successive derivatives of Bernoulli polynomial multiplied withprimitives of the same order of n. Then by changing the two arguments z,n into Z=z(z-1), λ where λ designed the 1st order power sums and proving that Bernoulli polynomials of odd order vanish for arguments equal to 0, 1/2, 1, we obtain easily the Faulhaber formula for powers sums in term of polynomials in λ having coefficients depending on Z. These coefficients are found to be derivatives of odd powers sums on integers expressed in Z. By the way we obtain the link between Faulhaber formulae for powers sums on integers and on arithmetic progressions. To complete the work we propose tables for calculating in easiest manners possibly the Bernoulli numbers, the Bernoulli polynomials, the powers sums and the Faulhaber formula for powers sums.展开更多
In this paper we present some identities for the sums of squares of Fibonacci and Lucas numbers with consecutive primes, using maximal prime gap G(x)~log2x, as indices.
In this article we shall examine several different types of figurative numbers which have been studied extensively over the period of 2500 years, and currently scattered on hundreds of websites. We shall discuss their...In this article we shall examine several different types of figurative numbers which have been studied extensively over the period of 2500 years, and currently scattered on hundreds of websites. We shall discuss their computation through simple recurrence relations, patterns and properties, and mutual relationships which have led to curious results in the field of elementary number theory. Further, for each type of figurative numbers we shall show that the addition of first finite numbers and infinite addition of their inverses often require new/strange techniques. We sincerely hope that besides experts, students and teachers of mathematics will also be benefited with this article.展开更多
Polygonal numbers and sums of squares of primes are distinct fields of number theory. Here we consider sums of squares of consecutive (of order and rank) polygonal numbers. We try to express sums of squares of polygon...Polygonal numbers and sums of squares of primes are distinct fields of number theory. Here we consider sums of squares of consecutive (of order and rank) polygonal numbers. We try to express sums of squares of polygonal numbers of consecutive orders in matrix form. We also try to find the solution of a Diophantine equation in terms of polygonal numbers.展开更多
Let the numbers be defined by , where and are the exponential complete Bell polynomials. In this paper, by means of the methods of Riordan arrays, we establish general identities involving the numbers , binomial coeff...Let the numbers be defined by , where and are the exponential complete Bell polynomials. In this paper, by means of the methods of Riordan arrays, we establish general identities involving the numbers , binomial coefficients and inverse of binomial coefficients. From these identities, we deduce some identities involving binomial coefficients, Harmonic numbers and the Euler sum identities. Furthermore, we obtain the asymptotic values of some summations associated with the numbers by Darboux’s method.展开更多
Utilizing the translation operator to represent Bernoulli polynomials and power sums as polynomials of Sheffer-type, we obtain concisely almost all their known properties as so as many new ones, especially new recursi...Utilizing the translation operator to represent Bernoulli polynomials and power sums as polynomials of Sheffer-type, we obtain concisely almost all their known properties as so as many new ones, especially new recursion relations for calculating Bernoulli polynomials and numbers, new formulae for obtaining power sums of entire and complex numbers. Then by the change of arguments from z into Z = z(z-1) and n into λ which is the 1<sup>st</sup> order power sum we obtain the Faulhaber formula for powers sums in term of polynomials in λ having coefficients depending on Z. Practically we give tables for calculating in easiest possible manners, the Bernoulli numbers, polynomials, the general powers sums.展开更多
最近,Takashi Agoh对于素数p≡1(mod4)给出了计算二次域Q(p^(1/2))的类数h的一个公式,此公式仅依赖于Q(p^(1/2))的基本单位ε,素数p以及数a=1+sum from k=1 to(p-1)/2((-1)~kN_K).孙琦教授对奇素数p,得到N_k的若干性质和计算N_2,N_3,N_...最近,Takashi Agoh对于素数p≡1(mod4)给出了计算二次域Q(p^(1/2))的类数h的一个公式,此公式仅依赖于Q(p^(1/2))的基本单位ε,素数p以及数a=1+sum from k=1 to(p-1)/2((-1)~kN_K).孙琦教授对奇素数p,得到N_k的若干性质和计算N_2,N_3,N_4的公式.本文对奇素数p,得到N_k的若干新性质和N_5,N_6的计算公式,展开更多
Zhao (2003a) first established a congruence for any odd prime p>3, S(1,1,1;p)≡-2Bp-3 (mod p), which holds when p=3 evidently. In this paper, we consider finite triple harmonic sum S(α,β,γ;p) (mod p) is consider...Zhao (2003a) first established a congruence for any odd prime p>3, S(1,1,1;p)≡-2Bp-3 (mod p), which holds when p=3 evidently. In this paper, we consider finite triple harmonic sum S(α,β,γ;p) (mod p) is considered for all positive integers α,β,γ. We refer to w=α+β+γ as the weight of the sum, and show that if w is even, S(α,β,γ;p)≡0 (mod p) for p≥w+3; if w is odd, S(α,β,γ;p)≡rBp≥w (mod p) for p≥w, here r is an explicit rational number independent of p. A congruence of Catalan number is obtained as a special case.展开更多
基金Foundation item： Supported by the National Natural Science Foundation of China（11171001, 11201001） Supported by the Natural Science Foundation of Anhui Province（t208085QA03, 1308085QA03）
文摘In this paper, strong laws of large numbers for weighted sums of ■-mixing sequence are investigated. Our results extend the corresponding results for negatively associated sequence to the case of ■-mixing sequence.
文摘Utilizing translation operators we get the powers sums on arithmetic progressions and the Bernoulli polynomials of order munder the form of differential operators acting on monomials. It follows that (d/dn-d/dz) applied on a power sum has a meaning and is exactly equal to the Bernoulli polynomial of the same order. From this new property we get the formula giving powers sums in term of sums of successive derivatives of Bernoulli polynomial multiplied withprimitives of the same order of n. Then by changing the two arguments z,n into Z=z(z-1), λ where λ designed the 1st order power sums and proving that Bernoulli polynomials of odd order vanish for arguments equal to 0, 1/2, 1, we obtain easily the Faulhaber formula for powers sums in term of polynomials in λ having coefficients depending on Z. These coefficients are found to be derivatives of odd powers sums on integers expressed in Z. By the way we obtain the link between Faulhaber formulae for powers sums on integers and on arithmetic progressions. To complete the work we propose tables for calculating in easiest manners possibly the Bernoulli numbers, the Bernoulli polynomials, the powers sums and the Faulhaber formula for powers sums.
文摘In this paper we present some identities for the sums of squares of Fibonacci and Lucas numbers with consecutive primes, using maximal prime gap G(x)~log2x, as indices.
文摘In this article we shall examine several different types of figurative numbers which have been studied extensively over the period of 2500 years, and currently scattered on hundreds of websites. We shall discuss their computation through simple recurrence relations, patterns and properties, and mutual relationships which have led to curious results in the field of elementary number theory. Further, for each type of figurative numbers we shall show that the addition of first finite numbers and infinite addition of their inverses often require new/strange techniques. We sincerely hope that besides experts, students and teachers of mathematics will also be benefited with this article.
文摘Polygonal numbers and sums of squares of primes are distinct fields of number theory. Here we consider sums of squares of consecutive (of order and rank) polygonal numbers. We try to express sums of squares of polygonal numbers of consecutive orders in matrix form. We also try to find the solution of a Diophantine equation in terms of polygonal numbers.
文摘Let the numbers be defined by , where and are the exponential complete Bell polynomials. In this paper, by means of the methods of Riordan arrays, we establish general identities involving the numbers , binomial coefficients and inverse of binomial coefficients. From these identities, we deduce some identities involving binomial coefficients, Harmonic numbers and the Euler sum identities. Furthermore, we obtain the asymptotic values of some summations associated with the numbers by Darboux’s method.
文摘Utilizing the translation operator to represent Bernoulli polynomials and power sums as polynomials of Sheffer-type, we obtain concisely almost all their known properties as so as many new ones, especially new recursion relations for calculating Bernoulli polynomials and numbers, new formulae for obtaining power sums of entire and complex numbers. Then by the change of arguments from z into Z = z(z-1) and n into λ which is the 1<sup>st</sup> order power sum we obtain the Faulhaber formula for powers sums in term of polynomials in λ having coefficients depending on Z. Practically we give tables for calculating in easiest possible manners, the Bernoulli numbers, polynomials, the general powers sums.
文摘最近,Takashi Agoh对于素数p≡1(mod4)给出了计算二次域Q(p^(1/2))的类数h的一个公式,此公式仅依赖于Q(p^(1/2))的基本单位ε,素数p以及数a=1+sum from k=1 to(p-1)/2((-1)~kN_K).孙琦教授对奇素数p,得到N_k的若干性质和计算N_2,N_3,N_4的公式.本文对奇素数p,得到N_k的若干新性质和N_5,N_6的计算公式,
基金Project (No. 10371107) supported by the National Natural Science Foundation of China
文摘Zhao (2003a) first established a congruence for any odd prime p>3, S(1,1,1;p)≡-2Bp-3 (mod p), which holds when p=3 evidently. In this paper, we consider finite triple harmonic sum S(α,β,γ;p) (mod p) is considered for all positive integers α,β,γ. We refer to w=α+β+γ as the weight of the sum, and show that if w is even, S(α,β,γ;p)≡0 (mod p) for p≥w+3; if w is odd, S(α,β,γ;p)≡rBp≥w (mod p) for p≥w, here r is an explicit rational number independent of p. A congruence of Catalan number is obtained as a special case.
