中文
相关论文

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

200 篇论文

We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…

组合数学 · 数学 2011-04-08 Svante Janson

Our work is motivated by the fact that the norms of the Eulerian integers are related to the sums of form $a^2-ab+b^2$, providing a natural generalization for problems concerning products over sums or differences of integers. Let $E$ be the…

数论 · 数学 2026-02-10 Erik Füredi , Katalin Gyarmati

The integer division of a numerator n by a divisor d gives a quotient q and a remainder r. Optimizing compilers accelerate software by replacing the division of n by d with the division of c * n (or c * n + c) by m for convenient integers c…

数据结构与算法 · 计算机科学 2021-11-16 Daniel Lemire , Colin Bartlett , Owen Kaser

We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…

数论 · 数学 2026-04-16 Mario Ziller

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

数论 · 数学 2016-03-17 Yan Kun , Li Hou Biao

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

数论 · 数学 2024-06-11 Michael Hellus , Anton Rechenauer , Rolf Waldi

A number is said to be $y$-friable if it has no prime factor greater than $y$. In this paper, we prove a central limit theorem on average for the distribution of divisors of $y$-friable numbers less than $x$, for all $(x, y)$ satisfying…

数论 · 数学 2016-12-14 Sary Drappeau

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…

数论 · 数学 2014-02-26 Javier Cilleruelo , D. S. Ramana , Olivier Ramare

If $s$ is a positive integer and $A$ is a set of positive integers, we say that $B$ is an $s$-divisor of $A$ if $\sum_{b\in B} b\mid s\sum_{a\in A} a$. We study the maximal number of $k$-subsets of an $n$-element set that can be…

组合数学 · 数学 2015-05-21 Samuel Zbarsky

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…

数论 · 数学 2009-10-10 László Tóth

For a wide range of $x$ and $y$ we show that ${\Cal S}(x,y)$, the set of integers below $x$ composed only of prime factors below $y$, is equidistributed in the reduced residue classes $\pmod q$ for all $q<y^{4\sqrt{e}-\epsilon}$. This…

数论 · 数学 2007-07-04 K. Soundararajan

We reprove twice, in a simpler but as elementary way, a result by Hor\'ak and Skula (1985) who determined, among all sequences of integers defined by $$u_1=1,\quad u_2=R,\quad u_{n+2}=Pu_{n+1}-Qu_n$$ for some integers $P,Q,R$, those which…

数论 · 数学 2017-06-20 A. Bauval

For each integer $b \geq 3$ and every $x \geq 1$, let $\mathcal{N}_{b,0}(x)$ be the set of positive integers $n \leq x$ which are divisible by the product of their nonzero base $b$ digits. We prove bounds of the form $x^{\rho_{b,0} + o(1)}…

数论 · 数学 2020-12-15 Carlo Sanna

We establish new upper bounds for the length of runs of consecutive positive integers each with exactly $k$ divisors, where $k$ is a given positive integer of some special forms. Also we have found exact values of the maximum possible runs…

数论 · 数学 2018-11-14 Vasilii A. Dziubenko , Vladimir A. Letsko

We show that if an essentially arbitrary sequence supported on an interval containing $x$ integers, is convolved with a tiny Siegel-Walfisz-type sequence supported on an interval containing $\exp((\log x)^{\varepsilon})$ integers then the…

数论 · 数学 2018-11-22 Étienne Fouvry , Maksym Radziwiłł

Iannucci considered the positive divisors of a natural number $n$ that do not exceed the square root of $n$ and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be…

数论 · 数学 2019-12-30 Hung Viet Chu

We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over the rationals.

数论 · 数学 2009-09-08 R. de la Bretèche , T. D. Browning

In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of intervals. Motivated by a recent paper of Keller, Trenk, and…

组合数学 · 数学 2024-11-13 Csaba Biro , Sida Wan

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

We study primitive divisors of terms of the sequence P_n=n^2+b, for a fixed integer b which is not a negative square. It seems likely that the number of terms with a primitive divisor has a natural density. This seems to be a difficult…

数论 · 数学 2007-05-23 Graham Everest , Glyn Harman