相关论文: Integers with a divisor in (y,2y]

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

For a given partition of (1, 2, ..., 2n) into two disjoint subsets A and B with n elements in each, consider the maximum number of times any integer occurs as the difference between an element of A and an element of B. The minimum value of…

An ordered triple $(s,p,n)$ is called admissible if there exist two different multisets $X=\{x_1,x_2,\dotsc,x_n\}$ and $Y=\{y_1,y_2,\dotsc,y_n\}$ such that $X$ and $Y$ share the same sum $s$, the same product $p$, and the same size $n$. We…

Let $k \geq 2$ be an integer. We prove that factorization of integers into $k$ parts follows the Dirichlet distribution $\text{Dir}\left(\frac{1}{k},\ldots,\frac{1}{k}\right)$ by multidimensional contour integration, thereby generalizing…

We prove there exist infinitely many odd integers $n$ for which there exists a pair of positive divisors $d_1, d_2>1$ of $(n^2+1)/2$ such that $$d_1+d_2=\delta n+(\delta+2).$$ We prove the similar result for $\varepsilon=\delta-2$ and…

We investigate the behavior of the divisor function in both short intervals and in arithmetic progressions. The latter problem was recently studied by \'E. Fouvry, S. Ganguly, E. Kowalski, and Ph. Michel. We prove a complementary result to…

Let $\{p_1,\dots,p_n\}$ and $\{q_1,\dots,q_n\}$ be two sets of $n$ labeled points in general position in the plane. We say that these two point sets have the same order type if for every triple of indices $(i,j,k)$, $p_k$ is above the…

Let $(X,o)$ be a germ of a 3-dimensional terminal singularity of index $m\geq 2$. If $(X,o)$ has type cAx/4, cD/3-3, cD/2-2, or cE/2, then assume that the standard equation of $X$ in $\mathbb{C}^4/\mathbb{Z}_m$ is non-degenerate with…

In the present work we investigate the largest possible gaps between consecutive numbers which can be written as the difference of two primes. The best known upper bounds are the same as those concerning the largest possible difference of…

Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…

The present paper completes the computation of the separating Noether numbers for the groups with order strictly less than $32$. Most of the results are proved for the case of a general (possibly finite) base field containing an element…

Distinguir entre enteros con un n\'umero par o impar de divisores primos es una de las tareas m\'as dif\'iciles en la teor\'ia anal\'itica de n\'umeros. Un trabajo reciente de Matom\"aki y Radziwi{\l}{\l} muestra que, en promedio, ambos…

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

The purpose of this paper is two-fold. We first prove a series of results, concerned with the notion of Zariski multiplicity, mainly for non-singular algebraic curves. These results are required in the paper "A Theory of Branches for…

Our objective is to provide an upper bound for the length $\ell_N$ of the longest run of consecutive integers smaller than $N$ which have the same number of divisors. We prove in an elementary way that $\log\ell_N\ll(\log N\log\log…

We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…

Let $G$ be a graph and $a,b$ vertices of $G$. A minimal $a,b$-separator of $G$ is an inclusion-wise minimal vertex set of $G$ that separates $a$ and $b$. We consider the problem of enumerating the minimal $a,b$-separators of $G$ that…

Let $d(n)$ and $d^{\ast}(n)$ be the numbers of divisors and the numbers of unitary divisors of the integer $n\geq1$. In this paper, we prove that \[ \underset{n\in\mathcal{B}}{\underset{n\leq x}{\sum}}\frac{d(n)}{d^{\ast}% (n)}=\frac{16\pi%…