Competition problem — Number theory

Library / /60 of 105

Number theory Difficulty 5.0 AIME Prove it United States

Problem:

As usual, let $n!$ denote the product of the integers from $1$ to $n$ inclusive. Determine the largest integer $m$ such that $m!$ divides $100! + 99! + 98!$ .

Solution

Solution:

The answer is $m = 98$ . Set
$N = 98! + 99! + 100! = 98! (1 + 99 + 99 \cdot 100)$
Hence $N$ is divisible by $98!$ . But
$\frac{N}{98!} = 1 + 99 \cdot 101$
is not divisible by $99$ . Hence $N$ is not divisible by $99!$ .

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.