表整数为八个三角数的表法数目

通过留数定理把一个无究乘积展成Laurent级数,利用这个展式可以简单地证明表整数为八个三角数的表法数目公式。     

Estermann's Ternary Problem with Almost Equal Summands

We prove an asymptotic formula for the number of representations of a sufficiently large positive integer N as the sum of two primes and the square of a natural number when they are almost equal.     

On Finite Forms of Certain Bilateral Basic Hypergeometric Series and Their Applications

In this paper we derive finite forms of the summation formulas for bilateral basic hypergeometric series 3ψ3,4ψ4 and 5ψ5.We therefrom obtain the summation formulae obtained recently by Wenchang CHU and Xiaoxia WANG.As applications of these summation formulae,we deduce the well-known Jacobi's two and four square theorems,a formula for the number of representations of an integer n as sum of four triangular numbers and some theta function identities.     

华蘅芳数在幂和问题中的新应用

自然效的幂和问题具有悠久的历史,亦不乏现代的兴趣.一般学者不了解清代数学家华蘅芳的成果.本文改进了华氏数的定义;针对该问题建立了新的取盒-放球模型,给出幂和的组合解释;应用华氏数获得了简捷的幂和公式.文末介绍了华氏数的历史来源.     

Dicuil (9th century) on triangular and square numbers

Dicuil was a ninth-century Irish monk who taught at the Carolingian school of Louis the Pious. He wrote a Computus or astronomical treatise in Latin in about 814–16, which contains a chapter on triangular and square numbers. Dicuil describes two methods for calculating triangular numbers: the simple method of summing the natural numbers, and the more complex method of multiplication, equivalent to the formula n(n?+?1)/2. He also states that a square number is equal to twice a triangular number minus the generating number, equivalent to n²?=?2[n(n?+?1)/2] – n. The multiplication formula for triangular numbers was first explicitly described in about the third century AD by the Greek authors Diophantus and Iamblichus. It was also known as a solution to other mathematical problems as early as 300 BC. It reappeared in the West in the sixteenth century. Dicuil thus fills a gap in our medieval knowledge.     

用三个关系式与Mathematica软件求第二类自然数幂和公式

首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法.     

On the number of partitions into primes

There is, apparently, a persistent belief that in the current state of knowledge it is not possible to obtain an asymptotic formula for the number of partitions of a number n into primes when n is large. In this paper such a formula is obtained. Since the distribution of primes can only be described accurately by the use of the logarithmic integral and a sum over zeros of the Riemann zeta-function one cannot expect the main term to involve only elementary functions. However the formula obtained, when n is replaced by a real variable, is in and is readily seen to be monotonic. Research supported by NSA grant, no. MDA904-03-1-0082.     

On the Distribution in Residue Classes of Integers with a Fixed Sum of Digits

We give an asymptotic formula for the distribution of those integers n in a residue class, such that n has a fixed sum of base-g digits, with some uniformity over the choice of the modulus and g. We then use this formula to solve the problem of I. Niven of giving an asymptotic formula for the distribution of those integers n divisible by the sum of their base-g digits. Our results also allow us to give a stronger form of a result of M. Olivier dealing with the distribution of integers with a given gcd with their sum of base-g digits.For our friend Jean-Louis Nicolas on his sixtieth birthdayResearch partially supported by the Hungarian National Foundation for Scientific Research, Grant No. T029759, and “Balaton” French-Hungarian exchange program F-18/00.2000 Mathematics Subject Classification: Primary—11A63     

The Formula of General Term of the Sum of Equal Powers of Natural Numbers

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＴｏｆｉｎｄｔｈｅｇｅｎｅｒａｌｔｅｒｍｆｏｒｍｕｌａｏｆｃａｌｃｕｌａｔｉｎｇｗａｓａｎｏｌｄｅｓｔｐｒｏｂｌｅｍｉｎＮｕｍｂｅｒＴｈｅｏｒｙ．Ｅａｒｌｙｉｎ３００Ｂ．Ｃ．,Ａｒｃｈｉｍｅｄｏ,ｔｈｅｍａｔｈｅｍａｔｉｃｉａｎｏｆａｎｃｉｅｎｔＧｒｅｅｃｅ,ｗｏｒｋｅｄｏｕｔｔｈｅｆｏｒｍｕｌａ∑ｎｋ＝１ｋ＝ｎ（ｎ＋１）２ａｎｄ∑ｎｋ＝１ｋ２＝ｎ（ｎ＋１）（２ｎ＋１）６．Ｓｏｆａｒ,ｐｅｏｐｌｅｈａｖｅｇｏｔｍａｎｙｆｏｒｍｓｏｆｅｐｒｅｓｓｉｏｎｏｆｔｈｅｇｅ…     

