Constructive bounds on ordered factorizations

Don Coppersmith; Moshe Lewenstein

doi:10.1137/S0895480104445861

Constructive bounds on ordered factorizations

Don Coppersmith, Moshe Lewenstein

CS@BIU

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions.

Original language	English
Pages (from-to)	301-303
Number of pages	3
Journal	SIAM Journal on Discrete Mathematics
Volume	19
Issue number	2
DOIs	https://doi.org/10.1137/S0895480104445861
State	Published - 2005

Keywords

Factorizations
Riemann zeta function

Access to Document

10.1137/S0895480104445861

Cite this

@article{555ef716216b4c17a29ef67dafc41db8,

title = "Constructive bounds on ordered factorizations",

abstract = "The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions.",

keywords = "Factorizations, Riemann zeta function",

author = "Don Coppersmith and Moshe Lewenstein",

year = "2005",

doi = "10.1137/S0895480104445861",

language = "אנגלית",

volume = "19",

pages = "301--303",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - Constructive bounds on ordered factorizations

AU - Coppersmith, Don

AU - Lewenstein, Moshe

PY - 2005

Y1 - 2005

N2 - The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions.

AB - The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions.

KW - Factorizations

KW - Riemann zeta function

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

U2 - 10.1137/S0895480104445861

DO - 10.1137/S0895480104445861

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

AN - SCOPUS:33646837118

SN - 0895-4801

VL - 19

SP - 301

EP - 303

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 2

ER -

Constructive bounds on ordered factorizations

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this