paper

On a system of equations with primes

arXiv:1212.0802

Abstract

Given an integer , let be pairwise coprime integers , a family of nonempty proper subsets of with "enough" elements, and a function . Does there exist at least one prime such that divides for some , but it does not divide ? We answer this question in the positive when the are prime powers and and are subjected to certain restrictions. We use the result to prove that, if and is a set of three or more primes that contains all prime divisors of any number of the form for which is a finite nonempty proper subset of , then contains all the primes.

13 pp, to appear in Journal de Théorie des Nombres de Bordeaux. Fixed a number of typos (particularly, in the proof of Theorem 1.3). Abridged the part on the lifting-the-exponent lemma. Slightly simplified the formulation of Question 1. Added a new question (viz., Question 4 in this version). "Generalized" Theorem 1.3 (a hypothesis in the old statement was "evidently" useless)