« first day (1509 days earlier)      last day (3503 days later) » 

12:22 AM
Noone answers my question, I don't know if they are badly asked, or if they are too specialised, does anyone have any ideas how I can increase my exposure?
I have 6/8 unanswered
I deleted two, so make it 4/6
 
@Analysis Make your question more apparent to the skimming reader
state directly what you want and then highlight it with a quote box (using >)
 
That is a good idea. I feel like that means I shouldn't ask multi questions then
 
i keep coming to the end of your question and not really knowing what you were asking. It might be apparent if I went back and read carefully but most people will not take the time unless they are interested.
@Analysis it sure does
 
@Alexander I assume you know the 'double' jump result in random graphs, right?
 
@Studentmath I don't.
 
12:30 AM
That in $G(n,p)$ when $p=(1+\epsilon)/n$ there's a unique component of linear size to n, and when $p=(1-\epsilon)/n$ all components are of logarithmic size?
 
@AlexanderGruber Is this better " math.stackexchange.com/questions/939555/… "
 
@Studentmath Oh, yeah. I have seen that.
@Analysis That's a good summary - now the best thing would be to go halfway between before that, and now, by adding your own question as an example
 
I've been wondering why everyone focus on that, whereas Erdos in his original paper didn't find it interesting enough to focus on, and, working in G(n,m), he searched for the specific probablity of the largest component having $n-k$ vertices in it. Just felt like sharing this, no real question here..
 
"What do I do when -L<x<0?" then below that "for example, if I wanted to compute f(x)=2x^2..."
 
Then everyone taking his paper focused on that instead of what he thought was way more interesting (and includes in a way that result, with a bit of work)
 
12:33 AM
that way people know right away what the point of the question is, and they also have a specific example to work with. Makes the answer easy to write (for those who know how to do it).
 
@AlexanderGruber That also makes sense. Would I put the example in '>'?
 
@Studentmath People probably just think it's weird. It's unusual to see that kind of thing.
Also maybe it is more accessible than the rest of Erdos's thoughts in that paper
@Analysis I'd leave it out of > for this one, places more emphasis on your summarizing question
 
Yes. I guess accesibility plays a great part in it, too.
I can't bring myself to sit down and truly understand his proofs there just yet, it feels a bit of a burden.
But probably because the paper I have is a copy of the 1959 paper, the letters themselves make my eyes burn
 
@Analysis for examples of how to write like this you may want to check out some of my questions, i use this sort of pattern in nearly all of them
(though, sometimes i ask questions without showing any effort and most people can't get away with that)
@Studentmath I really dislike most of Erdos's proofs.
that guy thinks much differently than I do, I find his process hard to understand
(not that they're not good proofs, I'm just a different type of thinker)
 
Precisely - I find his process hard to understand.
Yeah. I read a very nice proof of the double-jump result, it wasn't much simpler, it involved some rather long-to-prove lemmas and so on. But it fit my line of thinking, so I understood where they were heading the moment they wrote the theorem itself.
 
12:41 AM
yeah :) sometimes the challenge is more writing it out than understanding how it will be done
those are always good papers
 
Thank you for advice Alexander
 
@Analysis No problem, hope you get some answers. I'd help you out if I knew much analysis.
 
Indeed.. eitherway, glad I went with this subject. It's really interesting.
 
@AlexanderGruber!
@Studentmath...!
 
@Balarka !
 
12:51 AM
Ah good you're here =)
 
