On the Number of Distinct Multinomial Coefficients

We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number of partitions of n into primes and p(n) is the total number of partitions of n. To use methods from commutative algebra, we encode partitions and multinomial coefficients as monomials.Comment: 16 pages, to be published in the Journal of Number Theor

The largest missing value in a composition of an integer

AbstractIn this paper we find, asymptotically, the mean and variance for the largest missing value (part size) in a composition of an integer n. We go on to show that the probability that the largest missing value and the largest part of a composition differ by one is relatively high and we find the mean for the average largest value in compositions that have this property. The average largest value of compositions with at least one non-zero missing value is also found, and used to calculate how many distinct values exceed the largest missing value on average

Two constructions of the real numbers via alternating series

Two further new methods are put forward for constructing the complete ordered field of real numbers out of the ordered field of rational numbers. The methods are motivated by some little known results on the representation of real numbers via alternating series of rational numbers. Amongst advantages of the methods are the facts that they do not require an arbitrary choice of "base" or equivalence classes or any similar constructs. The methods bear similarities to a method of construction due to Rieger, which utilises continued fractions

The distribution of ascents of size d or more in compositions

Combinatoric