论文标题
关于具有限制性质量因素的整数集的添加和乘法分解，I。（平滑数字。）
On additive and multiplicative decompositions of sets of integers with restricted prime factors, I. (Smooth numbers.)
论文作者
论文摘要
在[10]中，本文的第三作者提出了两个关于“平滑”（或“易碎”）数字序列的添加性分解性的猜想。 Elsholtz和Harper [4]证明了第二个（要求较少的）猜想（使用筛子方法）。本文的目的是通过使用不同的方法（基于$ s $ unit方程的理论）将其结果扩展并提高其结果。
In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding) conjecture. The goal of this paper is to extend and sharpen their result in three directions by using a different approach (based on the theory of $S$-unit equations).