Soon hitting the bed (it's 4 am here) but yeah :P
 
It's 6:30 here =P =P
 
In the...?
Morning?
 
Yes. AM.
 
Really? Only 3 hours ahead?
I would expect more.
Are you in Western India?
 
12:52 AM
I do believe it's more than that
@Studentmath What's the date in there?
 
21/9
03:55
 
WAT
So we are 3 hours ahead...!
 
It makes sense if you are not in Eastern India
 
Erm.. I forgot what direction is East.
 
I think Ukraine is one hour ahead, so yeah. 3 would fit.
East is China
West is US
 
12:54 AM
I dunno china. Is it $\infty + i\infty$ or $-\infty - i\infty$?
 
If you have a normal map at home and you compare India to these places.
 
Or the conjugates?
 
That would be Australia.
 
So what is East? Be explicit.
I think I know where Iran is. If you take up the coordinate origin to where I am, then it's on $-\infty + i\infty$
 
Okay, look at a map of India. draw an imaginary line from the long bottom of it all the way up. If you live right to that place, you are in eastern India. Otherwise, by the logic that every statement is either true or false, you are in western.
 
12:57 AM
@Studentmath Erm. What is right again?
 
The hand without the watch.
 
I don't wear watch.
 
The hand you write with.
 
Is it $\Bbb R$ or $- \Bbb R$?
@Studentmath Ah good enough
 
@BalarkaSen north pole's up and south pole's down
 
12:58 AM
OK, OK, got that.
I am on the right then @Studentmath
 
thus eastern india is right because we use the right hand rule
 
"Eastern India"
 
I forgot why we started this.
 
LOL, @Studentmath
The 3 hours difference, I think
 
Yeah well,
Wait, it's 7:00 now, right?
 
1:00 AM
6:30. Close enough.
 
No no.
You can't live between 2 time-spaces.
What is this place.
 
Erm. Kolkata/Calcutta I think.
In West Bengal.
 
Well move it 30 minutes forward or 30 minutes backwards.
We are 3 hours and 30 minutes apart
 
But 6:30 - 4:00 is NOT 3:30.
 
2:30. I am tired.
 
1:03 AM
Peace out, @Studentmath
 
You are UTC+05:30. I never thought you could be something less than full hour away.
Yeah, good night all!
 
@Alexander Whoa. You changed that illuminati triangle.
 
@BalarkaSen I didn't.
It must have been the Illuminati.
 
Oh. Might be a trick of eye then.
 
I need to have better intuition than $$\sum_{n=1}^\infty \frac{\sin(\sqrt n)}{n^{3/2}}\approx1+J_2(\pi)$$
time for sleep
 
1:14 AM
Whoa @Alizter
What's the context?
 
@Alizter here
$$\sum_{n=1}^\infty \frac{\sin(\sqrt n)}{n^{3/2}}\approx1+\mathfrak{J}_2(\pi)$$
does that help?
 
ahahha
Hmm. $\mathfrak{J}$ looks much like $\Im$
plans for a notation abuse
Any problem to think about @AlexanderGruber? And when I mean problem, I mean ring theory/field theory/galois theory.
 
@BalarkaSen Let $\mathcal{J}\subset \Im \subset \mathfrak{J}$ be finite extensions, and consider elements $\mathit{j},\mathcal{j},\mathfrak{j}$...
 
$\mathfrak{j}$ looks familiar...
Hmm. Dagger!
 
1:36 AM
@Sush if the discriminant is nonnegative and the middle term in the quadratic polynomial (in y^2) is nonnegative, then for all x there exists a y for which (x,y) is on the curve. that can't be bounded.
 
@BalarkaSen i don't have a problem but i do have some sets.
Let $$\mathcal{C}_{n}=\{z\in \mathbb{C}:p(z)=0\text{ for some polynomial }p\text{ whose coefficients are }n^\text{th}\text{ roots of unity}\}$$
(so, for clarity: we'd have $\mathcal{C_n}=\bigcup_{m=1}^\infty C_{n,m}$, where $C_{n,m}=\{z\in \mathbb{C}:\exists n^\text{th}\text{ roots of unity }a_1,\ldots, a_m\text{ such that } a_0+a_1z+\cdots +a_nz^m=0\}$)
usually I'll be talking about $C_p$ for $p$ prime, and also it seems to help to view these as points in $\mathbb{R}^2$
so, here's my question to you. How can we Galois theory these?
certainly there is something to talk about.
for example, we could look at the splitting field.
i posted some pictures of $\mathcal{C}_{n,M}=\bigcup_{m=1}^MC_{p,m}$ on here before. They seem like interesting sets.
here's $\mathcal{C}_{3,8}$, for example. What can you tell me about $\mathcal{C}_3$?
(that's also a question you might be interested, @anon)
 
2:29 AM
@IanMateus: Just noticed your +100 bounty on Olivier's log-integral problem. Hope you have more response with it than my +50 bounty on the same...
 
HI
I have a little question, suppose G acts on X, a have checked an old exam and it define $X_G=\{x: gx=x for all x\} someone knows what is the name of that. X does not have structure of group necessary is that set well defined? what characteristica can have?
Well more specific. If we let $G$ a p- group and X a G set, show that $o(X) = o(X_G) mod p$ where X_G is defined as above.
o is order.
I'm a little confused about the set X_G, maybe is a typo
Someone?
 
2:47 AM
I wouldn't know sorry, and others are seemingly inactive
I might know, but my latex isn't rendering.
 
the definition of the set $X_G= \{x\in X: gx=x for all g \in G\}$
 
From what I can tell you are talking about group stabilisers
Or you are talking about orbits, I can
't tell since I can't read unrendered latex well
 
Not is not, is like a stabilizer but over the set, I don't know if is clear jaaaja but X doesn't necessary have structure of a group
I had never seen that set before maybe is a typo
The set is in word: the set of all x in the G set s.t., g of x is x for all g in the group acting on X
but the problem didn't mention that X has a group structure or something else.
 
What is $X$ here?
 
an element in the X which is a G set
 
2:52 AM
$X=X_G$
 
The entire problem is something more complicated but I'm a bit confused with the definition of X_G
 
@JoseAntonio What's the problem?
 
G acts on X and X_G is the set of all the elements in X s.t. are unchanged under the action of G. It´s like a stabilizer but the set lies in X which not necessarily is a group. That's confuse me
 
Also, that's usually denoted by $X^G$.
 
@robjohn Could you answer my new question, related to my question you commented on last night: math.stackexchange.com/questions/939555/…
 
2:55 AM
@JoseAntonio Why does that confuse you? $X^G$ is the set of fixed points of the action.
 
The entire problem says Suppose X is a G set and G is a p group shows that $o(X) = o(X_G) mod p$ where $X_G=\{x\in X: gx=x for all g\in G\}$
 
@JoseAntonio Yes.
Do you know that $X$ is partitioned into orbits under the action of $G$?
 
That is $X=\bigsqcup \mathcal O(x)$.
This means that $|X|=\sum |\mathcal O(x)|$.
 
my little o, is not the orbit is of order
 
2:58 AM
Now, when is it true that $\mathcal O(x)=\{x\}$; i.e. the only element in the orbit of $x$ is $x$ itself?
This has to do with $X^G$.
@JoseAntonio I know.
$\mathcal O(x)=\{x\}$ means $gx=x$ for every $g\in G$. That is, $\mathcal O(x)=\{x\}\iff x\in X^G$. So $|X|=|X^G|+\sum \mathcal O(x)$ where the sum runs through nonsingleton orbits.
So far so good?
 
$X^G$ is what I name $X_G$, right?
 
Yes.
So we can write $X$ has the sum of all fixed points (= size 1 orbits) and orbits of size >1.
 
$O(x)=\{x\}$ only when the group action doesn't change the element, hence it is a fixed point.
 
Now, you know that $|\mathcal O(x)|=|G:{\rm stab}\; x|$.
In particular, $|\mathcal O(x)|$ divides $|G|$. Yes, @JoseAntonio ?
In fact $|G|/|\mathcal O(x)|=|{\rm stab\;} x|$.
 
@robjohn What textbook would you recommend for learning Laplace and Fourier?
 
3:02 AM
Here we're assuming $X$ and $G$ are both finite.
@JoseAntonio
 
Ok I think I got it
 
Now suppose $G$ is a $p$-group. If $|\mathcal O(x)|$ has more than one element, and divides $|G|=p^k$, then $|\mathcal O(x)|$ must be a power of $p$.
This means $|\mathcal O(x)|=0\mod p$. Reducing the equation we got above, we obtain $|X|=|X^G|\mod p$ for $G$ a $p$-group.
Bye bye!
 
That's set has a particular name?
bye thanks for your help
@PedroTamaroff Thanks for your explanation.
 
Hello all.
 
Hello @Awerth
 
3:11 AM
Hello @Analysis.
@AlexanderGruber, are you around?
 
what text recommend for algebra? I love Artin's book, but doesn't have important topics as the semidirect product
 
What is your background?
 
@AWertheim Somewhat.
@JoseAntonio Dummit and Foote is the only way to live.
 
Dummit and Foote is very very good, but a bit dry.
It also defers almost all discussions of category theory until the end.
 
@AWertheim You're not supposed to be drinking it.
 
3:14 AM
@AlexanderGruber That explains my difficulties with it ;)
 
I thought they did some categories along with the commutative algebra in the middle
am i remembering that wrong?
 
I am actually going through Dummit and Foote rather extensively at the moment, funny enough. It is hard to beat in a lot of ways.
Mmm, I think the commutative algebra comes more at the end. Chapters 15-19, I think.
 
I really love Artin's book but it's a pity that his book doesn't have all the topics. I think I will use Dummit and Foot
 
@JoseAntonio what do you want to know about semidirect products?
 
By then, you've seen groups, rings, modules and fields with nary a discussion of categories or functors.
 
3:16 AM
@AWertheim that seems like a good way of doing things to me
 
@AlexanderGruber LOL. I don't disagree for a first pass. But there are some nice advantages to seeing things from a more general point of view as well, I think. I've enjoyed Aluffi's "Algebra: Chapter 0" immensely for that very reason.
 
Hi @Alex and @Jose
 
@AlexanderGruber Honestly seems like totally arbitrary definition and I'd like to read more about them
Hi @TedShifrin
 
Serge Lang's Algebra is well regarded among some. A very polarizing text, it seems. Many love it and swear by it, and others want nothing to do with it.
 
Hello Professor @TedShifrin
 
3:19 AM
@JoseAntonio oh it's great once you understand them you'll prefer them to everything
 
What about Martin Isaac's book?
 
hi skull
 
@JoseAntonio isaacs is the best possible book you could use on finite group theory, but it is too advanced for you now. It will assume knowledge of semidirect products, for example.
@TedShifrin hi there
 
Hello @TedShifrin :)
 
Feeling better, @Alex?
 
3:20 AM
Isaac has two books
 
@TedShifrin Yeah :) things are goin good
 
