On the maximal order of numbers in the “factorisatio numerorum” problem
✍ Scribed by Martin Klazar; Florian Luca
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 208 KB
- Volume
- 124
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
✦ Synopsis
Let m(n) be the number of ordered factorizations of n 1 in factors larger than 1. We prove that for every ε > 0
holds for all integers n > n 0 , while, for a suitable constant c > 0,
holds for infinitely many positive integers n, where ρ = 1.72864 . . . is the positive real solution to ζ(ρ) = 2. We investigate also arithmetic properties of m(n) and the number of distinct values of m(n).
📜 SIMILAR VOLUMES
## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of m
## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ ≥ 12. We also pro
For a prime number l, let h> J be the class number of the maximal real subfield of the l-th cyclotomic field. For each natural number N, it is plausible but not yet proved that there exist infinitely many prime numbers l with h> J 'N. We prove an analogous assertion for cyclotomic function fields.