\documentclass[11pt,leqno]{amsart} \usepackage[letterpaper,margin=1in]{geometry} \usepackage{amsmath,amssymb,mathtools} \usepackage{microtype} \usepackage{needspace} \usepackage[colorlinks=true,linkcolor=blue,citecolor=blue,urlcolor=blue]{hyperref} \hypersetup{pdftitle={The sharp deficit in primitive signed reciprocal relations}, pdfauthor={Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer}, pdfsubject={Erdos Problem 319}} \numberwithin{equation}{section} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R} \newcommand{\e}{\mathrm e} \newcommand{\lcm}{\operatorname{lcm}} \newcommand{\pp}{\mathcal Q} \newcommand{\eps}{\varepsilon} \newcommand{\ind}{\mathbf 1} \newcommand{\Ph}{P^{+}} \newcommand{\card}[1]{\lvert #1\rvert} \newcommand{\norm}[1]{\left\lVert #1\right\rVert} \newcommand{\rec}[1]{R(#1)} \newcommand{\floor}[1]{\left\lfloor #1\right\rfloor} \newcommand{\ceil}[1]{\left\lceil #1\right\rceil} \newcommand{\dd}{\,\mathrm d} \newcommand{\Logtwo}{\log\log} \newcommand{\Logthree}{\log\log\log} \allowdisplaybreaks[1] \title[Primitive signed reciprocal relations]{The sharp deficit in primitive signed reciprocal relations} \author{Will Howe} \author{Grant Huffman} \author{Jensen Kohlmeyer} \author{Liam Kruer} \thanks{Email addresses.\ \href{mailto:howew@purdue.edu}{\nolinkurl{howew@purdue.edu}} (Will Howe), \href{mailto:huffma97@purdue.edu}{\nolinkurl{huffma97@purdue.edu}} (Grant Huffman).\newline \href{mailto:jenwin@purdue.edu}{\nolinkurl{jenwin@purdue.edu}} (Jensen Kohlmeyer), \href{mailto:kruerl@purdue.edu}{\nolinkurl{kruerl@purdue.edu}} (Liam Kruer).} \date{November 12, 2026} \subjclass[2020]{11D68, 11B75, 11N25} \keywords{Egyptian fractions, primitive relations, reciprocal sums, Erd\H{o}s Problem 319} \begin{document} \begin{abstract} Let $c(N)$ be the largest cardinality of a subset of $\{1,\ldots,N\}$ admitting a signed reciprocal sum equal to zero with no nonempty proper zero subsum under the same signs. We prove \[ N-c(N)\sim \e^{-\gamma} \frac{N\log\log\log N}{\log\log N}, \] where $\gamma$ is Euler's constant. The construction joins divisor blocks along a path of primes and completes their reciprocal sum while avoiding those primes. For the converse, we prove a sharp harmonic bound for sets whose reciprocals have no nonempty zero subsum modulo an arbitrary integer. Exact rational representation in a dense sign class then turns this modular bound into a lower bound for the omitted denominators. \end{abstract} \maketitle \section{Introduction} For an integer $N\ge1$, write $[N]=\{1,\ldots,N\}$. A pair $(A,\delta)$, where $A\subseteq[N]$ and $\delta\colon A\longrightarrow\{-1,1\}$, is a \emph{primitive signed reciprocal relation} if \begin{equation}\label{eq:primitive} \sum_{n\in A}\frac{\delta(n)}n=0, \qquad \sum_{n\in B}\frac{\delta(n)}n\ne0 \quad(\varnothing\ne B\subsetneq A). \end{equation} The signs in the second condition are the restrictions of $\delta$. Let $c(N)$ be the maximum cardinality of such a support, with value zero when no nonempty support exists. Erd\H{o}s and Graham asked for the size of this extremal function \cite[p.~43]{EG}. The question is recorded as Problem~319 in \cite{Bloom319}. \begin{theorem}\label{thm:main} As $N\longrightarrow\infty$ through the positive integers, \begin{equation}\label{eq:main} N-c(N)=\bigl(\e^{-\gamma}+o(1)\bigr) \frac{N\log\log\log N}{\log\log N}. \end{equation} \end{theorem} Throughout the paper, all logarithms are natural. We use the notation \begin{equation}\label{eq:scales} L=\log N,\qquad \lambda=\log\log N,\qquad \mu=\log\log\log N,\qquad \Delta_N=\frac{N\mu}{\lambda}. \end{equation} These quantities are used only for sufficiently large $N$. For a finite set $E$ of positive integers, put \[ R(E)=\sum_{n\in E}\frac1n, \qquad E_q=\{n\in E:q\mid n\},\qquad D_E=\lcm\{n:n\in E\}, \] and set $D_\varnothing=1$. We write $\pp(E)$ for the set of all prime powers dividing at least one member of $E$. In particular, every positive power of a prime up to its exponent in $D_E$ belongs to $\pp(E)$. An integer is \emph{$S$-powersmooth} if every prime-power divisor is at most $S$. We take $\Ph(1)=1$ and use $\Omega(n)$ for the number of prime factors counted with multiplicity. Croot's short-interval theorem \cite{Croot} gives the earlier lower bound $c(N)\ge(1-1/\e+o(1))N$, as observed by Adenwalla \cite{Bloom319}. A density-one construction was subsequently proposed by g-01234, also known as popular\_12345 \cite{DensityOne}. Its mechanism couples a positive family with a dense set of denominators avoiding a specified collection of primes. We use this mechanism with a path of pairwise connectors and quantitative denominator control. A complementary large-prime obstruction appears in \cite{RexHannes}. The exact rational representation theorem of Liu and Sawhney \cite{LS} supplies the analytic input for our converse. We state the form needed here and give its divisor and Fourier argument in Appendix~\ref{app:representation}. \section{Analytic preliminaries}\label{sec:prelim} We use the prime number theorem, partial summation, and the Mertens estimates in the forms \begin{equation}\label{eq:mertens} \sum_{p\le x}\frac1p=\log\log x+O(1),\qquad \prod_{p\le x}(1-p^{-1})^{-1}\sim\e^\gamma\log x, \qquad \sum_{p^j\le x}\log p\sim x. \end{equation} Here and below a letter $p$ in a prime sum denotes a prime, and $j\ge1$. The usual prime-number-theorem error term also gives $\sum_{xS}} \frac1q&=O(L^{-1/5}),\label{eq:pptail}\\ \card{\{n\le N:n\text{ is not }S\text{-powersmooth}\}} &\le N\Theta(N,S),\label{eq:nonsmooth}\\ \card{\{n\le N:\Omega(n)>5\lambda\}}&=O(NL^{-3/2}). \label{eq:omega} \end{align} If $Y\longrightarrow\infty$ and $u\ge1$, then \begin{equation}\label{eq:rankin} \sum_{\substack{n>Y^u\\\Ph(n)\le Y}}\frac1n \ll \e^{-u}\log Y. \end{equation} The implied constants are absolute. \end{lemma} \begin{proof} For primes in $(S,N]$, partial summation and $\pi(x)\ll x/\log x$ give \[ \sum_{S\sqrt S$ contribute at most $2\sum_{n>\sqrt S}n^{-2}=O(S^{-1/2})$. This proves \eqref{eq:pptail}, and a union bound proves \eqref{eq:nonsmooth}. The multiplicative identity \[ (3/2)^{\Omega(n)}=\sum_{d\mid n}g(d),\qquad g(p^j)=\tfrac12(3/2)^{j-1} \] and its Euler product give \[ \sum_{n\le N}(3/2)^{\Omega(n)} \le N\prod_{p\le N}\left(1+\frac{1/2}{p-3/2}\right) \ll N L^{1/2}. \] Markov's inequality proves \eqref{eq:omega}, because $1/2-5\log(3/2)<-3/2$. For \eqref{eq:rankin}, take $\sigma=1/\log Y$. Rankin's inequality gives \[ \sum_{\substack{n>Y^u\\\Ph(n)\le Y}}\frac1n \le \e^{-u}\prod_{p\le Y}(1-p^{-1+\sigma})^{-1}. \] The product on the right is $O(\log Y)$. Indeed, its logarithm differs from that of the Mertens product by $O(1)$, using $p^\sigma-1\le\e\sigma\log p$ and $\sum_{p\le Y}(\log p)/p\ll\log Y$. The terms of degree at least two in the logarithmic expansions have bounded total. \end{proof} \begin{lemma}[Exact rational representation]\label{lem:exact} For all sufficiently large $N$, let $L^{-3/100}\le c\le1$ and let $E\subseteq[cN,N]\cap\N$ satisfy \begin{gather} \card E\ge N/L^2,\qquad n\text{ is }S\text{-powersmooth and }\Omega(n)\le5\lambda \quad(n\in E),\label{eq:exacthyp1}\\ qR(E_q)\ge L^{-1/25}\quad(q\in\pp(E)), \qquad S=N\exp(-6L^{4/5}).\label{eq:exacthyp2} \end{gather} If $r>0$ is rational, its reduced denominator divides $D_E$, and \begin{equation}\label{eq:targetrange} (1+L^{-1})r\le R(E)\le Lr, \end{equation} then $R(F)=r$ for some $F\subseteq E$. The threshold is uniform over $c,E,r$. \end{lemma} This is the logarithmic-parameter specialization of the reciprocal-sum criterion of Liu and Sawhney \cite[Proposition~5.2]{LS}. Appendix~\ref{app:representation} supplies the specialization and the details of the divisor extraction used in its proof. \begin{lemma}[Cleaning]\label{lem:cleaning} For all sufficiently large $N$ and every $E\subseteq[N]$ there is $F\subseteq E$ such that all members of $F$ are $S$-powersmooth, $\Omega(n)\le5\lambda$ on $F$, and $qR(F_q)\ge L^{-1/25}$ for every $q\in\pp(F)$. Moreover, \begin{equation}\label{eq:cleanloss} \card{E\setminus F} \ll N\bigl(L^{-1/5}+L^{-3/2}+L^{-1/25}\lambda\bigr). \end{equation} After the first two restrictions, the further loss in reciprocal mass is $O(L^{-1/25}\lambda)$. \end{lemma} \begin{proof} Apply the first two restrictions using Lemma~\ref{lem:cleanestimates}. Whenever a prime power $q$ divides a member of the current set and $qR(E_q)<\eta:=L^{-1/25}$, remove all its multiples. A processed prime power never reappears. The total reciprocal mass removed is at most \[ \eta\sum_{\substack{q\le N\\q\text{ a prime power}}}\frac1q =O(\eta\lambda). \] The number of removed denominators is at most $N$ times this mass. The finite process terminates with the required properties. \end{proof} \section{Reciprocal sums modulo an integer}\label{sec:modular} For $q\ge2$, a finite set $V$ of positive integers coprime to $q$ is \emph{inverse-zero-free modulo $q$} if \[ \sum_{n\in U}n^{-1}\ne0\pmod q \qquad(\varnothing\ne U\subseteq V). \] The inverses in this definition are taken in $\Z/q\Z$. The partial sums along any ordering of $V$, including the initial zero, are distinct. Consequently, \begin{equation}\label{eq:length} \card V\le q-1. \end{equation} \begin{lemma}[Prime inverse sums]\label{lem:primecover} There is an absolute constant $C$ with the following property. For sufficiently large $q$, write $\ell=\log q$ and $Y=\ell^3(1+\log\ell)^2$. If $Y\le X\le q$ and a set contains at least \[ k_X=\ceil{C\ell X^{2/3}(\log X)^{-2/3}} \] distinct primes in $[X,2X)$ coprime to $q$, its inverse subset sums cover every residue class modulo $q$. \end{lemma} \begin{proof} Use exactly $k=k_X$ primes. Fix $00$ at each residue. This is the prime-inverse Fourier argument of Croot \cite[Lemma~1 of the preprint]{Croot}, with a varying prime interval. \end{proof} \begin{lemma}\label{lem:largeprimeweight} Uniformly over inverse-zero-free $V$ modulo $q$, \[ \sum_{\substack{n\in V,\ n\le q\\\Ph(n)>Y}}\frac1n=O(1), \qquad Y=(\log q)^3(1+\log\log q)^2. \] \end{lemma} \begin{proof} Write $n=mp$, where $p=\Ph(n)$, and partition $p>Y$ into dyadic intervals $[X,2X)$. For a fixed $m$, at most $k_X$ primes can occur. Otherwise one can reserve a prime, express its negative inverse using $k_X$ of the remaining primes by Lemma~\ref{lem:primecover}, and multiply by $m^{-1}$ to obtain a forbidden zero subsum. Since $\Ph(m)\le2X$, the contribution of this interval is at most \[ \frac{k_X}{X}\prod_{p\le2X}(1-p^{-1})^{-1} \ll (\log q)X^{-1/3}(\log X)^{1/3}. \] The geometric sum over the intervals is $O((\log q)Y^{-1/3}(\log Y)^{1/3})=O(1)$. \end{proof} \begin{lemma}\label{lem:localdensity} For every $\beta>0$, all sufficiently large $q$ have the following property, uniformly for integers $t\ge\log q$ and inverse-zero-free $V$ modulo $q$, \begin{equation}\label{eq:localdensity} \card{\{n\in V:t/2\log q\}}<\beta t. \end{equation} \end{lemma} \begin{proof} We may assume $0<\beta<1$. Suppose the set in \eqref{eq:localdensity} has at least $\beta t$ members. Apply Lemma~\ref{lem:cleaning} with ambient parameter $t$. The resulting set $W\subseteq(t/2,t]$ has $\card W\ge\beta t/2$ for all sufficiently large $t$, and \[ \beta/2\le R(W)\le1. \] Put $D=D_W$ and $\ell=\log q$. Every member of $W$ has a prime factor greater than $\ell$. If $\mathcal P$ is the collection of such primes dividing $D$, a union bound gives $\sum_{p\in\mathcal P}p^{-1}\ge\beta/2$. Therefore \begin{equation}\label{eq:largelcm} \log D\ge\sum_{p\in\mathcal P}\log p \ge\ell\log\ell\sum_{p\in\mathcal P}\frac1p \ge\tfrac\beta2\ell\log\ell. \end{equation} In particular $q/D\longrightarrow0$, uniformly in $t$. Choose a positive integer $x$ divisible by $q$ such that $\beta/8\le x/D\le\beta/4$. The hypotheses of Lemma~\ref{lem:exact}, with ambient parameter $t$ and $c=1/2$, hold for $W$ and $r=x/D$. Its cardinality condition and target inequalities hold once $t$ is sufficiently large in terms of $\beta$. It gives a nonempty $U\subseteq W$ with $R(U)=x/D$. Since $(D,q)=1$ and $q\mid x$, reduction modulo $q$ contradicts inverse zero-freeness. Every threshold in this argument is uniform for $t\ge\log q$, proving the assertion. \end{proof} \begin{theorem}[Sharp modular harmonic bound]\label{thm:harmonic} Uniformly over all finite inverse-zero-free sets $V$ modulo $q$, \begin{equation}\label{eq:modularsharp} R(V)\le\bigl(\e^\gamma+o(1)\bigr)\log\log q \qquad(q\longrightarrow\infty). \end{equation} The coefficient $\e^\gamma$ is sharp, even when $q$ is restricted to primes. \end{theorem} \begin{proof} Write $\ell=\log q$ and $Y=\ell^3(1+\log\ell)^2$. The terms exceeding $q$ have total at most $1$ by \eqref{eq:length}. Lemma~\ref{lem:largeprimeweight} treats the terms at most $q$ with $\Ph(n)>Y$. For fixed $A>1$, Lemma~\ref{lem:cleanestimates} gives \[ \sum_{\substack{n>Y^A\\\Ph(n)\le Y}}\frac1n \ll\e^{-A}\log Y. \] There are $O(A\log Y)$ dyadic intervals between $\ell$ and $Y^A$. By Lemma~\ref{lem:localdensity}, each contributes at most $2\beta$ to the reciprocal mass of terms with $\Ph(n)>\ell$, for sufficiently large $q$ in terms of $\beta$. Thus this entire part has mass \[ O(1)+O(\e^{-A}\log Y)+O(\beta A\log Y). \] Divide by $\log\ell$. First let $q$ tend to infinity with $A,\beta$ fixed, then let $A$ tend to infinity and $\beta A$ tend to zero. The contribution is $o(\log\ell)$, uniformly in $V$. The remaining terms have total at most \[ \sum_{\Ph(n)\le\ell}\frac1n =\prod_{p\le\ell}(1-p^{-1})^{-1} =\bigl(\e^\gamma+o(1)\bigr)\log\ell. \] For sharpness, let $q$ be prime and put $D=\lcm(1,\ldots,\floor{\tfrac14\log q})$. The set of positive divisors of $D$ is coprime to $q$ for large $q$. Every nonempty reciprocal subtotal is $a/D$ with $00$, all sufficiently large $N$ satisfy the following uniform assertion. If integers $q,t$ satisfy $2\le q\le N$ and $t\ge\exp(\lambda^3)$, and $V\subseteq[t]$ is inverse-zero-free modulo $q$, then $\card V\le\eps t$. \end{corollary} \begin{proof} For $q$ above a sufficiently large fixed threshold, Lemma~\ref{lem:localdensity} and a dyadic partition bound the number of members with $\Ph(n)>\log q$ by $\eps t/2$. All remaining members are $L$-smooth. Rankin's inequality, with $\sigma=1/\log L=1/\lambda$, gives \[ \card{\{n\le t:\Ph(n)\le L\}} \le t^{1-\sigma}\prod_{p\le L}(1-p^{-1+\sigma})^{-1} \ll t\lambda\e^{-\lambda^2}=o(t). \] For bounded $q$, use \eqref{eq:length}. \end{proof} \Needspace{20\baselineskip} \section{A dense primitive construction}\label{sec:construction} For a positive integer $G$, write \[ \Z_{(G)}=\{a/b\in\Q:(b,G)=1\}. \] Membership is understood after reduction, or equivalently through any representation with denominator coprime to $G$. \begin{lemma}[A path of prime blocks]\label{lem:path} Let $D\ge1$, put $H=\sum_{d\mid D}d^{-1}$ and $K=DH$, and let $p_1,\ldots,p_k$ be distinct primes, where $k\ge2$, $p_i>K+1$, and $p_i\nmid D$. Suppose \[ 01\quad(e\in E),\qquad R(E)\in\Z_{(G)},\label{eq:path1}\\ R(U)\in\Z_{(G)},\ U\subseteq E \quad\Longrightarrow\quad U=\varnothing\text{ or }U=E,\label{eq:path2}\\ \max E\le\max\{MD,4kM^4\},\qquad H\rho\le R(E)\le H\rho+\rho/B.\label{eq:path3} \end{gather} \end{lemma} \begin{proof} Place the block $\{p_i d:d\mid D\}$ at vertex $i$ of a path. For a denominator divisible by $p_i$ exactly once, its residue at $p_i$ means the reduction of $p_i$ times its reciprocal modulo $p_i$. Let $\mathcal S_i\subseteq\mathbb F_{p_i}$ be the set of block subsums of these residues, and let $s_i$ be the full-block residue. After multiplication by $D$, every such subsum is an integer between $0$ and $K0$ there is a constant $C_\eta$ such that the following holds for all sufficiently large integers $m$. Let $G\ge1$ and let $r\in[\eta,2]\cap\Z_{(G)}$. Suppose every prime-power component of the reduced denominator of $r$ is at most $m/(\log m)^{14}$, and every prime divisor of $G$ exceeds both $C_\eta$ and $(\log m)^{13}$. Then \[ r=R(C),\qquad C\subseteq[m],\qquad (c,G)=1\quad(c\in C). \] \end{lemma} \begin{proof} For a sufficiently large prime power $q$, put $X=(\log q)^{12}$ and $k=\ceil{(\log q)^{10}}$. There are at least $k$ primes in $[X,2X)$ coprime to $q$, by the prime number theorem. Lemma~\ref{lem:primecover} applies to any $k$ of them, since its required number is $o(k)$. Consequently every residue modulo $q$ is a sum of inverses of a subset of these primes. The corresponding denominators $qp$ have total reciprocal mass at most \begin{equation}\label{eq:completioncost} \frac{k}{qX}\ll\frac1{q(\log q)^2}. \end{equation} Choose $q_0\ge5$ so large that this assertion holds above $q_0$ and the sum of the right side of \eqref{eq:completioncost} over all integers $q>q_0$ is less than $\eta/2$. Starting from $r$, choose the largest prime-power component $q>q_0$ of its current reduced denominator, and write the current fraction as $a/(qv)$, where $(q,v)=1$. Select distinct primes $p\in[X,2X)$ with \[ \sum_p p^{-1}\equiv av^{-1}\pmod q, \] and subtract $\sum_p1/(qp)$. The new denominator divides $\lcm(v,\{p\})$. To see this, multiply the difference by $q\lcm(v,\{p\})$ and use the congruence to cancel the full factor $q$. All its prime-power components are strictly less than $q$. The processed components thus form a strictly decreasing finite sequence. The total subtracted mass is less than $\eta/2$, so the residual remains positive. Every chosen denominator has largest prime-power component exactly its processed $q$. Thus different steps use disjoint denominators. All introduced primes are at most $2(\log m)^{12}< (\log m)^{13}$, and every chosen denominator is at most $2m/(\log m)^2\max\{C_{1/2},(\log n)^{13}\}. \] Lemma~\ref{lem:completion} gives $C\subseteq[n]$, coprime to $G$, with $R(C)=r$. The sets $E,F,C$ are disjoint. Assign positive signs to $E$ and negative signs to $F\cup C$. If a subfamily has signed sum zero, its positive reciprocal subtotal belongs to $\Z_{(G)}$. Lemma~\ref{lem:path} forces its positive part to be empty or all of $E$. Positivity of the unsigned summands then forces its negative part to be empty or all of $F\cup C$, respectively. The relation is primitive. Finally, \eqref{eq:Fcount} and \eqref{eq:rhochoice} imply \[ N-\card{E\cup F\cup C} \le\frac{N}{H}\bigl(\log H+2+o(1)\bigr)+O(NL^{-1/5}). \] Now $H\sim\e^\gamma\lambda$ and $\log H\sim\mu$. The last error is $o(\Delta_N)$, proving the proposition. \end{proof} \section{The lower bound for arbitrary primitive relations}\label{sec:lower} \subsection{The smaller sign class} \begin{lemma}\label{lem:minority} Let $A=A_+\sqcup A_-$ be a primitive signed reciprocal relation in $[N]$ and put $d=N-\card A$. Uniformly over these relations, \begin{equation}\label{eq:minority} \min\{\card{A_+},\card{A_-}\} \le (1+o(1))Nr+\frac{\sqrt r}{1-\sqrt r}\,d, \qquad r\sim200\frac\mu\lambda. \end{equation} In particular, if $d=O(\Delta_N)$, the smaller sign class has $O(\Delta_N)$ elements. \end{lemma} \begin{proof} Fix $b=1/100$ and put \[ \mathcal P=\{p:\lambda^2\le p\le L^b\},\qquad r=\prod_{p\in\mathcal P}(1-p^{-1}),\qquad \tau=L^{-b}. \] The Mertens product gives $r\sim(2/b)\mu/\lambda$. We may suppose both sign classes have at least $Nr/2$ elements. No $p\in\mathcal P$ can satisfy \begin{equation}\label{eq:bothpopular} \card{(A_+)_p}\ge\tau N/p, \qquad \card{(A_-)_p}\ge\tau N/p. \end{equation} To prove this, restrict either sign class to $[NL^{-3b},N]$ and apply Lemma~\ref{lem:cleaning}. The lower cutoff removes at most $NL^{-3b}/p+1$ multiples of $p$. The powersmooth and $\Omega$ restrictions remove $O(NL^{-1/5}+NL^{-3/2})=o(NL^{-2b})$ integers. Hence at least $\tau N/(2p)$ multiples of $p$ remain before pruning. Their reciprocal mass is at least $\tau/(2p)\ge L^{-2b}/2$. The pruning removes mass $O(L^{-4b}\lambda)=o(L^{-2b})$, so $p$ still divides the lcm of the resulting set $U$. Also $\card U\ge Nr/3$ and \[ r/3\le R(U)\le3b\lambda+O(1). \] Apply Lemma~\ref{lem:exact} to $U$ with target $1/p$. Its mass inequalities follow from $p\ge\lambda^2$ and $p\le L^b$. Doing this for both signs produces two subsets of equal mass $1/p$. Their union is a nonempty proper zero subsum, since the full mass of either sign class is at least $r/2>1/p$ for large $N$. This contradiction proves the assertion. Assign each prime in $\mathcal P$ to a sign with the greater number of multiples. A term bearing a prime assigned to its opposite sign lies in an exceptional set of size at most \[ E=\tau N\sum_{p\in\mathcal P}\frac1p=o(Nr). \] Write $r_+,r_-$ for the products of $1-1/p$ over the two assigned collections, so $r_+r_-=r$. Relabel the signs so $r_-\le\sqrt r$. The product $Q=\prod_{p\in\mathcal P}p$ is $N^{o(1)}$. Periodicity modulo $Q$ counts the integers bearing a prime from each collection as \[ N(1-r_+)(1-r_-)+O(Q)\le d+E+O(Q). \] The positive terms outside the exceptional set avoid all minus-assigned primes. Their number is at most \begin{align*} \card{A_+} &\le Nr+N(1-r_+)r_-+E+O(Q)\\ &\le Nr+\frac{r_-}{1-r_-}(d+E+O(Q))+E+O(Q). \end{align*} Since $Q=o(Nr)$, this proves \eqref{eq:minority}. \end{proof} \subsection{Denominator excess and reciprocal mass} Fix a positive integer $D$ and put $\nu_p=v_p(D)$ and \begin{equation}\label{eq:missingpowers} s_p=p^{\nu_p+1},\qquad \mathcal S_D=\{s_p:s_p\le N\},\qquad \rho_D=\sum_{s\in\mathcal S_D}\frac1s. \end{equation} For $n\ge1$ define \begin{equation}\label{eq:excess} b(n)=\prod_p p^{\max\{v_p(n)-\nu_p,0\}},\qquad Q_b=\prod_{p\mid b}p^{\nu_p+v_p(b)}. \end{equation} If $b(n)=b$, then $n=Q_bm$, where $m\mid D_b$ and $(m,b)=1$, with $D_b=D/\prod_{p\mid b}p^{\nu_p}$. For any subset of this group, \begin{equation}\label{eq:compatibility} D\sum_n\frac1n=\frac1b\sum_m\frac{D_b}{m}. \end{equation} Thus its reciprocal sum has reduced denominator dividing $D$ exactly when the inverse sum of its cofactors is zero modulo $b$. \begin{lemma}\label{lem:weighted} For every $\eps>0$ there are constants $C_\eps$ and $\delta_\eps>0$ such that, for sufficiently large $N$, the following holds uniformly in $D$ and $V\subseteq[N]$. Suppose $V$ has no member dividing $D$, and the cofactors in each group $b(n)=b>1$ are inverse-zero-free modulo $b$. If $\rho_D\le\delta_\eps$, then \begin{equation}\label{eq:weighted} R(V)\le C_\eps+(\e^\gamma+\eps)\lambda\rho_D. \end{equation} \end{lemma} \begin{proof} Let $h(b)$ be the supremum of reciprocal masses of inverse-zero-free sets modulo $b$. Theorem~\ref{thm:harmonic} gives $h(b)\le(\e^\gamma+\eps')\log\log b$ for sufficiently large $b$, and \eqref{eq:length} gives $h(b)\le1+\log b$ for every $b\ge2$. The contribution of group $b$ is at most $h(b)/Q_b$. Fix a large constant $Y$. The sum over groups supported entirely on primes at most $Y$ is bounded by \[ \sum_{\substack{b>1\\\Ph(b)\le Y}}\frac{1+\log b}{b}<\infty, \] uniformly in $D,N$. For all other groups, choose $Y$ so large that the sharp estimate for $h(b)$ applies. Since $b\le N$ for a nonempty group, their total mass is at most $(\e^\gamma+\eps')\lambda$ times the sum of $Q_b^{-1}$ over groups containing a prime greater than $Y$. For a prime with $s_p\le N$, put \[ a_p=\sum_{j\ge1}p^{-\nu_p-j} =\frac1{s_p(1-1/p)}. \] The required sum of weights is bounded by \[ \left(\sum_{p>Y}a_p\right)\prod_{s_p\le N}(1+a_p) \le\left(1+\frac1{Y-1}\right)\rho_D\exp(2\rho_D). \] First choose $\eps'$ small and $Y$ large, and then choose $\delta_\eps$ small. This proves \eqref{eq:weighted}. \end{proof} \subsection{A dense sign class and the removal of small subsums} Consider a sequence of primitive relations with $d=O(\Delta_N)$. By Lemma~\ref{lem:minority}, orient the signs so that the negative class $B$ has $N-O(\Delta_N)$ elements and the positive class $P$ has $O(\Delta_N)$ elements. Their common reciprocal mass satisfies \begin{equation}\label{eq:commonmass} R(P)=R(B)\ge H_N-H_{d+\card P} \ge\mu-\log\mu-O(1)=(1-o(1))\mu, \end{equation} where $H_j=\sum_{i=1}^j1/i$ and $H_0=0$. Fix $03$, and the upper one follows from $Lr\ge\log(1/a)+1$. In each positive group with a fixed $b>1$, successively remove inclusion-minimal nonempty subsets whose reciprocal sum has denominator dividing $D$. By \eqref{eq:compatibility} and the cyclic partial-sum argument, each has at most $b$ elements and therefore mass at most $b/Q_b\le1$. Remove members of the group $b=1$ as singletons. Let $Z\subseteq P$ be the union of all removed blocks. If $R(Z)\ge u_N$, a first collection of whole blocks crossing $u_N$ would have mass in $[u_N,u_N+1)$ and denominator dividing $D$. By \eqref{eq:dense-targets}, it would have an equal-mass representation in $B$. This would give a nonempty proper zero subsum, since $R(P)>u_N+1$ by \eqref{eq:commonmass}. Consequently \begin{equation}\label{eq:peeled} R(Z)0$, \[ (1-o(1))\mu\le C_\eps+(\e^\gamma+\eps)\lambda\rho+u_N. \] Since $\mu\longrightarrow\infty$, we obtain \begin{equation}\label{eq:rholower} \liminf_{N\to\infty}\frac{\lambda\rho}{\mu}\ge\e^{-\gamma}. \end{equation} \subsection{Counting omitted denominators} Let $\mathcal S=\{s\in\mathcal S_D:s\le S\}$, with $S=N\exp(-6L^{4/5})$. Let $T$ be the set of $S$-powersmooth integers in $(aN,N]$ divisible by exactly one member of $\mathcal S$. Then \begin{equation}\label{eq:Tlower} \card T\ge(1-2a)N\rho-N\rho^2-4S-2N\Theta(N,S). \end{equation} Indeed, let $Z_0(n)$ count the divisors from $\mathcal S$. The pointwise inequality $\ind_{\{Z_0=1\}}\ge2Z_0-Z_0^2$, the first-moment bound \[ \sum_{aN0$ its cardinality is at most $\eps N/Q_b$. Summing over all such groups yields \begin{equation}\label{eq:positiveT} \card{T\cap(P\setminus Z)} \le\eps N\sum_{s_p\le N}\sum_{j\ge1}p^{-\nu_p-j} \le2\eps N\rho. \end{equation} Every negative member of $T$ lies in $(B\cap(aN,N])\setminus F$. Every other member is omitted from $A$ or lies in $Z$ or in $T\cap(P\setminus Z)$. Combining \eqref{eq:coremass}, \eqref{eq:peeled}, \eqref{eq:Tlower}, and \eqref{eq:positiveT} gives \begin{equation}\label{eq:finalcount} d\ge(1-2a-2\eps)N\rho-N\rho^2-o(\Delta_N). \end{equation} Here $S=o(\Delta_N)$ and $N\Theta(N,S)=o(\Delta_N)$ by Lemma~\ref{lem:cleanestimates}. Since $\rho=o(1)$, equations \eqref{eq:rholower} and \eqref{eq:finalcount} imply \[ \liminf\frac d{\Delta_N}\ge(1-2a-2\eps)\e^{-\gamma}. \] Let $a$ and $\eps$ tend to zero after taking the lower limit in $N$. This proves the lower bound for every sequence with $d=O(\Delta_N)$. For extremizers this size restriction follows from Proposition~\ref{prop:upper}. That proposition and the lower bound complete the proof of Theorem~\ref{thm:main}. \appendix \section{Exact rational representation}\label{app:representation} We prove Lemma~\ref{lem:exact} by the divisor extraction and Fourier method of Liu and Sawhney \cite[Section~5]{LS}. Throughout this appendix put \begin{gather*} L=\log N,\quad \lambda=\log L,\quad z=L^{4/5},\quad \eta=L^{-1/25},\quad S=N\e^{-6z},\\ M=\floor{cN/20000},\quad K=M\e^{-z},\quad w=\log(N/M),\\ \Gamma=\max\left\{\frac\eta{L^{1/5}\lambda^3}, \frac{\eta^2L^{3/5}}{w^2\lambda^5}\right\}. \end{gather*} Here $c\ge L^{-3/100}$, so $w=O(\lambda)$ uniformly. In particular, \begin{equation}\label{eq:appendixparameters} \Gamma\gg\frac{L^{13/25}}{\lambda^7},\qquad \frac{\Gamma^2}{L^{1/50}(w+z)} \gg\frac{L^{11/50}}{\lambda^{14}}\longrightarrow\infty. \end{equation} Also $N^{.99}\le S\le K\le M\le N/10^4$ for all sufficiently large $N$. All thresholds below are uniform over the stated range of $c$. We use the following standard upper-bound sieve consequence, also in \cite[Lemma~2.4]{LS}. If $\mathcal P$ is a collection of primes at most $y$, and $y\le\exp(\log X/\sqrt{\log\log X})$, then \begin{equation}\label{eq:sieve} \card{\{n\in[X,2X)\cap\N:p\nmid n\ (p\in\mathcal P)\}} \ll X\prod_{p\in\mathcal P}(1-p^{-1}). \end{equation} The constant is absolute, and the same bound applies to a subinterval by enlarging to the displayed interval. \subsection{Divisor extraction} \begin{lemma}\label{lem:divisorextraction} Let $T\subseteq[M,N]\cap\N$ satisfy $\Omega(n)\le5\lambda$ for every $n\in T$. Suppose $q\le K$ is a prime power and $qR(T_q)\ge\eta/2$. Put \[ H_* =\exp\left(\frac{\eta z}{2\lambda^3w}\right). \] There are a positive integer $d$ and a nonempty $T^*\subseteq T_{qd}$ such that \begin{equation}\label{eq:extraction} qd\ge K,\qquad \min T^*\ge H_*qd,\qquad qdR(T^*)\gg\frac\eta{L^{1/5}\lambda}. \end{equation} \end{lemma} \begin{proof} Set $y=\exp(z/(10\lambda))$. We have $2\le H_*\le y$ for large $N$. For $n\in T_q$, define \[ d_n=\prod_{\substack{p\mid n/q\\p>y}}p^{v_p(n/q)}. \] Then $qd_n\mid n$ and \[ qd_n\ge n/y^{\Omega(n)}\ge M\e^{-z/2}\ge K. \] Call $n$ poor if it has fewer than two distinct prime divisors in $[H_*,y]$. If $n$ is poor, so is $n/q$. We count poor integers in $[M/q,N/q]$ using doubling intervals $[X,2X)$. For integers with no prime in $[H_*,y]$, \eqref{eq:sieve} and the Mertens estimates give $O(X\log H_*/\log y)$. For those with exactly one such prime $p$, divide by $p$ and apply the sieve to the other primes of the interval. Leaving $p$ unsieved changes the product by at most a factor $2$, and permits all its higher powers. Summation over $p$ bounds their number by $O(X\lambda\log H_*/\log y)$. All sieve applications are valid, since $X\ge M/q\ge\e^z$ and $\log y=z/(10\lambda)$, including after division by $p\le y$. There are $O(w)$ doubling intervals, so their reciprocal mass gives \[ qR(\{n\in T_q:n\text{ poor}\}) \ll w\lambda\frac{\log H_*}{\log y} \ll\frac\eta\lambda. \] Discard the poor elements. The remaining set has $q$ times reciprocal mass at least $\eta/4$. Each of its members has two distinct primes in $[H_*,y]$. Division by the prime power $q$ removes at most one of them, and division by $d_n$ removes none. Consequently $n\ge H_*qd_n$. Partition these members according to $d_n=d$. The possible $d$ have all prime divisors in $(y,N]$, and \[ \sum_d\frac1d\le\prod_{y