Counting number of factorizations of a natural number

Simple item page
dc.creatorGhosh, Shamik
dc.date2008-11-21
dc.date.accessioned2026-07-07T10:20:03Z
dc.date.available2026-07-07T10:20:03Z
dc.descriptionIn this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
dc.identifierhttps://arxiv.org/abs/0811.3479
dc.identifierhttp://arxiv.org/abs/0811.3479
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/174729
dc.subjectDiscrete Mathematics
dc.subjectNumber Theory
dc.titleCounting number of factorizations of a natural number
dc.typetext

Files

Collections

arXiv