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.
This note provides the some sum formulas for generalized Fibonacci numbers. The results are proved using clever rearrangements, rather than using induction.
Let {Xn, n≥1} be a martingale difference sequence and {a nk , 1?k?n,n?1} an array of constant real numbers. The limiting behavior of weighted partial sums ∑ k=1 n a nk X k is investigated and some new results are ob...Let {Xn, n≥1} be a martingale difference sequence and {a nk , 1?k?n,n?1} an array of constant real numbers. The limiting behavior of weighted partial sums ∑ k=1 n a nk X k is investigated and some new results are obtained.展开更多
We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale differen...We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale difference sequence and {an, n ≥ 1} and {bn,n ≥ 1} are two sequences of positive constants. Some new strong laws of large numbers for such weighted sums are proved under mild conditions.展开更多
In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones...In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones of independent sequence with identical distribution to the case of φ-mixing sequence with different distribution.展开更多
Bell’s theorem determines the number of representations of a positive integer in terms of the ternary quadratic forms x2+by2+cz2 with b,c {1,2,4,8}. This number depends only on the number of representations of an int...Bell’s theorem determines the number of representations of a positive integer in terms of the ternary quadratic forms x2+by2+cz2 with b,c {1,2,4,8}. This number depends only on the number of representations of an integer as a sum of three squares. We present a modern elementary proof of Bell’s theorem that is based on three standard Ramanujan theta function identities and a set of five so-called three-square identities by Hurwitz. We use Bell’s theorem and a slight extension of it to find explicit and finite computable expressions for Tunnel’s congruent number criterion. It is known that this criterion settles the congruent number problem under the weak Birch-Swinnerton-Dyer conjecture. Moreover, we present for the first time an unconditional proof that a square-free number n 3(mod 8) is not congruent.展开更多
This paper is to study the distribution property of Lehmer DH number by use the estimation of general Kloostermann sum and the estimation of trigonometric sum.
After posing the axiom of linear algebra, the author develops how this allows the calculation of arbitrary base powers, which provides an instantaneous calculation of powers in a particular base such as base ten;first...After posing the axiom of linear algebra, the author develops how this allows the calculation of arbitrary base powers, which provides an instantaneous calculation of powers in a particular base such as base ten;first of all by developing the any base calculation of these powers, then by calculating triangles following the example of the “arithmetical” triangle of Pascal and showing how the formula of the binomial of Newton is driving the construction. The author also develops the consequences of the axiom of linear algebra for the decimal writing of numbers and the result that this provides for the calculation of infinite sums of the inverse of integers to successive powers. Then the implications of these new forms of calculation on calculator technologies, with in particular the storage of triangles which calculate powers in any base and the use of a multiplication table in a very large canonical base are discussed.展开更多
基金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.
文摘This note provides the some sum formulas for generalized Fibonacci numbers. The results are proved using clever rearrangements, rather than using induction.
基金SupportedbytheNationalNaturalScienceFoundationofChina (No .10 0 710 5 8)and (No .10 0 710 19)
文摘Let {Xn, n≥1} be a martingale difference sequence and {a nk , 1?k?n,n?1} an array of constant real numbers. The limiting behavior of weighted partial sums ∑ k=1 n a nk X k is investigated and some new results are obtained.
基金Supported by the National Natural Science Foundationof China (10671149)
文摘We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale difference sequence and {an, n ≥ 1} and {bn,n ≥ 1} are two sequences of positive constants. Some new strong laws of large numbers for such weighted sums are proved under mild conditions.
基金Supported by the National Natural Science Foundation of China（11671012, 11526033, 11501004, 11501005） Supported by the Natural Science Foundation of Anhui Province（1608085QA02） Supported by the Science Fund for Distinguished Young Scholars of Anhui Province（1508085J06）
文摘In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones of independent sequence with identical distribution to the case of φ-mixing sequence with different distribution.
文摘Bell’s theorem determines the number of representations of a positive integer in terms of the ternary quadratic forms x2+by2+cz2 with b,c {1,2,4,8}. This number depends only on the number of representations of an integer as a sum of three squares. We present a modern elementary proof of Bell’s theorem that is based on three standard Ramanujan theta function identities and a set of five so-called three-square identities by Hurwitz. We use Bell’s theorem and a slight extension of it to find explicit and finite computable expressions for Tunnel’s congruent number criterion. It is known that this criterion settles the congruent number problem under the weak Birch-Swinnerton-Dyer conjecture. Moreover, we present for the first time an unconditional proof that a square-free number n 3(mod 8) is not congruent.
基金Supported by the Education Commission Science Foundation of Shaanxi(OOJK123)
文摘This paper is to study the distribution property of Lehmer DH number by use the estimation of general Kloostermann sum and the estimation of trigonometric sum.
文摘After posing the axiom of linear algebra, the author develops how this allows the calculation of arbitrary base powers, which provides an instantaneous calculation of powers in a particular base such as base ten;first of all by developing the any base calculation of these powers, then by calculating triangles following the example of the “arithmetical” triangle of Pascal and showing how the formula of the binomial of Newton is driving the construction. The author also develops the consequences of the axiom of linear algebra for the decimal writing of numbers and the result that this provides for the calculation of infinite sums of the inverse of integers to successive powers. Then the implications of these new forms of calculation on calculator technologies, with in particular the storage of triangles which calculate powers in any base and the use of a multiplication table in a very large canonical base are discussed.
