On the Oppenheim's "factorisatio numerorum" function

Simple item page
dc.creatorLuca, Florian
dc.creatorMukhopadhyay, Anirban
dc.creatorSrinivas, Kotyada
dc.date2008-07-07
dc.date.accessioned2026-07-07T09:48:47Z
dc.date.available2026-07-07T09:48:47Z
dc.descriptionLet $f(n)$ denote the number of distinct unordered factorisations of the natural number $n$ into factors larger than 1.In this paper, we address some aspects of the function $f(n)$.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/0807.0986
dc.identifierhttp://arxiv.org/abs/0807.0986
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164343
dc.subjectNumber Theory
dc.titleOn the Oppenheim's "factorisatio numerorum" function
dc.typetext

Files

Collections

arXiv