TY - JOUR

T1 - On the number of ordered factorizations of natural numbers

AU - Chor, Benny

AU - Lemke, Paul

AU - Mador, Ziv

N1 - Funding Information:
∗Corresponding address: Massey University, Institute of Fundamental Sciences, Private Bag 11-222, Palmerston North, New Zealand. E-mail addresses: benny@cs.technion.ac.il (B. Chor), plemke@ccr-p.ida.org (P. Lemke), zivmador@ microsoft.com (Z. Mador) 1Research supported by the fund for promotion of research at the Technion. 2Present address: Microsoft R&D Center, Matam, Haifa 31905, Israel.

PY - 2000/3/21

Y1 - 2000/3/21

N2 - We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number theory was shown by Newberg and Naor (Adv. Appl. Math. 14 (1993) 172-183) to be a lower bound on the number of solutions to the so-called probed partial digest problem, which arises in the analysis of data from experiments in molecular biology. Hille (Acta Arith. 2 (1) (1936) 134-144) established a relation between H(n) and the Riemann zeta function ζ. This relation was used by Hille to prove tight asymptotic upper and lower bounds on H(n). In particular, Hille showed an existential lower bound on H(n): For any t < p = ζ-1(2) ≈ 1.73 there are infinitely many n which satisfy H(n) > nt. Hille also proved an upper bound on H(n), namely H(n) = Q(nρ). In this work, we show an improved upper bound on the function H(n), by proving that for every n, H(n) < nρ (so 1 can be used as the constant in the 'O' notation). We also present several explicit sequences {ni} with H(ni) = Ω(ndi), where d > 1 is a constant. One sequence has elements of the form 2ℓ3j, and they satisfy H(ni) ≥ ntii , where limi→∞ ti = t ≈ 1.43. This t is the maximum constant for sequences whose elements are products of two distinct primes. Another sequence has elements that are products of four distinct primes, and they satisfy H(ni) > ndi, where d ≈ 1.6.

AB - We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number theory was shown by Newberg and Naor (Adv. Appl. Math. 14 (1993) 172-183) to be a lower bound on the number of solutions to the so-called probed partial digest problem, which arises in the analysis of data from experiments in molecular biology. Hille (Acta Arith. 2 (1) (1936) 134-144) established a relation between H(n) and the Riemann zeta function ζ. This relation was used by Hille to prove tight asymptotic upper and lower bounds on H(n). In particular, Hille showed an existential lower bound on H(n): For any t < p = ζ-1(2) ≈ 1.73 there are infinitely many n which satisfy H(n) > nt. Hille also proved an upper bound on H(n), namely H(n) = Q(nρ). In this work, we show an improved upper bound on the function H(n), by proving that for every n, H(n) < nρ (so 1 can be used as the constant in the 'O' notation). We also present several explicit sequences {ni} with H(ni) = Ω(ndi), where d > 1 is a constant. One sequence has elements of the form 2ℓ3j, and they satisfy H(ni) ≥ ntii , where limi→∞ ti = t ≈ 1.43. This t is the maximum constant for sequences whose elements are products of two distinct primes. Another sequence has elements that are products of four distinct primes, and they satisfy H(ni) > ndi, where d ≈ 1.6.

UR - http://www.scopus.com/inward/record.url?scp=0347647635&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(99)00223-X

DO - 10.1016/S0012-365X(99)00223-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0347647635

SN - 0012-365X

VL - 214

SP - 123

EP - 133

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -