Competition problem — Number theory

Library / /58 of 860

Number theory Difficulty 4.7 AIME Find the answer

Determine the largest integer $n$ such that $7^{2048}-1$ is divisible by $2^{n}$ .

Your answer

A number or a short expression. Spacing and $ signs are ignored.

Solution

We have $7^{2048}-1=(7-1)(7+1)\left(7^{2}+1\right)\left(7^{4}+1\right) \cdots\left(7^{1024}+1\right)$ In the expansion, the eleven terms other than $7+1$ are divisible by 2 exactly once, as can be checked easily with modulo 4.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.