4h
comment Knapsack problem NP-complete
Instead of "Let $A=\{a_1, a_2, \dots , a_m\}$ and $A_1, A_2, \dots , A_{\lambda}$ be the set and the subsets of an instance of the Exact Cover problem." I would prefer "Let $A_1, A_2, \dots , A_{\lambda}$ a cover of the set $A=\{a_1, a_2, \dots , a_m\}$. We want to decide if it contains an exact cover." But I am not a native speaker. But the rest is ok as far as I can see
6h
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.
6h
comment Knapsack problem NP-complete
The exponent is $(r-1)$ $$i_j=\sum_{r=1}^{\lambda}e_{jr}(\lambda+1)^{r-1}$$
11h
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
11h
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
11h
awarded  Cleanup
11h
revised Prove if n<m there is at least one [(n/m)]?
rolled back to a previous revision
11h
revised Prove if n<m there is at least one [(n/m)]?
rolled back to a previous revision
12h
revised Knapsack problem NP-complete
typo
14h
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
14h
revised Knapsack problem NP-complete
added 48 characters in body
21h
revised Knapsack problem NP-complete
rearranged two expressions
1d
answered Knapsack problem NP-complete
1d
revised Knapsack problem NP-complete
typo
2d
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/…