CombinatoricsDifficulty 4.9AIMEFind the answerUnited States
Problem: Let Q be the product of the sizes of all the non-empty subsets of {1,2,…,2012}, and let M=log2(log2(Q)). Give lower and upper bounds L and U for M. If 0<L≤M≤U, then your score will be min(23,⌊3(U−L)23⌋). Otherwise, your score will be 0.
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
Solution: Answer: 2015.318180... In this solution, all logarithms will be taken in base 2. It is clear that log(Q)=∑k=12012(k2012)log(k). By paring k with 2012−k, we get ∑k=120110.5∗log(k(2012−k))(k2012)+log(2012), which is between 0.5∗log(2012)∑k=02012(k2012) and log(2012)∑k=02012(k2012); i.e., the answer is between log(2012)22011 and log(2012)22012. Thus log(log(Q)) is between 2011+log(log(2012)) and 2012+log(log(2012)). Also 3<log(log(2012))<4. So we get 2014<M<2016.
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.