Antonio Vargas

 Mathematics

Associated with Math.SE; for both general discussion & math qu...
Mar 25, 2019 19:45
oh neat
Mar 25, 2019 19:45
it's a tough decision to make
Mar 25, 2019 19:44
@Semiclassical come join me in oregon, we'll do consulting :D
Mar 25, 2019 17:52
tbh I wish I had learned more stats earlier. Bayesian stuff is actually awesome.
Mar 25, 2019 17:52
@Semiclassical permanent. I'm trying to do stats now, outside of academia.
Mar 25, 2019 17:41
yeah I "died" as Erdos would say
Mar 25, 2019 17:41
:)
Mar 25, 2019 17:41
hey semiclassical
Apr 13, 2018 21:17
^
Apr 2, 2018 20:23
nasa is streaming a launch on twitch
Mar 30, 2018 23:46
@Semiclassical greetings from the netherside
Mar 30, 2018 19:57
Is it just me, or are these kinds of questions almost as bad as "guess the next number" questions?
Dec 12, 2017 18:05
hey
Dec 11, 2017 07:26
@Daminark I'd avoid humor that might anger future readers trying to fill in the details
Dec 11, 2017 06:10
@Semiclassical Yo dude
Dec 11, 2017 05:54
I've definitely seen it a few times @Daminark
Dec 11, 2017 05:21
We thus expect that we can approximate the sum by approximating the slowly-varying factors of the summand near this peak at $k \approx x$: $$f(x) = \sum_{k=0}^{\infty} \frac{x^k}{k!} L(k) \approx \sum_{k=0}^{\infty} \frac{x^k}{k!} L(x) = L(x) e^x.$$ In particular, this heuristic holds when $L(x) = \log x$ and $L(x) = 1/\sqrt{x}$, as in here and here.
Dec 11, 2017 05:21
If there is a peak term, it would occur approximately when $$\frac{x^k}{k!} L(k) \approx \frac{x^{k+1}}{(k+1)!} L(k+1),$$ which is the same as $$\frac{L(k)}{L(k+1)} \approx \frac{x}{k+1}.$$ But if $k$ is large (this will be true for large $x$), then $L(k)/L(k+1) \approx 1$, so we have $$k \approx x - 1 \approx x.$$
Dec 11, 2017 05:21
@GabrielRomon Suppose we have a power series $$f(x) = \sum_{k=0}^{\infty} \frac{x^k}{k!} L(k),$$ where $L$ is a function satisfying $$\lim_{x \to \infty} \frac{L(x)}{L(x+1)} = 1.$$ If we want to determine the behavior of $f(x)$ as $x \to \infty$, one way to proceed would be to determine which terms of the series contribute most to its size.
Dec 6, 2017 21:52
Superpower
Nov 21, 2017 20:15
Savage!
Nov 21, 2017 20:15
But I like you.
Nov 21, 2017 20:14
You are ignored, Kasmir
Nov 21, 2017 20:13
@GFauxPas Yes, I think something went wrong somewhere.
Nov 21, 2017 20:12
@KasmirKhaan, not only are we handsome, we are literate too
Nov 21, 2017 20:11
@GFauxPas The problem itself. I don't see how $f(z^*) = f(z)^*$ is relevant to the problem at all, since it's not true in general for the functions the problem asks about.
Nov 21, 2017 19:41
@GFauxPas Try to see what happens in a simple case, like $f(z) = c_0 + c_1 z$.
Nov 21, 2017 19:28
@GFauxPas $f(z^*) = f(z)^*$, assuming $*$ means conjugate.
Nov 21, 2017 19:27
@GFauxPas If $f$ is defined by a power series, then it's true iff all the series coefficients are real.
Nov 21, 2017 19:05
@GabrielRomon The asymptotics chapter in Graham, Knuth, and Patashnik's Concrete Mathematics is a pretty good intro too, but covers less. You could also take a look at Green and Knuth's Mathematics for the Analysis of Algorithms.
Nov 21, 2017 19:00
I think de Bruijn's would be better as an introduction though.
Nov 21, 2017 18:59
@GabrielRomon Miller's Applied Asymptotic Analysis is pretty great. It contains lots of applications to differential equations.
Nov 21, 2017 18:30
I'm not sure what an image of a topological space would look like, but perhaps TikZ could do it? @gian
 

 Ten fold

CrossValidated's general room for gossip, grumbles, and idle c...
Mar 25, 2019 17:45
hello. quiet in here.
 
Oct 22, 2018 01:00
good luck!
Oct 22, 2018 00:59
I ask questions to help students
Oct 22, 2018 00:59
hope I wasn't too rude
Oct 22, 2018 00:59
sure thing!
Oct 22, 2018 00:58
pointwise, right
Oct 22, 2018 00:56
(less than 1 in absolute value)
Oct 22, 2018 00:56
Yes, since the other factor is |...| <= 1
Oct 22, 2018 00:53
Glad to help.${}$
Oct 22, 2018 00:53
Correct. But you have been given two different approaches where you can eventually use the DCT. The first was in my second comment, and the second was in Umberto's answer.
Oct 22, 2018 00:53
First, $g$ must not have an $n$ in it. Second, the point I'm trying to make is that there is no such $g$. It seems like it would be a good exercise for you to convince yourself of this. You can't prove that $\int f_n \to 0$ in this case because it's not true!
Oct 22, 2018 00:53
Indeed, you have not said what your $g$ would be! That's the dominating function.
Oct 22, 2018 00:53
Pointwise, sure. But what's the key part of the dominated convergence theorem? What's your domination function? The dominated convergence theorem is not just "$f_n \to 0$ pointwise implies $\int f_n \to 0$". There's a reason it has "dominated" in the name.
Oct 22, 2018 00:53
A hint: Substitute $y = nx$.
Oct 22, 2018 00:53
First, your justification for integrability is right, but it's pretty superficial. Do you know how to fill in the details? So what if $ne^{-nx} \frac{x^2+1}{x^2+x+1} \sim ne^{-nx}$? If $f(x) \sim g(x)$ and $g$ is integrable, what lets you conclude that $f$ is integrable? Second, just saying "apply the dominated convergence theorem" isn't enough. You actually have to apply it. If you did, you would find that the limit you guessed is incorrect.
 

 CURED

For feedback/discussion/requests of Close/Undelete/Reopen/Edit...
Apr 13, 2018 21:09
this question is misguided for the reasons I outlined in the comments.
Mar 30, 2018 19:59
I posted this in the main chat but maybe it should have gone here instead: Is it just me, or are these kinds of questions almost as bad as "guess the next number" questions?