12h
comment The game with countable amount of steps
if the angel makes the first move, he will loose even for k=1 because the devil will never remove the number from his box that the angel put in his box in the first move.
21h
comment Convergence and Crash of a derivation (Chomsky)
and which work of Chomsky are you citing?
21h
comment How prove $\sqrt{2}+\frac{1}{\sqrt{5}+\sqrt[3]{5}}$ is irrational?
please add more context.
21h
comment Examples of magmas with all their elements idempotents
what did you try?
1d
comment Filters and Convergence
your definition in the comment is blunder, can you correct it. You should add the correct definition to the post
Dec
24
comment Find the inverse function 3
The logarithm to base $\sqrt{4-x^2}$ notation can be avoided but I would be surprised if there is an inverse that can be composed of elementary functions $$\begin{array}\\ f(x) &=& \log_{\sqrt{4-x^2} } \left(x^3+5x^2-x \right)\\ &=&\frac{\log(x^3+5x^2-x)}{\log{ \sqrt{4-x^2}}} \\ &=& 2\frac{\log(x)+\log(x-\frac{-5-\sqrt{29}}{2})+\log(x-\frac{-5+\sqrt{29}}{2})}{ \log(2-x)+\log(2+x)} \end{array}$$
Dec
23
comment Find the inverse function 3
What did you try and what is function 3?
Dec
23
comment systems of 2 equations in 2 variables
This is not a system of linear equation!
Dec
22
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
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
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
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
10
comment Dynamic programming:Making a Change
no, this is not a dynamic programming approach.
Dec
9
comment Dynamic programming:Making a Change
so which coin values do you have and how many of them? Why don't you check five one-dollar and one five-dollar coins?
Dec
9
comment Dynamic programming:Making a Change
I can't catch your idea. Can you explain more? Maybe there will be a more instructive example. You did not mention which types of coin denomination you have. why don't you check five one-dollar and oen five-dollar notes?
Dec
9
comment Binary operation commutative, associative, and distributive over multiplication
what have you tried?
Nov
30
comment What is the value of $a+b+c$?
You should post a new question if you have another question.
Nov
30
comment What is the value of $a+b+c$?
Can you show this "some algebra" and calculate the solution?