Hi @AWertheim
 
@JoseAntonio that applies to both, though ;)
 
oh awesome ... I'm so glad, @Alex
 
3:22 AM
@JoseAntonio let me make sure i'm remembering right. I have it.
@TedShifrin so am i
 
How was your cardiologist appointment Professor @TedShifrin?
 
I found it in the library of my university is very complicated take a copy of Dummit's everyone uses
 
@JoseAntonio yeah, i don't know... it does "start from the beginning", but the text (and, in particular, the exercises) get harder than what I'd be comfortable recommending for a first pass in algebra really quickly
 
I see
 
I love Isaacs writing style but it is supposed to be a graduate text
 
3:26 AM
Skull, need to have a stress test in a few weeks.
 
I think I will continue with Artin's book and complemented when I can find a copy of Dummit
 
Artin does not pretend to write a comprehensive text. It's intended to be a well-integrated, interesting course for bright undergrads.
 
@JoseAntonio well if you have any questions about the semidirect products thing feel free to direct them my way. they are a fun subject.
 
Thanks :)
I have to go I need to keep studying
@TedShifrin I really love Artin's book
 
3:31 AM
Hi mr @anon
 
It's so beautiful
 
hi
 
Me too, @Jose ... I learned my algebra from him.
 
@Anon That was pretty much the exact method from p488 Kreyszig "Advanced Engineering Mathematics"
 
