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

Dec
27
answered Examples of magmas with all their elements idempotents
Dec
27
reviewed Approve What parts of a pure mathematics undergraduate curriculum have been discovered since 1964?
Dec
27
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 of $\log_{\sqrt{4-x^2} } \left(x^3+5x^2-x \right)$
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 of $\log_{\sqrt{4-x^2} } \left(x^3+5x^2-x \right)$
What did you try and what is function 3?
Dec
23
reviewed Approve Why is the naive recursive approach to defining Lebesgue measure not satisfactory?
Dec
23
reviewed Approve Prove the following integral inequality
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
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