A. Mukhopadhyay

most citedOn the Oppenheim's "factorisatio numerorum" function

2 citations · 3 across the 2 of their papers we have counts for

collaborators

Showing math.NTShow all

2 papers · 1 filter

math.NT2008★ 1 cited

Counting squarefree discriminants of trinomials under abc

Anirban Mukhopadhyay, M. Ram Murty, Kotyada Srinivas

For an odd positive integer $n \geq 5$ , assuming the truth of the $ab c$ conjecture, we show that for a positive proportion of pairs $(a, b)$ of integers the trinomials of the form $t^…

math.NT2008★ 2 cited

On the Oppenheim's "factorisatio numerorum" function

Florian Luca, Anirban Mukhopadhyay, Kotyada Srinivas

Let $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)$ …