ID: 1910.02455

Divisor Functions and the Number of Sum Systems

October 6, 2019

View on ArXiv

Similar papers 3

Ordered Factorizations with $k$ Factors

October 16, 2016

82% 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

The partition function $p(n)$ in terms of the classical M\"{o}bius function

October 20, 2023

82% Match
Mircea Merca, Maxie D. Schmidt
Combinatorics
Number Theory

In this paper, we investigate decompositions of the partition function $p(n)$ from the additive theory of partitions considering the famous M\"{o}bius function $\mu(n)$ from multiplicative number theory. Some combinatorial interpretations are given in this context. Our work extends several analogous identities proved recently relating $p(n)$ and Euler's totient function $\varphi(n)$. Keywords: Lambert series; M\"{o}bius function; $q$-series; partition function

Find SimilarView on arXiv

A formula for the $r$-coloured partition function in terms of the sum of divisors function and its inverse

August 5, 2020

82% Match
Sumit Kumar Jha
General Mathematics

Let $p_{-r}(n)$ denote the $r$-coloured partition function, and $\sigma(n)=\sum_{d|n}d$ denote the sum of positive divisors of $n$. The aim of this note is to prove the following $$ p_{-r}(n)=\theta(n)+\,\sum_{k=1}^{n-1}\frac{r^{k+1}}{(k+1)!} \sum_{\alpha_1\,= k}^{n-1} \, \sum_{\alpha_2\,= k-1}^{\alpha_1-1} \cdots \sum_{\alpha_k\, = 1}^{\alpha_{k-1}-1}\theta(n-\alpha_1) \theta(\alpha_1 -\alpha_2) \cdots \theta(\alpha_{k-1}-\alpha_k) \theta(\alpha_k) $$ where $\theta(n)=n^{-1}...

Find SimilarView on arXiv

Counting number of factorizations of a natural number

November 21, 2008

82% 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

Glaisher's divisors and infinite products

February 22, 2021

82% Match
Hartosh Singh Bal, Gaurav Bhatnagar
Number Theory

Ramanujan gave a recurrence relation for the partition function in terms of the sum of the divisor function $\sigma(n)$. In 1885, J.W. Glaisher considered seven divisor sums closely related to the sum of the divisors function. We develop a calculus to associate a generating function with each of these divisor sums. This yields analogues of Ramanujan's recurrence relation for several partition-theoretic functions as well as $r_k(n)$ and $t_k(n)$, functions counting the number ...

Find SimilarView on arXiv

Various Arithmetic Functions and their Applications

March 28, 2016

82% Match
Octavian Cira, Florentin Smarandache
General Mathematics

Over 300 sequences and many unsolved problems and conjectures related to them are presented herein. These notions, definitions, unsolved problems, questions, theorems corollaries, formulae, conjectures, examples, mathematical criteria, etc. on integer sequences, numbers, quotients, residues, exponents, sieves, pseudo-primes squares cubes factorials, almost primes, mobile periodicals, functions, tables, prime square factorial bases, generalized factorials, generalized palindro...

Find SimilarView on arXiv

An Exact Formula for the Prime Counting Function

May 24, 2019

82% Match
Jose Risomar Sousa
General Mathematics

This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting function, $J(x)$. Among its main findings, we can cite the extremely useful inversion formula for Dirichlet series (given $F_a(s)$, we know $a(n)$, which implies the Riemann hypothesis, and enabled the creation of a formula for $\pi(x)$ in the f...

Find SimilarView on arXiv

On the $k$th smallest part of a partition into distinct parts

February 19, 2024

82% Match
Rajat Gupta, Noah Lebowitz-Lockard, Joseph Vandehey
Number Theory
Combinatorics

A classic theorem of Uchimura states that the difference between the sum of the smallest parts of the partitions of $n$ into an odd number of distinct parts and the corresponding sum for an even number of distinct parts is equal to the number of divisors of $n$. In this article, we initiate the study of the $k$th smallest part of a partition $\pi$ into distinct parts of any integer $n$, namely $s_k(\pi)$. Using $s_k(\pi)$, we generalize the above result for the $k$th smallest...

Find SimilarView on arXiv

Multiplicative Arithmetic Functions of Several Variables: A Survey

October 26, 2013

82% Match
László Tóth
Number Theory
Combinatorics
Group Theory

We survey general properties of multiplicative arithmetic functions of several variables and related convolutions, including the Dirichlet convolution and the unitary convolution. We introduce and investigate a new convolution, called gcd convolution. We define and study the convolutes of arithmetic functions of several variables, according to the different types of convolutions. We discuss the multiple Dirichlet series and Bell series and present certain arithmetic and asymp...

Find SimilarView on arXiv

Parity results concerning the generalized divisor function involving small prime factors of integers

December 4, 2024

82% Match
Krishnaswami Alladi, Ankush Goswami
Number Theory

Let $\nu_y(n)$ denote the number of distinct prime factors of $n$ that are $<y$. For $k$ a positive integer, and for $k+2\leq y\leq x$, let $S_{-k}(x,y)$ denote the sum \begin{eqnarray*} S_{-k}(x,y):=\sum_{n\leq x}(-k)^{\nu_y(n)}. \end{eqnarray*} In this paper, we describe our recent results on the asymptotic behavior of $S_{-k}(x,y)$ for $k+2\leq y\leq x$, and $x$ sufficiently large. There is a crucial difference in the asymptotic behavior of $S_{-k}(x,y)$ when $k+1$ is a ...

Find SimilarView on arXiv