olymmath

ISL 2008 C2

For every positive integer nn determine the number of permutations (a1,a2,…,an)\left(a_{1}, a_{2}, \ldots, a_{n}\right) of the set {1,2,…,n}\{1,2, \ldots, n\} with the following property: 2(a1+a2+⋯+ak) is divisible by k for k=1,2,…,n. 2\left(a_{1}+a_{2}+\cdots+a_{k}\right) \text { is divisible by } k \text { for } k=1,2, \ldots, n \text {. }

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

Official text: IMO 2008 Shortlist booklet, page 24.

Show the answer

F_{n}=3 \cdot 2^{n-2}

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/2008/c2 · Tag QKWSV5WXNF · Edit this page on GitHub · Keys: j next, k previous