Olympiad Maths Prep

Library / /1 of 4

Number theory Difficulty 5.7 AIME, harder Prove it Bulgaria

The positive integers a>b>1a > b > 1 are such that the equation
ax1a1=by1b1 \frac{a^x - 1}{a - 1} = \frac{b^y - 1}{b - 1}
has at least two distinct solutions in positive integers x>1x > 1 and y>1y > 1. Prove that aa and bb are co-prime.

Solution

Assume that aa and bb are not co-prime and let the prime pp be their common divisor. We denote by vp(n)v_p(n) the exact degree of pp which divides nn. Note that (n,n1n1)=1(n, \frac{n^\ell-1}{n-1}) = 1 for every positive integer n>1n > 1 and pp does not divide n1n-1 if it divides nn.

Let (x1,y1)(x_1, y_1) and (x2,y2)(x_2, y_2) be two distinct solutions of the given equation and x1>x2x_1 > x_2. Then bax1aby1+ab=ax1by1b a^{x_1} - a b^{y_1} + a - b = a^{x_1} - b^{y_1} which easily implies that vp(a)=vp(b)v_p(a) = v_p(b). Subtracting the equalities ax11a1=by11b1\frac{a^{x_1}-1}{a-1} = \frac{b^{y_1}-1}{b-1} and ax21a1=by21b1\frac{a^{x_2}-1}{a-1} = \frac{b^{y_2}-1}{b-1} we obtain ax2ax1x21a1=by2by1y21b1a^{x_2} \frac{a^{x_1-x_2}-1}{a-1} = b^{y_2} \frac{b^{y_1-y_2}-1}{b-1}, whence x2vp(a)=y2vp(b)x_2 v_p(a) = y_2 v_p(b) and therefore x2=y2x_2 = y_2. Now ax21a1=bx21b1\frac{a^{x_2}-1}{a-1} = \frac{b^{x_2}-1}{b-1} obviously implies that a=ba = b, which is a contradiction.

Looking for a route rather than 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 and solution reproduced as published; topic and difficulty added by this site.