Partitions into two Lehmer numbers

We prove an asymptotic formula for the number of representations of an integer as sum of two Lehmer numbers which implies that under some natural restrictions each sufficiently large integer is a sum of two such numbers.     

Partitions into two Lehmer numbers

We prove an asymptotic formula for the number of representations of an integer as sum of two Lehmer numbers which implies that under some natural restrictions each sufficiently large integer is a sum of two such numbers.     

Applications of an Explicit Formula for the Generalized Euler Numbers

The authors establish an explicit formula for the generalized Euler NumbersE2n^（x）, and obtain some identities and congruences involving the higher＇order Euler numbers, Stirling numbers, the central factorial numbers and the values of the Riemann zeta-function.     

Tiling Proofs of Recent Sum Identities Involving Pell Numbers

In a recent note, Santana and Diaz-Barrero proved a number of sum identities involving the well-known Pell numbers. Their proofs relied heavily on the Binet formula for the Pell numbers. Our goal in this note is to reconsider these identities from a purely combinatorial viewpoint. We provide bijective proofs for each of the results by interpreting the Pell numbers as enumerators of certain types of tilings. In turn, our proofs provide helpful insight for straightforward generalizations of a number of the identities. Received July 20, 2006     

Betti Numbers of Hypergraphs

In this article, we study some algebraic properties of hypergraphs, in particular their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge are not previously considered in the literature. Also, in a natural way, we define a product on hypergraphs, which in a sense is dual to the join operation on simplicial complexes. For such product, we give a general formula for the Betti numbers, which specializes neatly in case of linear resolutions.     

The odd-number sequence: squares and sums

Direct study of various characteristics of integers and their interactions is readily accessible to undergraduate students. Integers obviously fall in different classes of modular rings and thus have features unique to that class which can result in a variety of formations, particularly with sums of squares. The sum of the first n odd numbers is itself the square of n within the odd number sequence, from which testing for primality within the Fibonacci sequence is investigated in this note.     

Quasi-parabolic Siegel formula

The result of Siegel that the Tamagawa number ofSL _r over a function field is 1 has an expression purely in terms of vector bundles on a curve, which is known as the Siegel formula. We prove an analogous formula for vector bundles with quasi-parabolic structures. This formula can be used to calculate the Betti numbers of the moduli of parabolic vector bundles using the Weil conjuctures An erratum to this article is available at .     

Asymptotic formula for the sum of the sums of elements of the continued fractions for numbers of the form a/p

One obtains an asymptotic formula for the sum of the sums of the elements of the continued fractions for numbers of the forma/p (p is a prime number).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 91, pp. 81–93, 1979.     

The Weight Distribution of C 5(1, n)

In [2] the codes C _q (r,n) over were introduced. These linear codes have parameters , can be viewed as analogues of the binary Reed-Muller codes and share several features in common with them. In [2], the weight distribution of C ₃(1,n) is completely determined.In this paper we compute the weight distribution of C ₅(1,n). To this end we transform a sum of a product of two binomial coefficients into an expression involving only exponentials an Lucas numbers. We prove an effective result on the set of Lucas numbers which are powers of two to arrive to the complete determination of the weight distribution of C ₅(1,n). The final result is stated as Theorem 2.     

Solving a full fuzzy linear programming using lexicography method and fuzzy approximate solution

This paper discusses full fuzzy linear programming (FFLP) problems of which all parameters and variable are triangular fuzzy numbers. We use the concept of the symmetric triangular fuzzy number and introduce an approach to defuzzify a general fuzzy quantity. For such a problem, first, the fuzzy triangular number is approximated to its nearest symmetric triangular number, with the assumption that all decision variables are symmetric triangular. An optimal solution to the above-mentioned problem is a symmetric fuzzy solution. Every FLP models turned into two crisp complex linear problems; first a problem is designed in which the center objective value will be calculated and since the center of a fuzzy number is preferred to (its) margin. With a special ranking on fuzzy numbers, the FFLP transform to multi objective linear programming (MOLP) where all variables and parameters are crisp.     

Chamber behavior of double Hurwitz numbers in genus 0

We study double Hurwitz numbers in genus zero counting the number of covers CP¹→CP¹ with two branching points with a given branching behavior. By the recent result due to Goulden, Jackson and Vakil, these numbers are piecewise polynomials in the multiplicities of the preimages of the branching points. We describe the partition of the parameter space into polynomiality domains, called chambers, and provide an expression for the difference of two such polynomials for two neighboring chambers. Besides, we provide an explicit formula for the polynomial in a certain chamber called totally negative, which enables us to calculate double Hurwitz numbers in any given chamber as the polynomial for the totally negative chamber plus the sum of the differences between the neighboring polynomials along a path connecting the totally negative chamber with the given one.