Call a set $A$ of positive integers admissible if, whenever $a_1\cdots a_r=b_1\cdots b_s$ with $a_1,\dots,a_r$ distinct elements of $A$ and $b_1,\dots,b_s$ distinct elements of $A$, necessarily $r=s$. Erdős asked whether admissible sets can have density $1-\varepsilon$ for every $\varepsilon>0$, and whether $\{1,\dots,N\}$ always contains an admissible subset of size $(1-o(1))N$. For the variant in which repetitions are allowed both questions were answered negatively by Erdős, Ruzsa and Sárközy and by Granville and Soundararajan; for products of distinct elements, the first question was answered only recently (with density bound $7/8$), and the second has remained open. We show that every admissible $A\subseteq\{1,\dots,N\}$ satisfies $\sum_{a\in A}1/a\le\tfrac12\log N+(\log\log N+2)^2$, and that there is an absolute constant $η>0$ such that every admissible $A\subseteq\{1,\dots,N\}$ has $|A|<(1-η)N$ for all large $N$. Both questions therefore have negative answers. The proofs are elementary; the second rests on a coupling that replaces the largest divisor of an integer composed of small primes, which avoids the divisor-function losses inherent in counting quotients along a multiplication table. Both negative answers are formally verified in Lean 4 against the statements of the Formal Conjectures project.