Quanyu Tang

most citedPrimitive sets and von Mangoldt chains: Erdős Problem #1196 and beyond

1 citations · 2 across the 12 of their papers we have counts for

collaborators

Showing math.NTShow all

4 papers · 1 filter

math.NT2026

Consecutive integers free of certain prime factors

Wouter van Doorn, Quanyu Tang

Let $n_{k}$ denote the least integer $n > 2 k$ such that $(n - k) (n - k + 1) \dots (n - 1)$ is not divisible by any prime in the interval $(k, 2 k)$ . Confirming a conjecture of Erdős, we prove tha…

math.NT2026

Gaps in Multiplicative Sidon Sets II

Wouter van Doorn, Quanyu Tang

With $ρ = \frac{13 - 69}{10} \approx 0.47$ , it was recently established that there exist multiplicative Sidon sets (sets without any non-trivial solutions to $ab = c d$ ) in $\{1…

math.NT2026

Gaps in Multiplicative Sidon Sets

Wouter van Doorn, Pietro Monticone, Quanyu Tang

For a positive integer $n$ , let $g (n)$ denote the infimum of all real numbers $L$ such that there exists a multiplicative Sidon set $A \subseteq {1, 2, \dots, n}$ that intersects ever…

math.NT2026★ 1 cited

Primitive sets and von Mangoldt chains: Erdős Problem #1196 and beyond

Boris Alexeev, Kevin Barreto, Yanyang Li +5

A set of integers is primitive if no number in the set divides another. We introduce a new method for bounding Erdős sums of primitive sets, suggested from output of GPT-5.4 Pro, b…