MathDB
2020 BMT Discrete #6

Source:

March 10, 2024
combinatorics

Problem Statement

Let NN be the number of non-empty subsets TT of S={1,2,3,4,...,2020}S = \{1,2, 3,4,...,2020\} satisfying max(T)>1000max (T) >1000. Compute the largest integer kk such that 3k3^k divides NN.