olymmath

ISL 2019 N5

Let aa be a positive integer. We say that a positive integer bb is aa-good if (anb)−1\binom{a n}{b}-1 is divisible by an+1a n+1 for all positive integers nn with an⩾ba n \geqslant b. Suppose bb is a positive integer such that bb is aa-good, but b+2b+2 is not aa-good. Prove that b+1b+1 is prime. (Netherlands)

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2019 Shortlist booklet, page 11.

Show the answer

b+1 \text{ is prime}

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2019/n5 · Tag XQCQ2JGPBW · Edit this page on GitHub · Keys: j next, k previous