Skip to main content

2025/26 AHSMC Part 1 Problem 15

Problem 15 of 16

Let SS be a set of five different positive integers. The set has a special property: for any non-empty subset of SS, the average of its elements is an integer. What is the smallest possible value for the largest integer in SS?

Answer choices

Show solution

Solution

Let S={s1<s2<s3<s4<s5}S = \{s_1 < s_2 < s_3 < s_4 < s_5\}. For 2≤j≤52 \le j \le 5, comparing 33-element subset averages shows sj−s1s_j - s_1 is divisible by 33, and comparing 44-element subset averages shows sj−s1s_j - s_1 is divisible by 44. Hence 12∣(sj−s1)12 \mid (s_j - s_1) for each j≥2j \ge 2, so s5≥1+12⋅4=49s_5 \ge 1+12\cdot 4 = 49. The set {1,13,25,37,49}\{1,13,25,37,49\} has all subset averages integers (any kk-element sum with 2≤k≤42\le k\le 4 is kk plus a multiple of 1212; the full average is 2525). Thus the minimal possible largest element is 4949. The answer is (D).