- #1
mhill
- 189
- 1
we must obtain 'N' and a(i) i=1,2,3,....,N on condition that
the product [tex] a(1)a(2)a(3)...a(N) [/tex] is the highest possible
[tex] a(1)+a(2)+a(3)+...+a(N)=73 [/tex]
every a(i) is positive
here N (this is the hardest part) is not known and must be calculated
the product [tex] a(1)a(2)a(3)...a(N) [/tex] is the highest possible
[tex] a(1)+a(2)+a(3)+...+a(N)=73 [/tex]
every a(i) is positive
here N (this is the hardest part) is not known and must be calculated