I have to go
bye bye
 
3:32 AM
@Analysis: Without symmetry of the interval, you no longer have an orthogonal basis.
 
@AlexanderGruber Thanks for your help :)
 
@Ted I don't think I used Orthogonality in my method
Or is that used in constructing the method I used
 
so, @Ted. I was talking about this neat family of sets a little bit ago. have any interesting thoughts?
@JoseAntonio no problem
 
Indeed @Analysis
Your saying even function gives only a cosine series is totally based on the symmetry of the interval.
 
Hmm, well then I am not sure how to do this with only half a range, which is where I started ;\
So what you are saying is that I wouldn't know if the other side of my range($0\leq x \lt 1$) was even or odd, based on my range?
 
3:40 AM
You have to think of periodic functions with period $L$. You'll get neither even nor odd.
Cool, @Alex, seems very natural/interesting. I've never seen such a thing before.
 
@TedShifrin seems like it could have some cool properties. definitely setwise invariance under various flavors of homomorphisms. i wonder if there is anything geometric, it looks sort of fractal-y.
 
Artin is excellent, @TedShifrin
Dummit-Foote is sad when it comes to theories.
The exercises are super-hard however.
 
@BalarkaSen: why do you say that it is sad when it comes to the theories?
I've also found that the exercises are indeed challenging, but become easier if you do almost all of them.
 
I dunno. It just felt that way when I studied group theory from it.
Each to his own, I guess.
@AWertheim Heh didn't recognize you. You changed your avatar.
 
I'm just curious. I enjoy the development of the ideas in that book a lot, but it's possible I don't know any better. ;)
Lol, indeed I did! One of my friends picks them. =P
 
3:52 AM
@Ted Could you please just tell me what my bounds for my integrals are suppose to be, and if the standard coefficient forms for $a_0,a_n,b_n$ are right math.stackexchange.com/questions/939555/… . I haven't been able to work it out for three hours
 
