On the number of ordered factorizations of natural numbers

13 years 4 months ago

Download www.cs.technion.ac.il

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

Benny Chor, Paul Lemke, Ziv Mador

Real-time Traffic

DM 2000 | Lower Bound | Probed Partial Digest | Tight Asymptotic Upper |

claim paper

» Condition Numbers of Approximate Schur Complements in Two and ThreeDimensional Discretizat...

» A bijective proof of Jacksons formula for the number of factorizations of a cycle

» On the number of factorizations of a full cycle

» The upper bound of the number of cycles in a 2factor of a line graph

» Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for I...

» Complete Minors and Independence Number

» BlackBox Secret Sharing from Primitive Sets in Algebraic Number Fields

» CAIRN 2 An FPGA Implementation of the Sieving Step in the Number Field Sieve Method

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	DM
Authors	Benny Chor, Paul Lemke, Ziv Mador

Comments (0)

Sciweavers

On the number of ordered factorizations of natural numbers

DM 2000 | Lower Bound | Probed Partial Digest | Tight Asymptotic Upper |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers