Christian Ivicevic
Reputation
Top tag
Next privilege 1,000 Rep.
Create tags
 May20 comment Pumping lemma for regular “pumped formal language” @DavidLewis: Should I repost this question or can i move it there? May20 comment Pumping lemma for regular “pumped formal language” @Gigili: I am not allowed to ask homework-related questions there. The FAQ doesn't allow it! May20 asked Pumping lemma for regular “pumped formal language” May19 comment Transformation of first moment @DilipSarwate: Thats a really good hint (almost a full solution!). Shame on me why I haven't understood it before. This should result in $\mathbb{E}[A]=0.3$, shouldn't it? May19 asked Transformation of first moment Apr29 accepted Explicit Big-$\mathcal{O}$ proof with predicate logic Apr28 asked Explicit Big-$\mathcal{O}$ proof with predicate logic Apr20 asked Identity of binomial coefficients with a series Dec4 comment Computation of coefficients of Lagrange polynomials Our homework is divided into the Lagrage part and then the Aitken-Neville and then Newton part. Therefore we need to try all methods ;-) But i will have a look at the paper you provided! Dec4 comment Computation of coefficients of Lagrange polynomials I have implemented a Polynomial class which has the eval method based on the Horner scheme. Do you think, that i should use this? My first thought was to check whether i can get the coefficients with a more efficient algorithm rather then evaluating something... furthermore, while writing this, i need to remember the exact task. We must create the polynomial without a specific $x$. That is the reason why we have a Polynomial class. This is where my intention comes from to directly compute the coeffs. Dec4 comment Computation of coefficients of Lagrange polynomials I could do that, but want to avoid that. We should implement this in Java for our Numerics lecture and we learned that it is a pain to derive as there many small errors can extremely influence the result! So i wanted a "small" expression that can be easily evaluted. Dec4 asked Computation of coefficients of Lagrange polynomials Nov29 accepted Is $n=\mathcal{O}(n+1)$? Nov29 comment Is $n=\mathcal{O}(n+1)$? This notation is weird I know, so i will change this one. In a few minutes I will accept your answer, when the system allows me to do so. Nov29 asked Is $n=\mathcal{O}(n+1)$? Nov1 comment Limit proof of a sqrt-heavy expression with binomial formula / sandwich-rule @CaptainGiraffe: By obvious I mean that if you think aboout it, there is something about this idea. Furthermore I checked the limit with Mathematica and know that $\sqrt{2}$ is the solution. Nov1 comment Limit proof of a sqrt-heavy expression with binomial formula / sandwich-rule +1 for the explanation of the method my fellow students used! However, as you already mentioned, I sticked to the conjugate quantity method which was much easier ;) Nov1 accepted Limit proof of a sqrt-heavy expression with binomial formula / sandwich-rule Nov1 comment Limit proof of a sqrt-heavy expression with binomial formula / sandwich-rule Although I never heard of either these methods, the first one seems the most convenient and human-readable one which solves my problem here! After reading the Wikipedia article this will be the solution I will use. Thanks! Nov1 revised Limit proof of a sqrt-heavy expression with binomial formula / sandwich-rule inserted new try of proof