Math olympiad products question

Click For Summary
The discussion revolves around solving a Math Olympiad problem that requires finding the smallest integer n such that the product 5(32 + 22)(34 + 24)(38 + 28)...(32n + 22n) exceeds 9256. Participants explore various approaches, including the use of the AM-GM inequality and logarithmic properties to establish bounds for n. A key point of contention is whether the correct answer is 8 or 9, with calculations suggesting that n must be at least 9 to satisfy the inequality. The conversation emphasizes the importance of accurately accounting for all terms in the product and understanding how to derive a closed form for the expression. Ultimately, the consensus leans towards n being 9, as lower bounds established by the methods discussed indicate that 8 would not suffice.
  • #31
haruspex said:
That n is not the same as the n in the problem.
oh you careless me but i am still getting a different result this is my working

##
3^{2^{n+1}} ( 1- (\frac{2}{3})^{2^{n+1} -1 }) \\
3^{2^{n+1}} - 3( 2^{2^{n+1} -1 })

##
now what am i doing wrong
 
Physics news on Phys.org
  • #32
vishnu 73 said:
now what am i doing wrong
You are not applying the upper bound correctly in the sum. If the sum is up to the term rk then the numerator should have 1-rk+1. You omitted the +1.
 
  • #33
oh wait the index starts at i=0 not 1 so it must be 22n+1 correct ?

then it is equal to
##
3^{2^{n+1}} - 2^{2^{n+1}}
##
 
  • #34
vishnu 73 said:
oh wait the index starts at i=0 not 1 so it must be 22n+1 correct ?

then it is equal to
##
3^{2^{n+1}} - 2^{2^{n+1}}
##
Yes.
 
  • Like
Likes timetraveller123

Similar threads

Replies
16
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 93 ·
4
Replies
93
Views
15K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
2
Views
441
  • · Replies 67 ·
3
Replies
67
Views
15K
  • · Replies 97 ·
4
Replies
97
Views
22K
Replies
9
Views
3K
  • · Replies 39 ·
2
Replies
39
Views
13K
  • · Replies 19 ·
Replies
19
Views
2K