Maths Olympiad Prep

Library / Hellenic Mathematical Olympiad /26 of 57

Hellenic Mathematical Olympiad

Number theory Difficulty 6.0 National Olympiad Prove it Greece

Prove that there exists integer n≥1n \ge 1, such that the number of the pairs (a,b)(a, b) of positive integers satisfying the equation
1a−b−1a+1b=1n \frac{1}{a-b} - \frac{1}{a} + \frac{1}{b} = \frac{1}{n}
is greater than 2024.

Solutions — 2

Solution 1

We seek solutions (a,b)(a, b) with a−b=kba - b = k b, that is a=(k+1)ba = (k+1) b for some integer k>0k > 0. Then the left part of the given equation is equal to
1kb−1(k+1)b+1b=1b(1k−1k+1+1)=1b⋅k(k+1)+1k(k+1) \frac{1}{k b} - \frac{1}{(k+1) b} + \frac{1}{b} = \frac{1}{b} \left( \frac{1}{k} - \frac{1}{k+1} + 1 \right) = \frac{1}{b} \cdot \frac{k(k+1)+1}{k(k+1)}
and so we have
b=(k(k+1)+1)nk(k+1)=n+nk(k+1). b = \frac{(k(k + 1) + 1)n}{k(k + 1)} = n + \frac{n}{k(k + 1)}.
Therefore, it is enough to select as nn a positive integer with more than 2024 positive integers of the form k(k+1)k(k + 1). In fact, for example, if (pn)(p_n) is the sequence of primes with p1=2,p2=3,…p_1=2, p_2=3, \dots, then the number
n=p1(p1+1)p2(p2+1)⋯p2025(p2025+1), n = p_1(p_1+1) p_2(p_2+1) \cdots p_{2025}(p_{2025}+1),
satisfies the problem.

Solution 2

The equation is written in the form
a2−ab+b2ab(a−b)=1n. \frac{a^2 - ab + b^2}{ab(a - b)} = \frac{1}{n}.
We put d=(a,b)d = (a, b), and so a=dx,b=dya = d x, b = d y and the equation becomes:
xy(x−y)x2−xy+y2=nd \frac{x y (x - y)}{x^2 - x y + y^2} = \frac{n}{d}
If (n,d)=S(n, d) = S, then n=Sun = S u and d=Svd = S v. Therefore it follows
xy(x−y)=u,x2−xy+y2=v. x y (x - y) = u, \quad x^2 - x y + y^2 = v.
By putting xy=sx y = s and x−y=tx - y = t, the two relations take the form st=us t = u and t2−3s=vt^2 - 3 s = v. Then x=syx = \frac{s}{y} and sy−y=t⇔y2+yt−s=0\frac{s}{y} - y = t \Leftrightarrow y^2 + y t - s = 0.
The discriminant of the last equation is Δ=t2+4s\Delta = t^2 + 4 s. In order to integer solution, it is enough to choose s=k(t+k)s = k (t + k) for some positive integer kk. Then the equation has the solution y=ky = k.
This gives x=k+tx = k + t, which in turn gives u=st=kt(k+t)u = s t = k t (k + t) and v=t2−3k(t+k)v = t^2 - 3 k (t + k).
We should have v>0v > 0 (one way to achieve this is, k=1k = 1 and t≥4t \ge 4).
The construction now has as follows: We select a positive integer nn with 2024 positive integers of the form kt(k+t)k t (k + t). For each one of them is determined a triad (x,y,v)(x, y, v). From this triad is determined a pair (a,b)(a, b) satisfying the equation.

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

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