Related papers: Divisors of an Integer in a Short Interval

For a wide class of sequences of integer domains $\mathcal{D}_n\subset\mathbb{N}^d$, $n\in\mathbb{N}$, we prove distributional limit theorems for $F(X_1^{(n)},\ldots,X_d^{(n)})$, where $F$ is a multivariate multiplicative function and…

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…

We show that the sequence of ratios $d(n+1) / d(n)$ of consecutive values of the divisor function attains every positive rational infinitely many times. This confirms a prediction of Erd\H{o}s.

The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having…

Let $D$ be a division ring. In this paper, we investigate properties of subgroups of an arbitrary subnormal subgroup of the multiplicative group $D^*$ of $D$. The new obtained results generalize some previous results on subgroups of $D^*$.

Let $Q(n)$ denote the count of the primitive subsets of the integers $\{1,2\ldots n\}$. We give a new proof that $Q(n) = \alpha^{(1+o(1))n}$ which allows us to give a good error term and to improve upon the lower bound for the value of this…

We focus on the computational aspects of counting interval sizes in the poset $D_n$, which represents all monotone Boolean functions of $n$ variables. We present a resource-aware algorithm enabling the calculation of interval sizes in…

We extend the sum-of-divisors function to the complex plane via the Gaussian integers. Then we prove a modified form of Euler's classification of odd perfect numbers.

In this paper we study $N_d(k)$ the smallest positive integer such that any nice measure $\mu$ in $\R^d$ can be partitioned in $N_d(k)$ parts of equal measure so that every hyperplane avoids at least $k$ of them. A theorem of Yao and Yao…

In this paper, the problem of the minimal description of the structure of a vector function f(x) over an $N$-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x)…

This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…

For an odd integer $d > 1$ and a finite Galois extension $K/\mathbb{Q}$ of degree $d$, G. L\"{u} and Z. Yang \cite{lu3} obtained an asymptotic formula for the mean values of the divisor function for $K$ over square integers. In this…

Differential-difference equation $\frac{d}{dx}t(n+1,x)=f(x,t(n,x),t(n+1,x),\frac{d}{dx}t(n,x))$ with unknown $t(n,x)$ depending on continuous and discrete variables $x$ and $n$ is studied. We call an equation of such kind Darboux…

Let $F(X,Y)=Y^d+a_1(X)Y^{d-1}+...+a_d(X)$ be a polynomial in $n+1$ variables $(X,Y)=(X_1,...,X_n,Y)$ with coefficients in an algebraically closed field K. Assuming that the discriminant $D(X)=\disc_Y F(X,Y)$ is nonzero we investigate the…

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

Let $p$ and $q$ be distinct primes. The \textit{semiprime divisor function graph} denoted by $G_{D(pq)}$, is the graph with vertex set $V(G_{D(pq)})=\{1,p,q,pq\}$ and edge set $E(G_{D(pq)})=\{\{1,p\}, \{1,q\},\{1,pq\},\{p,pq\},\{q,pq\}\}$.…

Let $D$ and $U$ be linear operators in a vector space (or more generally, elements of an associative algebra with a unit). We establish binomial-type identities for $D$ and $U$ assuming that either their commutator $[D,U]$ or the second…

New unconditional estimates of the divisor and totient functions are contributed to the literature. These results are consistent with the Riemann hypothesis and seem to solve the Nicolas inequality for all sufficiently large integers.

Pseudodifferential operators of several variables are formal Laurent series in the formal inverses of $\partial_1, ..., \partial_n$ with $\partial_i = d$ $1 \leq i \leq n$. As in the single variable case, Lax equations can be constructed…

Given a continuous function $f:[a,b]\to\mathbb{R}$ such that $f(a)=f(b)$, we investigate the set of distances $|x-y|$ where $f(x)=f(y)$. In particular, we show that the only distances this set must contain are ones which evenly divide…