AlgebraDifficulty 5.5AIME, harderFind the answerItaly
Problem:
For every positive integer n we call f(n) the product of all odd natural numbers less than or equal to 2n+1 (for example f(4)=1⋅3⋅5⋅7⋅9). We then set g(n)=f(n)n. What can be said about the sum S=g(1)+g(2)+⋯+g(30)?
Pick one
Solution
Solution:
The answer is (C). Let S(m)=g(1)+g(2)+⋯+g(m). Notice that g(m)=1⋅3⋯(2m+1)m=211⋅3⋯(2m+1)2m=211⋅3⋯(2m+1)2m+1−1=21(1⋅3⋯(2m−1)1−1⋅3⋯(2m+1)1) Calling h(m)=211⋅3⋯(2m+1)1 we have just obtained that g(m)=h(m−1)−h(m). Hence S(m)=g(1)+g(2)+g(3)+⋯+g(m−1)+g(m)=h(0)−h(1)+h(1)−h(2)+h(2)−h(3)+⋯+h(m−2)−h(m−1)+h(m−1)−h(m), that is S(m)=h(0)−h(m).
In the particular case, S(30)=21(1−1⋅3⋯(2⋅30+1)1). Going back to the general case, S(30)=S<21 since 1⋅3⋯(2⋅30+1)1>0; moreover 211⋅3⋯(2⋅30+1)1<2⋅611< 0.01 and hence S>0.49.
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 translated into English from it; metadata (topic, difficulty) added by this project.