Maths Olympiad Prep

Library / /10 of 12

, 2022

Combinatorics Difficulty 6.6 National Olympiad Prove it United States

Find the number of ordered pairs of integers (a,b)(a, b) such that the sequence
3,4,5,a,b,30,40,503, 4, 5, a, b, 30, 40, 50
is strictly increasing and no set of four (not necessarily consecutive) terms forms an arithmetic progression.

Solution

Neither aa nor bb can be 66 or 2020 because either of those numbers would make an arithmetic progression with either the least three numbers or the greatest three numbers. Therefore aa and bb must be chosen from the remaining 2222 values between 77 and 2929 not including 2020. Setting (a,b)=(7,9)(a, b) = (7, 9) results in the only arithmetic progression that contains two of the three least values. Because 2020 is already excluded, no arithmetic progression can be formed using exactly two of the three greatest numbers. All other possible arithmetic progressions must start with one of 33, 44, or 55 and end with one of 3030, 4040, or 5050. The difference of the starting and ending terms must be divisible by 33, which yields three potential pairs for starting and ending numbers of the arithmetic progression of length four. Using 33 and 3030, only (a,b)=(12,21)(a, b) = (12, 21) gives an arithmetic progression. Using 44 and 4040, only (a,b)=(16,28)(a, b) = (16, 28) gives an arithmetic progression. The arithmetic sequence starting with 55 and ending with 5050 would contain 2020 and has already been excluded. Therefore the requested number of ordered pairs is (222)3=228\binom{22}{2} - 3 = 228.

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.