3h
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
3h
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
3h
awarded  Cleanup
3h
revised Prove if n<m there is at least one [(n/m)]?
rolled back to a previous revision
3h
revised Prove if n<m there is at least one [(n/m)]?
rolled back to a previous revision
4h
revised Knapsack problem NP-complete
typo
6h
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
6h
revised Knapsack problem NP-complete
added 48 characters in body
13h
revised Knapsack problem NP-complete
rearranged two expressions
17h
answered Knapsack problem NP-complete
1d
revised Knapsack problem NP-complete
typo
1d
awarded  Constituent
2d
revised How are the elementary arithmetics defined?
Leopold Kronecker, not Ludwig :-)
2d
reviewed Approve Proving that this function is negligible
2d
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.
Dec
18
revised Prove $a^ab^bc^c\ge (abc)^{\frac{a+b+c}3}$ for positive numbers.
typo correction, latex improvement
Dec
10
answered Ways to write “50”