Hi,(adsbygoogle = window.adsbygoogle || []).push({});

I have sent the following question a couple of days ago. I want to ask my question in a more

general way; Could you please guide me if we have some ways to find the maximum value of a

summationwithout getting derivation and equals it to zero?

My problem:What is the maximum value of the given summation in terms of [itex]k, l

[/itex] and [itex]N[/itex] ?

[tex]max_{0\leq x \leq k} \sum_{(l_1,l_2)\in A} \frac{N!}{(N-l_1-l_2)!l_1!l_2!} x^{l_1}(k-

x)^{l_2}(1-k)^{N-l_1-l_2}[/tex]

where [itex]A=\{l_1,l_2 \in \{0,1,...,N\}|l_1+2l_2=l, l_1+l_2\leq N \}[/itex]. Also, [itex]l \in \{0,1,...,2N \}[/itex] and [itex]0<k<1[/itex].

Thanks a lot for your participation.

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Maximizing a summation without equals its derivation to zero

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads for Maximizing summation without |
---|

A Maximization problem using Euler Lagrange |

A Maximization Problem |

**Physics Forums | Science Articles, Homework Help, Discussion**