Reputation
3,287
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
12 30
Newest
 Nice Answer
Impact
~72k people reached

Dec
22
comment Knapsack problem NP-complete
the sentence "Let the set $A=\{a_1, a_2, \dots , a_m\}$ and the subsets $\{A_1, A_2, \dots , A_{\lambda} \}$ an instance of the Exact Cover problem." does not have a verb.
Dec
22
comment Knapsack problem NP-complete
The exponent is $(r-1)$ $$i_j=\sum_{r=1}^{\lambda}e_{jr}(\lambda+1)^{r-1}$$
Dec
22
revised Prove if n<m there is at least one [(n/m)]?
rolled back to initial version because the wording of the question qas changed
Dec
22
revised Prove if n<m there is at least one [(n/m)]?
rolled back to initial version because the wording of the question qas changed
Dec
22
awarded  Cleanup
Dec
22
revised Prove if n<m there is at least one [(n/m)]?
rolled back to a previous revision
Dec
22
revised Prove if n<m there is at least one [(n/m)]?
rolled back to a previous revision
Dec
22
revised Knapsack problem NP-complete
typo
Dec
21
comment Knapsack problem NP-complete
You should try to convert a cover of a set to a knapsack, e.g. en.wikipedia.org/wiki/Exact_cover#Detailed_example
Dec
21
revised Knapsack problem NP-complete
added 48 characters in body
Dec
21
revised Knapsack problem NP-complete
rearranged two expressions
Dec
21
answered Knapsack problem NP-complete
Dec
21
revised Knapsack problem NP-complete
typo
Dec
20
awarded  Constituent
Dec
19
revised How are the elementary arithmetics defined?
Leopold Kronecker, not Ludwig :-)
Dec
19
reviewed Approve Proving that this function is negligible
Dec
19
revised Proving that this function is negligible
edited tags
Dec
18
comment Prove that $a^ab^bc^c\ge (abc)^{(a+b+c)/{3}}$
That was not intended as a help for you. you mentioned that the question was already posed but did not supply a link.
Dec
18
comment Prove that $a^ab^bc^c\ge (abc)^{(a+b+c)/{3}}$
math.stackexchange.com/questions/109783/…
Dec
18
reviewed Edit Prove $a^ab^bc^c\ge (abc)^{\frac{a+b+c}3}$ for positive numbers.