Do the standard Fourier series for the function you get by extending it to $[0,L]$ by periodicity.
 
So $\int_{-1}^1$ for bounds
 
@AWertheim Maybe the problem is that I learned group theory after reading galois theory from it? I dunno.
But I found groups explained poorly in D-F
 
Yes, but you need the right function.
 
@BalarkaSen: wow, that sounds really challenging. How did you do that?
 
3:57 AM
I dunno. It felt natural.
Fields/Galois are much easier than groups etc.
Lesser structures are harder to grok.
 
Sure. But how did you interpret the fundamental theorems in Galois theory without knowing what a group was?
 
@Alex: Similar in spirit to Julia sets somehow ....
 
@AWertheim Eh, I knew what groups were. I just didn't study classifications.
 
Oh, I see. Sure, that's reasonable.
I think D&F is very nice for getting your hands dirty with groups. They have a lot of lovely problems, both computational and theoretical, which make you work out some important details.
 
And funny enough, I came up with galois like construction in groups when I came back reading group theory and classification stuffs.
@AWertheim yep, problems are nice.
 
4:00 AM
The exposition itself might be a touch lacking, I agree. You really need to do the problems alongside reading the text if you're going to get much out of D&F for sure. In fact, the best way to go is to do almost all of them.
(That's my opinion, anyway. :) )
 
I agree.
 
Most any subject in math you learn only by doing plenty of exercises, some routine, some challenging ....
 
Yes. Quoting theorems is not enough.
 
For sure, @TedShifrin. I've found this to be particularly true of D&F though. If you go through it problem by problem, there is a very natural flow of ideas. If you don't do enough, you might not get all the key ideas from a section, and if you pick them too sparsely, some of the problems later on may be very hard to even get started on.
 
@AWertheim You haven't seen Murty's analytic number theory book, have you? =P
 
4:07 AM
@BalarkaSen: nope! But I have been looking for a good analytic number theory book, by coincidence. How is it?
 
Just exercises. No theory whatsoever.
 
@BalarkaSen, how can you say that "Galois theory is easier than groups" when groups are absolutely central to Galois theory?
 
@AWertheim I can't say about textbook, but I do have an excellent survey.
 
Whoa. It's @KajHansen.
 
Iwaniec-Kowalski.
@Kaj!
 
4:10 AM
hahahaha, I've been away for a while :P
 
So it seems. :)
 
@KajHansen Groups are NOT central in Galois theory.
 
@BalarkaSen: neat, thanks! I'm probably not competent enough to appreciate it. But I'll write it down for when I am more well versed in ANT. :)
 
Ehh, I'm not so sure. Not an expert though. I do agree that the lesser structure makes groups more difficult to work with.
 
Groups were essentially invented by Galois to do symmetries of roots of polynomials.
@Kaj: I'll leave before I give you apoplexy :D
 
4:12 AM
Yes, @TedShifrin
 
@TedShifrin, I've finished my real homework an entire day before its due!
:P
 
You must be ill, @Kaj ... You never accorded me that severe courtesy!
 
It was actually a really interesting set. It was over the topology section in Rudin.
 
