English
Related papers

Related papers: On Sparsely Schemmel Totient Numbers

200 papers

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…

General Mathematics · Mathematics 2021-08-24 Masum Billal

Let $F$ be an entire function of exponential type represented by the Taylor series \[ F(z) = \sum_{n\ge 0} \omega_n \frac{z^n}{n!} \] with unimodular coefficients $|\omega_n|=1$. We show that either the counting function $n_F(r)$ of zeroes…

Complex Variables · Mathematics 2026-05-05 Lior Hadassi , Mikhail Sodin

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

Number Theory · Mathematics 2025-08-05 Mihai Prunescu , Joseph M. Shunia

The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…

Number Theory · Mathematics 2020-08-25 Thomas Fink

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

Combinatorics · Mathematics 2018-02-12 Aaron Robertson

Let $q$ be a large prime number, $a$ be any integer, $\epsilon$ be a fixed small positive quantity. Friedlander and Shparlinksi \cite{FSh} have shown that there exists a positive integer $n\ll q^{5/2+\epsilon}$ such that $\phi(n)$ falls…

Number Theory · Mathematics 2007-11-19 M. Z. Garaev

We investigate here sums of triangular numbers $f(x):=\sum_i b_i T_{x_i}$ where $T_n$ is the $n$-th triangular number. We show that for a set of positive integers $S$ there is a finite subset $S_0$ such that $f$ represents $S$ if and only…

Number Theory · Mathematics 2009-09-15 Ben Kane

The Euler phi function on a given integer $n$ yields the number of positive integers less than $n$ that are relatively prime to $n$. Equivalently, it gives the order of the group of units in the quotient ring $\mathbb{Z}/(n)$. We generalize…

Number Theory · Mathematics 2021-08-10 Emily Gullerud , Aba Mbirika

We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…

Number Theory · Mathematics 2026-02-02 Hartosh Singh Bal , Gaurav Bhatnagar

We introduce completely monotonic functions of order $r>0$ and show that the remainders in asymptotic expansions of the logarithm of Barnes double gamma function and Euler's gamma function give rise to completely monotonic functions of any…

Classical Analysis and ODEs · Mathematics 2009-02-18 Stamatis Koumandos , Henrik L. Pedersen

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this…

Combinatorics · Mathematics 2025-09-09 Sheila Sundaram

After the work of Bordell\`{e}s, Dai, Heyman, Pan and Shparlinki (2018) and Heyman (2019), several authors studied the averages of arithmetic functions over the sequence $[x/n]$ and the integers of the form $[x/n]$. In this paper, we give…

Number Theory · Mathematics 2025-06-30 Kota Saito , Yuta Suzuki , Wataru Takeda , Yuuya Yoshida

Let $j(z)$ be the modular $j$-invariant function. Let $\tau$ be an algebraic number in the complex upper half plane $\mathbb{H}$. It was proved by Schneider and Siegel that if $\tau$ is not a CM point, i.e.,…

Number Theory · Mathematics 2018-12-06 Dohoon Choi , Subong Lim

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

Number Theory · Mathematics 2010-02-18 Mohamed El Bachraoui

We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…

Number Theory · Mathematics 2025-10-03 Aidan Botkin , Madeline L. Dawsey , David J. Hemmer , Matthew R. Just , Robert Schneider

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

Combinatorics · Mathematics 2022-03-17 Florence Maas-Gariépy , Étienne Tétreault

A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the…

Number Theory · Mathematics 2018-05-02 Irfan Okay

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

Number Theory · Mathematics 2026-02-16 Meselem Karras

We give combinatorial proofs that certain families of differences of products of Schur functions are monomial-positive. We show in addition that such monomial-positivity is to be expected of a large class of generating functions with…

Combinatorics · Mathematics 2007-05-23 Thomas Lam , Pavlo Pylyavskyy

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…

Combinatorics · Mathematics 2007-05-23 Jan Snellman