ID: 1412.0392

Some results on ordered and unordered factorization of a positive integers

December 1, 2014

View on ArXiv
Daniel Yaqubi, Madjid Mirzavaziri
Mathematics
Combinatorics

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function. In this paper, we give a recursive formula for the so-called multiplicative partition function $\mu_1(m,k):=$ the number of solutions of the equation $m=m_1... m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers. In particular, using an elementary proof, we give an explicit formula for the cases $k=1,2,3,4$.

Similar papers 1

Elementary formulas for integer partitions

April 27, 2010

90% Match
Mohamed El Bachraoui
Number Theory

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For instance, we shall prove that $$ p(n) = \sum_{d|n} \sum_{k=1}^{d} \sum_{i_0 =1}^{\lfloor d/k \rfloor} \sum_{i_1 =i_0}^{\lfloor\frac{d- i_0}{k-1} \rfloor} \sum_{i_2 =i_1}^{\lfloor\frac{d- i_0 - i_1}{k-2} \rfloor} ... \sum_{i_{k-3}=i_{k-4}}^{\...

Find SimilarView on arXiv

Counting number of factorizations of a natural number

November 21, 2008

87% Match
Shamik Ghosh
Discrete Mathematics
Number Theory

In 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.

Find SimilarView on arXiv

On the number of partitions of $n$ whose product of the summands is at most $n$

October 14, 2020

87% Match
Pankaj Jyoti Mahanta
Combinatorics
Number Theory

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

Find SimilarView on arXiv

Unordered Factorizations with $k$ Parts

July 17, 2019

87% Match
Jacob Sprittulla
Combinatorics

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$, where the parts have a specific number of colors. As a consequence, some new relations between partitions, Bell numbers and Stirling number of the second kind are derived. We also derive a recursive formula for the number of unordered factoriza...

Find SimilarView on arXiv

A note on the number of partitions of $n$ into $k$ parts

November 1, 2021

86% Match
Mircea Cimpoeas
Combinatorics
Number Theory

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set $\{n\in\mathbb N\;:\;p(n,k)\equiv i(\bmod\; m)\}$, where $m\geq 2$ and $0\leq i\leq m-1$.

Find SimilarView on arXiv

Ordered Factorizations with $k$ Factors

October 16, 2016

86% Match
Jacob Sprittulla
Combinatorics

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative sum $F_k(x,l)=\sum\nolimits_{n\leq x} f_k(n,l)$ is a polynomial in $\lfloor \log_l x \rfloor$ and give explicit expressions for the degree and the coefficients of this polynomial. An average order of the number of ordered factorizations for...

Find SimilarView on arXiv

On the restricted partition function II

October 31, 2016

86% Match
Mircea Cimpoeas, Florin Nicolae
Combinatorics

Let $\mathbf a=(a_1,\ldots,a_r)$ be a vector of positive integers. In continuation of a previous paper we present other formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0, \ldots, x_r\geq 0$.

Find SimilarView on arXiv

On a new formula for the number of unrestricted partitions

June 26, 2019

85% Match
Hemar Godinho, José Plínio O. Santos
Combinatorics

In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of two equations, involving natural numbers in the interval (1 $,n^{2}$).

Find SimilarView on arXiv

Computation of $P(n,m)$, the Number of Integer Partitions of $n$ into Exactly $m$ Parts

May 10, 2022

85% Match
M. J. Kronenburg
Number Theory

Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list of $P(n)$, the number of integer partitions of $n$, which is cached and therefore needs to be computed only once. Computing this list is also $O(n^{3/2})$. With these algorithms also $Q(n,m)$, the number of integer partitions of $n$ into e...

Find SimilarView on arXiv

On the restricted $k$-multipartition function

January 28, 2024

85% Match
Mircea Cimpoeas, Alexandra Teodor
Number Theory
Combinatorics

Let $\mathbf a=(a_1,\ldots,a_r)$ be a sequence of positive integers and $k\geq 2$ an integer. We study $p_{k,\mathbf a}(n)$, the restricted $k$-multipartition function associated to $\mathbf a$ and $k$. We prove new formulas for $p_{k,\mathbf a}(n)$, its waves $W_j(n,k,\mathbf a)$'s and its polynomial part $P_{k,\mathbf a}(n)$. Also, we give a lower bound for the density of the set $\{n\geq 0\;:\;p_{k,\mathbf a}(n)\not\equiv 0(\bmod\;m)\}$, where $m\geq 2$ is an integer.

Find SimilarView on arXiv