Maths Olympiad Prep

Library / /2 of 9

, 2013

Number theory Difficulty 5.1 AIME, harder Prove it Slovenia

At most how many prime numbers can be contained in a non-constant geometric sequence of positive real numbers?

Solution

The answer is 22. As an example of such a sequence we can take an=2(32)n1a_n = 2\left(\frac{3}{2}\right)^{n-1}, which contains two primes, 22 and 33.

Assume that a geometric sequence an=aqn1a_n = a q^{n-1}, where q1q \neq 1, contains three primes. Assume also that these primes are aka_k, ama_m and ana_n, where k<m<nk < m < n. Since the sequence is not constant, the three primes are distinct. Since anam=qnm\frac{a_n}{a_m} = q^{n-m} and amak=qmk\frac{a_m}{a_k} = q^{m-k}, we have (anam)mk=(amak)nm\left(\frac{a_n}{a_m}\right)^{m-k} = \left(\frac{a_m}{a_k}\right)^{n-m}, or

anmkaknm=amnk. a_n^{m-k} a_k^{n-m} = a_m^{n-k}.

But mk,nm,nk>0m-k, n-m, n-k > 0 and ak,am,ana_k, a_m, a_n are distinct, so this is not possible.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.