Related papers: Some results on ordered and unordered factorizatio…

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…

Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…

Let $(U_n)_{n=0}^\infty$ and $(V_m)_{m=0}^\infty$ be two linear recurrence sequences. For fixed positive integers $k$ and $\ell$, fixed $k$-tuple $(a_1,\dots,a_k)\in \mathbb{Z}^k$ and fixed $\ell$-tuple $(b_1,\dots,b_\ell)\in…

We fix a positive integer $k$ and look for solutions of the equations $\phi(n+k) = \phi(n)$ and $\phi(n + k) = 2\phi(n)$. We prove that Fermat primes can be used to build five solutions for the first equation when $k$ is even and five for…

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

In this paper, we use techniques of enumerative combinatorics to study the following problem: we count the number of ways to split $n$ balls into nonempty, ordered bins so that the most crowded bin has exactly $k$ balls. We find closed…

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

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…

Let $A$ be a nonempty set of positive integers. The restricted partition function $p_A(n)$ denotes the number of partitions of $n$ with parts in $A$. When the elements in $A$ are pairwise relatively prime positive integers, Ehrhart,…

Let $S=(s_n)_{n\geq 1}$ be a sequence with elements in a commutative monoid $(\mathcal{M},+,0)$. In this paper, we provide an explicit formula for $$\sum_{\la} C(\la) q^{\sum_{n\geq 1} \la_n\cdot s_n}$$ where $\la=(\la_1,\ldots)$ run…

In our earlier publication we have shown how to compute by iteration a rational number ${u_{2,k}}$ in the two-term Machin-like formula for pi of kind…

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

Let $k\ge 1,a\ge 1,b\ge 0$ and $ c\ge 1$ be integers. Let $f$ be a multiplicative function with $f(n)\ne 0$ for all positive integers $n$. We define the arithmetic function $g_{k,f}$ for any positive integer $n$ by…

Suppose $k$ is a positive integer. In this work, we establish formulas for for the number of representations of integers by the quadratic forms $$ x_{1}^{2}+\cdots+x_{k}^{2}+l\left(x_{k+1}^{2}+\cdots+x_{2k}^{2}\right) $$ for $l\in\{2,4\}$.

We use sums of Liouville type to count the number of ways a positive integer can be represented by the forms $(a+c)^{1/3}x + (b+d)y$, $(a+c)x + \bigl(k(b+d) \bigr)^{1/3} y$, and $\bigl(k(a+c) \bigr)^{1/3} x + l(b+d) y$ for nonnegative…

The Stirling number of the second kind $n\brace k$ counts the number of ways to partition a set of $n$ labeled balls into $k$ non-empty unlabeled cells. As an extension of this, we consider $b_1+b_2+\ldots+b_n$ balls with $b_1$ balls…

Let $k$ be a positive integer and $m$ be an integer. Garvan's $k$-rank $N_k(m,n)$ is the number of partitions of $n$ into at least $(k-1)$ successive Durfee squares with $k$-rank equal to $m$. In this paper give some asymptotics for…

In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…