AlgebraDifficulty 5.6AIME, harderFind the answerUnited States
Problem:
The Fibonacci numbers are defined recursively by F0=0, F1=1, and Fi=Fi−1+Fi−2 for i≥2. Given 30 wooden blocks of weights 3F2,3F3,…,3F31, estimate the number of ways to paint each block either red or blue such that the total weight of the red blocks and the total weight of the blue blocks differ by at most 1.
Submit a positive integer E. If the correct answer is A, you will receive ⌊25min((E/A)8,(A/E)8)⌋ points. (If you do not submit a positive integer, you will receive zero points for this question.)
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
Solution:
To get within an order of magnitude, one approach is to let Xn be a random variable which takes the value ±3Fn, with the sign chosen uniformly at random. We want the probability that S=∑i=231Xi is in [−1,1]. We can attempt to approximate the distribution of S as normal (this is loosely justified because it is the sum of many independent random variables). Using the approximation Fn≈51φn for φ=21+5, the variance of S is: Var(S)=i=2∑31Var(Xi)=i=2∑31Fi2/3≈i=2∑315−1/3φ2i/3≈5−1/3⋅(1−φ−2/3φ62/3) Now, we use the fact that if Var(S)1S is standard normal, then the probability that S∈[−1,1] is approximately 2π1⋅Var(S)2≈π2⋅51/3⋅φ31/31−φ−2/3 When we multiply this by 230, we get an approximation of E≈4064598, which achieves A/E≈0.96 and would score 17 out of 25 points.
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.