Maths Olympiad Prep

Library / Saudi Arabian Mathematical Competitions /148 of 395

Saudi Arabian Mathematical Competitions

Number theory Difficulty 5.4 AIME, harder Prove it Saudi Arabia

Find all pairs of positive integers (m,n)(m, n) such that
125⋅2n−3m=271. 125 \cdot 2^{n} - 3^{m} = 271.

Solution

Considering the equation  mod  5\bmod\ 5 we get
3m≡−1(mod5), 3^{m} \equiv -1 \pmod{5},
so m=4k+2m = 4k + 2 for some positive integer kk. Then, considering the equation  mod  7\bmod\ 7 we get
−2n−92k+1≡5(mod7), -2^{n} - 9^{2k+1} \equiv 5 \pmod{7},
which means
2n+22k+1≡2(mod7). 2^{n} + 2^{2k+1} \equiv 2 \pmod{7}.
Since 2s≡1,2,4(mod7)2^{s} \equiv 1, 2, 4 \pmod{7} so the only possibility is 2n≡22k+1≡1(mod7)2^{n} \equiv 2^{2k+1} \equiv 1 \pmod{7} so 3∣n3 \mid n and 3∣2k+13 \mid 2k+1. From the last one we get 3∣m3 \mid m so we can write n=3xn = 3x and m=3ym = 3y. Therefore, the given equation takes the form 53⋅23x−33y=2715^{3} \cdot 2^{3x} - 3^{3y} = 271, or
(5⋅2x−3y)(25⋅22x+5⋅2x⋅3y+32y)=271. \left(5 \cdot 2^{x} - 3^{y}\right)\left(25 \cdot 2^{2x} + 5 \cdot 2^{x} \cdot 3^{y} + 3^{2y}\right) = 271.
It follows that 25⋅22x+5⋅2x⋅3y+32y≤27125 \cdot 2^{2x} + 5 \cdot 2^{x} \cdot 3^{y} + 3^{2y} \leq 271 and so x<2x < 2. We conclude x=1x = 1 and then y=2y = 2. So m=6m = 6 and n=3n = 3.
□\square

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.