Maths Olympiad Prep

Library / HMMT November /42 of 672

HMMT November, 2014

Number theory Difficulty 4.5 AIME Prove it United States

Problem:

Compute the greatest common divisor of 48−14^{8}-1 and 812−18^{12}-1.

Solution

Solution:

Answer: 15 Let d=gcd⁡(a,b)d=\operatorname{gcd}(a, b) for some a,b∈Z+a, b \in \mathbb{Z}^{+}.
Then, we can write d=ax−byd=a x-b y, where x,y∈Z+x, y \in \mathbb{Z}^{+}, and
2a−1∣2ax−12b−1∣2by−1 \begin{aligned} & 2^{a}-1 \mid 2^{a x}-1 \\ & 2^{b}-1 \mid 2^{b y}-1 \end{aligned}
Multiplying the right-hand side of (2) by 2d2^{d}, we get,
2b−1∣2ax−2d 2^{b}-1 \mid 2^{a x}-2^{d}
Thus, gcd⁡(2a−1,2b−1)=2d−1=2gcd⁡(a,b)−1\operatorname{gcd}\left(2^{a}-1,2^{b}-1\right)=2^{d}-1=2^{\operatorname{gcd}(a, b)}-1.
Using a=16a=16 and b=36b=36, we get
gcd⁡(216−1,236−1)=2gcd⁡(16,36)−1=24−1=15 \operatorname{gcd}\left(2^{16}-1,2^{36}-1\right)=2^{\operatorname{gcd}(16,36)}-1=2^{4}-1=15

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.