Reputation
Next privilege 250 Rep.
View close votes
Badges
5
Newest
 Tumbleweed
Impact
~531 people reached

  • 0 posts edited
  • 0 helpful flags
  • 3 votes cast
May
4
awarded  Tumbleweed
May
4
asked Coppersmith-Winograd algorithm
May
2
asked Arithmetic circuit and complexity
Apr
27
asked Depths of top-level multiplication algorithms
Apr
17
asked How simplify this sum?
Sep
25
comment Curiosity - maximising a product with a constraint
Thanks for your help.
Sep
25
comment Curiosity - maximising a product with a constraint
Does your hint allow to show that " In general, you can show that a product of several numbers (with constant sum) get maximised when they can be made as close to each other as possible" ?
Sep
25
comment Curiosity - maximising a product with a constraint
Thanks. Why do you say that $i_3-1 \geq i_4$ ? The $i_j$s are in descending order but not strict, we can have $i_3=i_4$.
Sep
25
comment Curiosity - maximising a product with a constraint
Yes I understand when there si only one substraction, but what about the case where $c=3$ and we substract $1$ to $i_2$, substract $1$ to $i_3$ and substract $1$ to $i_4$. There are a lot of other possibilities.
Sep
25
comment Curiosity - maximising a product with a constraint
Thanks. As you say at the end, in fact we can have also the possibility to substract $1$ to $i_2$, $1$ to $i_3$, ..., $1$ to i_{c+1}. Such a possibility lets the sum unchanged. There are again a lot of other possibilities.
Sep
25
comment Curiosity - maximising a product with a constraint
Thank you for the hint.
Sep
25
comment Curiosity - maximising a product with a constraint
Exact. Thank you :-).
Sep
25
revised Curiosity - maximising a product with a constraint
edited body
Sep
25
comment Curiosity - maximising a product with a constraint
I've changed a little the post for better understanding.
Sep
25
revised Curiosity - maximising a product with a constraint
added 104 characters in body
Sep
25
comment Curiosity - maximising a product with a constraint
@Paul If we want to add $2$ to $i_1$, we have to substract $2$ to $i_2$ so that the sum is unchanged and the product is maximised.
Sep
25
asked Curiosity - maximising a product with a constraint
May
2
comment Average number of distinct values
OK. Thanks again André
May
2
comment Average number of distinct values
I have a question André. You write "For $E(X_i)$, the probability that $X=i$". Is there a typing error ? $X$ is not defined.
May
2
comment Average number of distinct values
Thank you very much André.