Quadrafree \textit{factorisatio numerorum} (Q457941): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4101884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Factorizations of an Integer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: NIST digital library of mathematical functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the number of multiplicative partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some asymptotic formulas in the theory of the ``factorisatio numerorum'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem in "Factorisatio Numerorum" / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SURVEY OF FACTORIZATION COUNTING FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on Oppenheim's ``Factorisatio Numerorum'' function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Partitions of a Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorisatio numerorum with constraints / rank
 
Normal rank

Revision as of 03:10, 9 July 2024

scientific article
Language Label Description Also known as
English
Quadrafree \textit{factorisatio numerorum}
scientific article

    Statements

    Quadrafree \textit{factorisatio numerorum} (English)
    0 references
    30 September 2014
    0 references
    As the title suggests, the author investigates the function which associates to a positive integer \(n\) the number \(f_2(n)\) of factorizations of \(n\) in squarefree parts, where the order of the factors does not count. The main results are a formula for \(f_2(n^2)\) when \(n\) is squarefree which involves Bell numbers and an asymptotic for the summatory function of \(f_2(n)\) in the initial interval \(n\in [1,x]\) as \(x\to\infty\). The combinatorial results use a method of Rota while the proof of the analytic result uses standard machinery of complex integration.
    0 references
    0 references
    0 references
    squarefree
    0 references
    factorization
    0 references
    Bell number
    0 references
    0 references