1. IR @ Alliance University
  2. Journal Articles Archive
  3. Articles to be qced
Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/6347
Full metadata record
DC FieldValueLanguage
dc.contributor.authorR. Balasubramanian-
dc.contributor.authorPriyamvad Srivastav-
dc.date.accessioned2024-02-27T05:57:01Z-
dc.date.available2024-02-27T05:57:01Z-
dc.date.issued2017-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/6347-
dc.description.abstractLet f (n) denote the number of unordered factorizations of a positive integer n into factors larger than 1. We show that the number of distinct values of f (n), less than or equal to x, is at most exp (C a��log x /a�loglog x (1+o(1))), where C = 2π a�� 2/3 and x is sufficiently large. This improves upon a previous result of the first author and F. Luca.-
dc.publisherJournal of the Ramanujan Mathematical Society-
dc.titleOn the Number of Factorizations of An Integer-
dc.volVol 32-
dc.issuedNo 4-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
On the number of factorizations of an integer.pdf
  Restricted Access		356.9 kBAdobe PDFView/Open Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.