scholarly journals Partial factorizations of products of binomial coefficients

2021 ◽  
pp. 1-38
Author(s):  
Lara Du ◽  
Jeffrey C. Lagarias
Keyword(s):  
Prime Number ◽  
Riemann Hypothesis ◽  
Remainder Term ◽  
Prime Number Theorem ◽  
Product Formula ◽  
Binomial Coefficients ◽  
Limit Function ◽  
Pascal’S Triangle ◽  
Prime Factors ◽  
Pascal's Triangle

Let [Formula: see text] the product of the elements of the [Formula: see text]th row of Pascal’s triangle. This paper studies the partial factorizations of [Formula: see text] given by the product [Formula: see text] of all prime factors [Formula: see text] of [Formula: see text] having [Formula: see text], counted with multiplicity. It shows [Formula: see text] as [Formula: see text] for a limit function [Formula: see text] defined for [Formula: see text]. The main results are deduced from study of functions [Formula: see text] that encode statistics of the base [Formula: see text] radix expansions of the integer [Formula: see text] (and smaller integers), where the base [Formula: see text] ranges over primes [Formula: see text]. Asymptotics of [Formula: see text] and [Formula: see text] are derived using the prime number theorem with remainder term or conditionally on the Riemann hypothesis.

Generalising Pascal's Triangle

2004 ◽  
Vol 88 (513) ◽  
pp. 447-456 ◽  
Author(s):  
Barry Lewis
Keyword(s):  
Prime Number ◽  
Recurrence Relation ◽  
Stirling Numbers ◽  
Binomial Coefficients ◽  
Combinatorial Properties ◽  
Pascal’S Triangle ◽  
Binomial Expansion ◽  
Pascal Triangle ◽  
Divisibility Property ◽  
Pascal's Triangle

Pascal's triangle, the Binomial expansion and the recurrence relation between its entries are all inextricably linked. In the normal course of events, the Binomial expansion leads to Pascal's Triangle, and thence to the recurrence relation between its entries. In this article we are going to reverse this process to make it possible to explore a particular type of generalisation of such interlinked structures, by generalising the recurrence relation and then exploring the resulting generalised ‘Pascal Triangle’ and ‘Binomial expansion’. Within the spectrum of generalisations considered, we find exactly four of particular significance: those concerned with the Binomial coefficients, the Stirling numbers of both kinds, and a lesser known set of numbers – the Lah numbers. We also examine the combinatorial properties of the entries in these triangles and a prime number divisibility property that they all share. Thereby, we achieve a remarkable synthesis of these different entities.

scholarly journals Products of binomial coefficients and unreduced Farey fractions

2016 ◽  
Vol 12 (01) ◽  
pp. 57-91
Author(s):  
Jeffrey C Lagarias ◽  
Harsh Mehta
Keyword(s):  
Growth Rate ◽  
Real Number ◽  
Prime Number ◽  
Prime Number Theorem ◽  
Product Formula ◽  
Binomial Coefficients ◽  
Maximal Growth ◽  
Farey Fractions ◽  
Prime Factorization ◽  
Maximal Growth Rate

This paper studies the product [Formula: see text] of the binomial coefficients in the [Formula: see text]th row of Pascal’s triangle, which equals the reciprocal of the product of all the reduced and unreduced Farey fractions of order [Formula: see text]. It studies its size as a real number, measured by [Formula: see text], and its prime factorization, measured by the order of divisibility [Formula: see text] by a fixed prime [Formula: see text], each viewed as a function of [Formula: see text]. It derives three formulas for [Formula: see text], two of which relate it to base [Formula: see text] radix expansions of integers up to [Formula: see text], and which display different facets of its behavior. These formulas are used to determine the maximal growth rate of each [Formula: see text] and to explain structure of the fluctuations of these functions. It also defines analogous functions [Formula: see text] for all integer bases [Formula: see text] using base [Formula: see text] radix expansions replacing base [Formula: see text]-expansions. A final topic relates factorizations of [Formula: see text] to Chebyshev-type prime-counting estimates and the prime number theorem.

On a pair of zeta functions

2016 ◽  
Vol 12 (08) ◽  
pp. 2323-2342
Author(s):  
Zhi-Wei Sun
Keyword(s):  
Positive Integer ◽  
Prime Number ◽  
Riemann Hypothesis ◽  
Zeta Functions ◽  
Prime Number Theorem ◽  
Arithmetical Functions ◽  
Prime Factors

Let [Formula: see text] be a positive integer, and define [Formula: see text] for [Formula: see text], where [Formula: see text] denotes the number of distinct prime factors of [Formula: see text], and [Formula: see text] represents the total number of prime factors of [Formula: see text] (counted with multiplicity). In this paper, we study these two zeta functions and related arithmetical functions. We show that [Formula: see text] which is similar to the known identity [Formula: see text] equivalent to the Prime Number Theorem. For [Formula: see text], we prove that [Formula: see text] We also raise a hypothesis on the parities of [Formula: see text] which implies the Riemann Hypothesis.

scholarly journals Integers free of small prime factors in arithmetic progressions

2000 ◽  
Vol 157 ◽  
pp. 103-127 ◽  
Author(s):  
Ti Zuo Xuan
Keyword(s):  
Prime Number ◽  
Short Range ◽  
Error Term ◽  
Real Zero ◽  
Prime Number Theorem ◽  
Arithmetic Progressions ◽  
Real Character ◽  
Dickman Function ◽  
Prime Factors ◽  
Positive Integers

For real x ≥ y ≥ 2 and positive integers a, q, let Φ(x, y; a, q) denote the number of positive integers ≤ x, free of prime factors ≤ y and satisfying n ≡ a (mod q). By the fundamental lemma of sieve, it follows that for (a,q) = 1, Φ(x,y;a,q) = φ(q)-1, Φ(x, y){1 + O(exp(-u(log u- log2 3u- 2))) + (u = log x log y) holds uniformly in a wider ranges of x, y and q.Let χ be any character to the modulus q, and L(s, χ) be the corresponding L-function. Let be a (‘exceptional’) real character to the modulus q for which L(s, ) have a (‘exceptional’) real zero satisfying > 1 - c0/log q. In the paper, we prove that in a slightly short range of q the above first error term can be replaced by where ρ(u) is Dickman function, and ρ′(u) = dρ(u)/du.The result is an analogue of the prime number theorem for arithmetic progressions. From the result can deduce that the above first error term can be omitted, if suppose that 1 < q < (log q)A.

scholarly journals Pascal type properties of Betti numbers

1994 ◽  
Vol 17 (3) ◽  
pp. 545-552
Author(s):  
Tilak de Alwis
Keyword(s):  
Polynomial Ring ◽  
Betti Numbers ◽  
Binomial Coefficients ◽  
Minimal Resolution ◽  
Pascal’S Triangle ◽  
Specific Formula ◽  
Pascal's Triangle

In this paper, we will describe the Pascal Type properties of Betti numbers of ideals associated ton-gons. These are quite similar to the properties enjoyed by the Pascal's Triangle, concerning the binomial coefficients. By definition, the Betti numbersβt(n)of an idealIassociated to ann-gon are the ranks of the modules in a free minimal resolution of theR-moduleR/I, whereRis the polynomial ringk[x1,x2,…,xn]. Herekis any field andx1,x2,…,xnare indeterminates. We will prove those properties using a specific formula for the Betti numbers.

Sign in / Sign up

Export Citation Format

Share Document