Question

Let a₁, a₂, ..., a₁₀₁ be a permutation of 2, 3, 4, ..., 102. Find all permutations such that a_i is divisible by i for all i.

Difficulty level (1 very easy - 10 very hard): 8

Number Theory -> Modular Arithmetic / Remainder Arithmetic -> Divisibility Rules Combinatorics -> Case Analysis / Checking Cases -> Processes / Procedures

Sources:

Tournament of Towns, 1979-1980, Main, Spring Question 3

There are no comments yet.

Authentication required

You must log in to post a comment.