MathOverview
Reputation
5,817
67/100 score
 Jan 29 comment Single reference to classical results in analysis. @David, now believe that there are no problems in the theorem. Thanks for the comment. Jan 29 comment Single reference to classical results in analysis. @David, I repaired the question. Jan 27 comment Single reference to classical results in analysis. @JohnSteinbeck $D\subset \mathbb{Y}$. Jan 27 comment Single reference to classical results in analysis. @sinbadh, books or articles. Jan 22 comment Limit problem arctg (1 ^ infinty) Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level. Jan 7 comment Prove that $\frac{a}{\sqrt{a^2+1}}+\frac{b}{\sqrt{b^2+1}}+\frac{c}{\sqrt{c^2+1}} \leq \frac{3}{2}$ What is the meaning of the symbol $\sum_{cyc}$? Nov 2 comment Extended version of Mean-Value Theorem, lower bound result and reference request. @DanielFischer This is a counter example ? If $f (x, y) = e^x (\cos y, \sin y)$ then there not exists $m> 0$ and $M> 0$ such that $m<\|Df(x)\|_{\mathscr{L}(\mathbb{R}^2,\mathbb{R}^2)} 0$, does that imply the limit as $x\rightarrow \infty$ is $\infty$? This does not provide an answer to the question. To critique or request clarification from an author, leave a comment below their post. Oct 3 comment Improving Newton Iteration This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level. Oct 3 comment Prove that $\lim \limits_{n \to \infty}{\sqrt[n]{a^n+b^n}}=\max(a,b)$ if $(a_n,b_n)\to(a,b)$ Possible duplicate of How to show $\lim_{n \to \infty} \sqrt[n]{a^n+b^n}=\max \{a,b\}$? Sep 5 comment How strong is the operator norm topology? Your comment this makes your question more precise and interesting. I suggest incorporating this enlightening comment to your question. Sep 5 comment How strong is the operator norm topology? What do you mean exactly by "how strong is the topology T"? Jul 7 comment Can there be generalization of Monty Hall Problem? Jun 8 comment Solving for n in the equation $\left ( \frac{1}{2} \right )^{n}+\left ( \frac{1}{4} \right )^{n}+\left ( \frac{3}{4} \right )^{n}=1$ @RoryDaulton I do not want to be rude. But if it is not proved the convergence of the sequence $x_{n+1}=x_n-\frac{f(x_n)}{f'(x_n)}$ to $f(x)=0.25^x+0.5^x+0.75^x-1$ and $x_0 = 1.5$ converge then your answer is not correct. Jun 8 comment Solving for n in the equation $\left ( \frac{1}{2} \right )^{n}+\left ( \frac{1}{4} \right )^{n}+\left ( \frac{3}{4} \right )^{n}=1$ @RoryDaulton Another point which I understand is that you are assuming tacitly that if the method of bisection converges then Newton-Raphson method converge. You really mean it? Jun 8 comment Solving for n in the equation $\left ( \frac{1}{2} \right )^{n}+\left ( \frac{1}{4} \right )^{n}+\left ( \frac{3}{4} \right )^{n}=1$ @RoryDaulton I think that to ensure convergence should use some type of Kantorovich's theorem for Newton methold to ensure the convergence of the sequence obtained by Newton's menthold. Jun 8 comment Solving for n in the equation $\left ( \frac{1}{2} \right )^{n}+\left ( \frac{1}{4} \right )^{n}+\left ( \frac{3}{4} \right )^{n}=1$ @Rory Daulton It is necessary to prove that the sequence which is obtained from the Newton-Raphson method converges when $x_0 = 1.5$. May 25 comment Dvoretzky–Kiefer–Wolfowitz inequality holds for discrete distributions? What is your attempt to deal with the problem? You searched examples or counterexamples? May 2 comment Number of circuits that surround the square. see also another related question here. May 2 comment The problem of the most visited point. see also another related question here.