Let Gn = n k=0 n k , the product of the elements of the n-th row of Pascal's triangle. This paper studies the partial factorizations of Gn given by the product G(n, x) of all prime factors p of Gn having p ≤ x, counted with multiplicity. It shows log G(n, αn) ∼ f G (α)n 2 as n → ∞ for a limit function f G (α) defined for 0 ≤ α ≤ 1. The main results are deduced from study of functions A(n, x), B(n, x), that encode statistics of the base p radix expansions of the integer n (and smaller integers), where the base p ranges over primes p ≤ x. Asymptotics of A(n, x) and B(n, x) are derived using the prime number theorem with remainder term or conditionally on the Riemann hypothesis.
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.
This paper studies an integer sequence Gn analogous to the product Gn = n k=0 n k , the product of the elements of the n-th row of Pascal's triangle. It is known that Gn = p≤n p νp(Gn) with νp(Gn) being computable from the base p expansions of integers up to n. These radix statistics make sense for all bases b ≥ 2, and we define the generalized binomial product Gn = 2≤b≤n b ν(n,b) and show it is an integer. The statistic b ν(n,b) is not the same as the maximal power of b dividing Gn. This paper studies the partial products G(n, x) = 2≤b≤x b ν(n,b) , which are also integers, and estimates their size. It shows log G(n, αn) is well approximated by f G (α)n 2 log n + g G (α)n 2 as n → ∞ for limit functions f G (α) and g G (α) defined for 0 ≤ α ≤ 1. The remainder term has a power saving in n. The main results are deduced from study of functions A(n, x) and B(n, x) that encode statistics of the base b radix expansions of the integer n (and smaller integers), where the base b ranges over all integers 2 ≤ b ≤ x. Unconditional estimates of A(n, x) and B(n, x) are derived.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.