On the number of ordered factorizations of natural numbers
DOI10.1016/S0012-365X(99)00223-XzbMATH Open0970.11036WikidataQ114122922 ScholiaQ114122922MaRDI QIDQ1972137FDOQ1972137
Authors: Benny Chor, Paul Lemke, Ziv Mador 
Publication date: 12 July 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Constructive Bounds on Ordered Factorizations
- scientific article; zbMATH DE number 3015574
- On the Greatest and Least Prime Factors of n !+1
- Some results on additive number theory, II
- scientific article; zbMATH DE number 495890
- A lower bound on the number of solutions to the probed partial digest problem
- On the Number of Times an Integer Occurs as a Binomial Coefficient
- On digital distribution in some integer sequences
- On the number of factorizations of an integer
- An arithmetical problem
ordered factorizations of natural numbersprobed partial digest problemsequences with two prime factors
Biochemistry, molecular biology (92C40) Arithmetic functions; related numbers; inversion formulas (11A25) Distribution of integers with specified multiplicative constraints (11N25) Asymptotic results on counting functions for algebraic and topological structures (11N45)
Cited In (17)
- Optimal base encodings for pseudo-Boolean constraints
- On ordered factorizations into distinct parts
- On extended Eulerian numbers
- The distribution of numbers with many ordered factorizations
- Profinite groups in which the probabilistic zeta function has no negative coefficients
- Constructive Bounds on Ordered Factorizations
- On the maximal order of numbers in the ``factorisatio numerorum problem
- Discrete uniform and binomial distributions with infinite support
- Recursively divisible numbers
- A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
- A natural partial order on the prime numbers
- A bijection for ordered factorizations
- Large values of the number of factorizations of an integer as an ordered product of primes
- Title not available (Why is that?)
- On asymptotic behavior of Dirichlet inverse
- ON RATIONALITY AND m-FACTORIAL NUMBERS
- Large values and champion numbers of Kalmár's arithmetic function
This page was built for publication: On the number of ordered factorizations of natural numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972137)