Some very hard problems in that chapter ... Dunno if he assigned them.
Oh, all my homeworks were dull ... I get it. In fact, you did choose mostly dull problems in diff geo :(
 
Perhaps not. We aren't quite done with the chapter though. Haven't gotten to Heine/Borel yet, for example. Maybe for next week?
I think it's more that I had a lot more on my plate last semester. The QUODEs homework has been really easy, so I feel like I have to make up for that somehow.
 
4:17 AM
@Ted I tried with bounds $\int_{-1}^1$ and $a_n$ ended up being $-2\cos n + 2\cos{-n} + 2\sin n - 2\sin{-n}$ which seemed wrong. I assumed when you say the 'right function'. It isn't $a_0 + \sum_{n=1}^\infty a_n \cos\left(\frac{n\pi x}{L}\right) + b_n \sin\left(\frac{n\pi x}{L}\right)$, $a_n=\frac{1}{L} \int_{-1}^1 f(x) \cos\left(n\pi x\right)$, $b_n = \frac{1}{L} \int_{-1}^1 f(x) \sin\left(n\pi x\right)$, $a_0 = \frac{1}{2} \int_{-1}^1 f(x) dx$
 
He's bogging down too much already ... There are 8 chapters to cover. Sigh.
 
8 chapters of Rudin in one semester??
 
I'm not sure he intends to cover all 8?
 
What is the $f(x)$ you're using, @Analysis?
 
@Ted $ f(x) = 2x^2$
 
4:19 AM
not all of 8, but one should get the highlights ... Chapter 2 is overkill.
 
Doug and I have been doing some really cool work for Lorenzini too.
 
Good @Kaj ... That's the point.
No, @Analysis. I told you twice you needed to make it periodic with period $1$.
 
$f(x) = 2x^2$, $f(x+1) = f(x)$, isn't that second equation giving period $1$?
 
What is $f(1)$, for example?
 
$2$?
 
4:21 AM
No, $0$.
 
I see
 
Huh?
 
I think I am going to take a break. I just don't get it. I'll be back later
 
Give me the formula for $f(x)$, $0<x\le 1$. Then I'm going to sleep.
ok, a picture might be a good start. Night.
Night, all.
 
Cya @Ted
 
4:25 AM
Obviously I need more practice, but I would think $f(x)=2x^2$ for that range aswell
Since it is periodic and that is one greater
 
That contradicts period $1$!
 
Night @TedShifrin!
 
You need to understand what period means.
 
But it is periodic with period $1$, and the first period is $-1\leq x \lt 0$
 
Night @AWertheim
 
4:26 AM
Night Ted
 
4:39 AM
Good night Professor @TedShifrin try not to worry and hope for the best :-)
 
For period $0\lt x \leq 1$ we have $f(x+1)=2x^2$
 
5:27 AM
@MikeMiller This
I couldn't make crap out of it but I guess it could be of interest to you.
 
 
2 hours later…
Huy
7:07 AM
@BalarkaSen: You can't make crap out of Gauge theory? :(
 
Greetings
 
Greetings
 
@robjohn I've just finished the 3 log integral. I'm preparing to write up the proof.
 
Huy
@Chris'ssis: I'm a bit rusty with Landau symbols. Does $Q(z) = 1 - \rho r^k + \mathcal{O}(r^{k+1})$ for $r \to 0$ imply that there is some $r > 0$ such that $|Q(z)| < 1$? Of course $r = |z|$.
($\rho > 0$)
 
@Huy It's like in the definition
In mathematics, big O notation describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. It is a member of a larger family of notations that is called Landau notation, Bachmann–Landau notation (after Edmund Landau and Paul Bachmann), or asymptotic notation. In computer science, big O notation is used to classify algorithms by how they respond (e.g., in their processing time or working space requirements) to changes in input size. In analytic number theory, it is used to estimate the "error committed" while...
brb
 
7:26 AM
$$\lim_{s\to \rho _1} \, \left(\sum _{b=2}^{\infty } \left(\sum _{a=2}^{\infty } \frac{1}{(a b)^s}\right)\right)=1$$
$\rho _1$ is the first non-trivial Riemann zeta zero.
 
@Huy $f(r) \in \mathcal{O}(r^{k+1})$ means there is a constant $C$ such that $\lvert f(r)\rvert \leqslant C\cdot \lvert r^{k+1}\rvert$
 
$$\lim_{s\to \rho _1} \, \left(\sum _{c=2}^{\infty } \left(\sum _{b=2}^{\infty } \left(\sum _{a=2}^{\infty } \frac{1}{(a b c)^s}\right)\right)\right)=-1$$
 
Huy
@Chris'ssis: Yes, thanks for the link. It clarified it.
@Chris'ssis: I thought about it in the way of $\lim_{r \to 0} \left| \frac{f(r)}{r^{k+1}} \right| < \infty$ but dividing the whole term by $r^{k+1}$ and letting $r \to 0$ didn't quite work.
 
$$\lim_{s\to \rho _1} \, \left(\sum _{d=2}^{\infty } \left(\sum _{c=2}^{\infty } \left(\sum _{b=2}^{\infty } \left(\sum _{a=2}^{\infty } \frac{1}{(a b c d)^s}\right)\right)\right)\right)=1$$
 
@Huy I see.
@MatsGranvik How did you check that?
bbl
 
7:58 AM
Limit[Sum[Sum[Sum[1/(a*b*c)^s, {a, 2, Infinity}],
{b, 2, Infinity}],
{c, 2, Infinity}], s -> ZetaZero[1]]
@Chris'ssis
 

« first day (1509 days earlier)      last day (3503 days later) »