« first day (482 days earlier)      last day (4541 days later) » 

QED
12:00 AM
That's weird....
 
If this is true, then the proof is no longer magical. You expect to find a unique real positive lambda; yes, we did. You expect that this is the largest root in magnitude [assuming my guess is right]; yes, it is. You expect that if lambda is the largest root, then the sequence is bounded by O(lambda^n); even that's true.
 
@Srivatsan How do you know that only the positive root is significant?
@Srivatsan Ah... that is how you are planning to do it.
 
Srivatsan what about 1=x^3
 
@robjohn Well, I will put it this way. My method will fail under these two cases: (1.) If the characteristic equation has negative coefficients in the RHS when you write it as x^d = something. (2.) x is not a positive real.
@JacobSchlather :) Right. So we should settle for every root is at most lambda* in magnitude... =)
Sorry for changing the goal post after seeing the counterexample. =)
 
No need to be sorry
 
12:06 AM
@Srivatsan: the sum of the roots is a_{d-1}...
 
@robjohn How's it relevant?
 
The positive root is bigger than a_{d-1}...
 
Update: I think triangle inequality gives the answer...
 
never mind
Oh, but the largest negative root plus the positive root is >= a_{d-1}
 
:)
 
12:08 AM
@Srivatsan I don't have my copy of Marden with me to confirm, but I do think he says something similar there. Maybe try finding it in your library?
 
For any x of magnitude strictly larger than lambda*, we have |a_{d-1} (1/x) + a_{d-2} (1/x)^2 + ... + a_0 (1/x)^{d}| <= a_{d-1} (1/|x|) + a_{d-2} (1/|x|)^2 + ... + a_0 (1/|x|)^{d} <= a_{d-1} (1/lambda*) + a_{d-2} (1/lambda*)^2 + ... + a_0 (1/lambda*)^{d} = 1.
 
QED
I added a note about showing 2^n < a_n < 3^n but I'm not sure if it's what he wanted
 
but I am forgetting about the real parts of the complex roots (they could be positive).
 
@JM Well, I think my argument below works.
 
@Srivatsan though a deft massage of Vieta might also be in order...
 
12:11 AM
Why Vieta?
@QED About your answer. That's a nice argument. But you don't have to exponentiate at all: a_n <= 2a_{n-2}, which gives a_n <= O(\sqrt{2}^n).
 
QED
that sounds even better than what I wrote
I don't understand it though...
 
And is it clear that a_{n-2} > a_{n-3}?
@QED what step don't you understand?
 
QED
ah you're right, it's not obvious that a_{n-2} > a_{n-3}
 
@Srivatsan you're asking for bounds in terms of the coefficient too, right?
 
@JM Nope, I am not. That will be useful, generally speaking. But I am assuming that God gave me the unique positive root. How big it is -- I don't care for this question.
 
QED
12:15 AM
how did you go from a_n <= 2a_{n-2} to a_n <= O(\sqrt{2}^n)?
 
Ah, I misread then. When I can, I'll check Marden.
 
@QED How are you bounding the a_n? or are you simply noting that?
 
@QED Apply induction to even n and odd n separately.
 
QED
ah clever!!
so let b_n = a_{2n}
and then prove b_n < 2^n and take the square root
that's pretty cool
I assume you could do similar tricks like that a few times to get more and more decimal places of the 1.3.. term
 
Well, it's the same principle behind that cleverness. The characteristic equation for a_n = 2a_{n-2} is x^2=2, so the general solution is like c sqrt(2)^n + d (-sqrt(2))^{n}.
 
12:19 AM
@Srivatsan your argument seems sound to me.
 
@QED Another way is essentially what you wrote: a_n = 2 a_{n-2}. So a_n = 4 a_{n-4} = ... = 2^{n/2} (a_1 or a_0 depending on the parity of n).
@JacobSchlather Thanks.
I am glad this turned up 2 or 3 nice ideas, all connected somewhat.
@QED But all this contingent on the assumption that a_n is an increasing sequence. Should be true, but am currently blanking out on a proof.
Actually, you can prove that by induction =)
 
So certainly a_n>a_{n-2} and a_{n-3}
 
That's easier, yes.
 
Yeah and a_{n-1}=a_{n-3}+a_{n-4}
 
But I was thinking: a_{n+1} - a_n = a_{n-1} - a_{n-3}. So, if a_{n-1} > a_{n-3}, then a_{n+1} > a_n completing the induction.
 
12:25 AM
then since a_{n-2}>a_{n-4} we have that a_n>a_{n-1}
either way works
 
Yes, the same thing with different indices.
@QED If you want to undelete and expand your answer, then I will upvote it. =)
 
QED
I can add the \sqrt{2} thing you said, that's worth saying
I thought just what I said wasn't really enough
 
@QED Yep. [To make the complete, you will also need to explain that a_n is increasing.]
 
QED
I just noticed
a_{n} = a_{n-2} + a_{n-3}
hmm
 
@Srivatsan that's easy though
 
12:40 AM
@robjohn Yes, it is.
Glad when we come together in agreement. =)
 
Ooh, I hope that I hit 1000 more rep exactly.
I haven't seen 12345
 
Ok, I just called truce. I just edited out the contentious last paragraph in my answer...
 
@Srivatsan have I missed a heated battle?
 
Nope, you didn't miss a single minute, I believe. The lil-o Big-O answer.
 
@Srivatsan Yes, and I see that you have changed it to "Final Words" :-)
 
12:49 AM
@robjohn Yes. Bottom line seemed to be too authoritative... =)
Feliz Navidad... Feliz Navidad...
 
And "Final Words" indicates that you won't say anything more.
 
In that answer. =)
 
@Srivatsan Hey, they stopped Santa Claus is Coming to Town
 
Conclusion sounds better, I suppose. But I am not concluding anything. Additional remarks sounds more scholarly. =)
Hey, Michael overtook you in the binomial thread.
It's ironic that you write Beta(m,n) as \mathrm{B}(m,n). Shouldn't you write \Beta(m,n)? =)
Ok, have to go find a dinner place, @robjohn.
 
And his was about the same as the first poster, I think
@Srivatsan Funny :-p
 
12:56 AM
"his"?
 
Oh, Hardy, not Spivey
Yeah, probabilistic arguments seem to get more votes.
 
@robjohn I was puzzled by that too.
 
But Mike Spivey's seemed to be pretty close to Paul's
Mike just referenced integration by parts rather than showing the gory details.
 
And, "incidentally you can find it in Comtet's book." =)
[Well, I did cut out some words in between "incidentally" and "you can find it in Comtet's book". =)]
 
Okay, I didn't see the reference. That is good.
6 mins ago, by Srivatsan
It's ironic that you write Beta(m,n) as \mathrm{B}(m,n). Shouldn't you write \Beta(m,n)? =)
 
1:02 AM
Why are you linking to it now?
 
When I first started on chat, I was talking to someone about the .sty I added to my setup that adds the missing capital Greek characters.
I don't know if Srivatsan was there, but I'm sure he knows that \Beta doesn't exist
 
I honestly didn't know.
 
I \newcommand \Beta to be \mathrm{B}
 
@robjohn Oh my, are you thinking that someone's pretending to be me?
:)
 
That's because the capital Greek letters that look like the Roman letters do not appear in TeX
 
1:05 AM
I didn't know that either.
 
Oh, Hi there :-)
So your comment about the \mathrm{B} was not a joke...
 
No, it wasn't. Why would I joke about Beta?
And when you said it was funny, you really meant that it was a poor joke, didn't you? :)
 
Because it doesn't exist. I didn't remember if it was you with whom I had the talk about this months ago.
 
Ok, this has to be resolved, but not now. :-)
 
Your comment made me think it was... dinner time?
 
1:08 AM
I have to run. (I will let the real Srivatsan handle the situation from here. =))
 
I have to go as well and get cat food.
 
Now would be the time to make a "cat food for dinner" joke, but no, I am too busy for all that... =)
 
1:27 AM
Nov 6 at 2:17, by robjohn
@JM If I think about it, I know which are not defined in TeX, but it is just easier to type \Beta. Also, I can fix up the font if needed (I forget if the plain Roman matches the Greek font face).
It was JM and it was just earlier this month. It felt longer ago.
 
Ah, it was me. :) I suppose it will always trip the unwary...
 
@JM Did that copied message with the @JM ping you?
 
It didn't.
 
You just happened to be looking at the chat window?
 
Yes, reading the backlog. I'm finished now.
 
1:31 AM
Michael Hardy is almost at a Nice Answer. I am defeated ;-)
 
People like probability, I guess. (I upvoted yours and Mike's of course.)
 
All the answers are good.
I like it when a question spawns a lot of different answers.
Srivatsan mentioned that Michael had passed me. I really don't mind, but now that it was mentioned, I have been watching...
 
You guys are essentially neck and neck.
 
Michael's answer is much nicer, I do agree. I only posted so that Srivatsan could adjust the tags :-)
Bringing the Beta function into it.
 
I consider the binomial coefficients to be "special" themselves, though. :)
 
1:37 AM
I really have to go and get cat food. They will not forgive me if I don't.
bbl
 
QED
1:54 AM
That's better!
@Srivatsan, I managed to get a_n < (cube root of 3)^n
cube root of 3 is a little closer of that weird algebraic number than sqrt(2).
So we have a way to bound recurrences by nth roots: it would be funny if the method could be extended to get the exact roots of that weird cubic
it might well be possible by splitting up the sequence into three parts then two parts and doing something tricky there
oh that was stupid of me, \sqrt(2) is closer than \sqrt[3]{3}...
 
2:30 AM
@QED I didn't why you changed it to 3^{1/3}, but the answer looks good.
 
2:43 AM
hello anyone up
 
QED
@Srivatsan, I thought 3^{1/3} was closer than 2^{1/2} but I realized I was wrong after I wrote it all out!
 
@QED Oh I see.
Hey RajeshD
 
does anyone know quaternions ?
hi @Sri
 
Sorry, no idea about quarternions.
 
QED
@Rajesh, what about them?
 
2:47 AM
I think I should've posted my new question on MO: missed opportunity... =)
 
@QED : I'd like to know how e^(i*omg*t1) e^(j*omg*t2) rotates in quaternion space as analogous to e^(i*omg*t) in complex plane
@Sri what was your question
 
QED
I think that multiplication doesn't correspond to rotation
 
QED
you need to conjugate like this: RPR^dagger to rotate P by R
 
why not
@QED : then what does e^(i*omg*t1) e^(j*omg*t2) represent...what kind of a vector it is and how does it change as i vary say t1 and keep t2 constant ?
 
2:56 AM
@RajeshD why not «what»?
 
QED
oh, let f(t1,t2) = e^(i*omg*t1) e^(j*omg*t2). f(t1,t2) does trace out a circle as you vary t1 (or t2). I thought you were asking what effect has on a quaternion q: like f(t1,t2)*q
 
why it does not rotate............by multiplying e^(i*omg*t1) with e^(j*omg*t2) what is actually happening..............I want to interpret the variation of e^(i*omg*t1) e^(j*omg*t2) with t1 or t2 or both varying
no i wasn't intending to ask about multiplication by q
 
QED
actually what I said above only works for f(0,t) or f(t,0), I'm not sure what happens when you vary in f(pi/2,t) or anything like that
 
e^{it} rotates, e^{jt} rotates, and e^{kt} rotates, each in their own plane.
 
yes
but what happens to the product of any two of them
i am in need of an interpretation
 
3:01 AM
Have you tried rotating things in R^3? Telescopes help this intuition
it is rotation, but along another axis.
 
I need this as i am studying the tw0-D Fourier series/transform in quaternionic formulation
@rob any links
 
alo alo alo
 
Ello
Hi @mixedmath and @Sivaram
 
The cusp of another 10k user
oh dear
 
3:17 AM
For eample consider a point on unit 4-sphere, and the line joining it to origin makes angles phi, theta, psi with i,j,k axes respectively.....then what is the quaternionic representation of that point....is it e^{i*phi} e^{j*heta} e^{k*psi} ? Is this correct
@QED e^(i*omg*t1) e^(j*omg*t2) always lies on the unit 4-sphere. I've checked its magnitude
 
Hi Srivats
Hi @Srivatsan
 
3:32 AM
Well, I pinged you just because I hadn't seen you in chat before. =)
 
:). This is probably my second time chatting!
 
Nice!
 
 
1 hour later…
4:49 AM
Just curious, is it clear to anyone why x^8-24x^6+144x^4-288x^2+144 is irreducible over Q? Wolframalpha tells me it's the minimal polynomial of sqrt[(2+sqrt(2))(3+sqrt(3))] over Q, so it's surely irreducible, but I can't think of reason or test that would prove why.
 
QED
5:04 AM
@yunone: How does sqrt[(2+sqrt(2))(3+sqrt(3))] imply it's irreducible?
 
It's the minimal polynomial of something
so it's irreducible, QED
 
5:41 AM
@mixed : any idea on quaternions ?
i have a question
 
6:00 AM
@JM Do you know why we have a tag? I think we should just clean it up and delete the tag.
@Martin See my comment above.
 
@QED By definition minimal polynomials are irreducible.
Heh, nice proof @mixedmath but I'm afraid I'm not fully satisfied. :)
I'm also in favor of getting rid of the [number] tag.
 
@JM Oops, I just realised that there are over 40 questions with that tag. (I was initially mistaken that there are only around 5 questions.) Not sure about abolishing the tag anymore, but I still feel that the tag is pointless.
 
6:21 AM
Hi.
 
Hello.
 
@Srivatsan I do think it is a crap tag... then again we're still working slowly towards eradicating , no?
 
Are you telling me to put this off until later?
Btw, does the meta post cover this?
 
Not really. But maybe bump the "answer" mentioning that tag in that looong thread?
See if any new discussion comes up and all...
 
@JM Do you just replace algebra with algebra-precalc or abstract-algebra when you see it? Or is there something more systematic going on?
 
@yunone More or less, yes. Then again I haven't seen a question that couldn't be retagged into either of those two.
Thanks for bumping, @Sri.
 
NP, JM.
Actually, same comments apply to tag, no?
 
Yeah.
(There really ought to be a spring cleaning day for tags...)
 
- if you propose it in meta, I will upvote you :=)
I suppose it will be much more efficient that way. How much time will it take to retag tens of questions removing the [natural-numbers] or [number] tag? In the current system, it's taking too much attention from a few people involved.
 
Actually I think there already was a meta thread, which I can't find for some reason...
...and I need to be out for a while *poof*
 
6:50 AM
Sure. Later, JM.
 
7:39 AM
@JM If you are afraid that there will be too many bumps, if we start eradicating both number and algebra, there are two possibilities to avoid this: A. I can wait until number is done; B. We can do it on different days. (I retag regularly 10 questions from algebra tag each Wdnesday and each Saturday - I plan to go on with this timetable.)
@Srivatsan I see that this is not how this tag is being used, but I was just wondering: Do we have a tag for constructions of rational, real, natural numbers etc.? Like this question math.stackexchange.com/questions/85672/…
(and if we do not have such a tag, would it be useful in your opinion?)
 
has anyone got any idea what Nash equilibrium is all about
 
I won't be at the computer until afternoon, but I will stay logged in. Feel free to ping me if you have something related to tagging debate; I'll check the messages later.
 
@MartinSleziak I did some cleanups for the [natural-numbers] and [number] tags today. I won't be touching them soon. [We could agree on a time-table...]
 
Ok
If I continue with algebra tag as I was doing until now, next 10 questions come tomorrow.
Is it ok?
 
I suppose it is. :)
 
7:44 AM
Fine, agreed.
 
I would say, since you're doing [algebra] already, let's not stall that and take up the [numbers] tag. Either we do them in parallel, or if for some reason we should choose one, we can go ahead with [algebra].
 
BTW is it weird that when I came to my computer this morning, I check my new responses at math.SE first and my emails (some of them work-related) only later?
 
@MartinSleziak What would we call such a tag?
 
@RajeshD: [If in a game] each player has chosen a strategy and no player can benefit by changing his or her strategy while the other players keep theirs unchanged, then the current set of strategy choices and the corresponding payoffs constitute a Nash equilibrium.
Taken from Wikipedia
 
@MartinSleziak Not weird; it happens to me. Keep it up :)
 
7:48 AM
thanks matt...i was reading that on wiki
 
Morning folks, btw ; )
 
After all, it's MSE that gives badges, not mail. =)
 
what kind of math is involved in it
 
@RajeshD: I think it explains it quite well.
@RajeshD: Game theory.
 
i do not know anything about game theory
 
7:48 AM
@Srivatsan I have no idea. That's why asked if we already have such a tag. (Or how people do tag such questions.)
 
Oh.
 
is it combinatorics ?
 
@MartinSleziak I imagine it would be tagged under the resp. field: like, construction of reals = analysis, construction of rationals is elementary abstract algebra, but without the elementary qualification. Construction of natural numbers = set theory or logic or some such.
 
or is it a field of its own.then i wonder from which branch of Math did it originate from
 
Lemme look.
 
7:50 AM
@RajeshD game theory is a branch of math by itself.
 
@Srivatsan The question I mentioned is tagged . So it's consistent with what you're writing.
 
It originated from a field of math called von Neumann... =)
2
 
does it involve probability and statistics..........or statistical decision theory.(sorry for repeated questions) i am just curious
 
But aside from the joke, I don't know the correct answer to where it came from (historically, say).
@RajeshD No, it's not to do with probability or statistics per se.
What's statistical decision theory?
 
okay......what kind of math prerequisites are needed to appreciate Nash equilibrium
 
7:54 AM
@Srivatsan: Von Neumann did actually contribute to it. It seems that the first two people studying strategies in games were Borel (surprise!?) and von Neumann. At least according to Wikipedia.
 
I've seen the term strategy in a book involving statistical decision theory
risk minimization stuff given full statistical priors
 
@Matt Hmm, Borel is news to me. Thanks for the info...
@MartinSleziak Unless you think of constructions as a unifying theme, it makes sense. =)
 
Borel set ?
 
Yes, Émile Borel.
 
@RajeshD Borel of the Borel set fame, if that's what you mean. Borel-Cantelli lemma...
 
7:57 AM
(I briefly considered to be lazy and omit that accent on the capital letter but that might have resulted in capital punishment.)
 
@Matt Is that a pun? =)
 
@Srivatsan Let's call it attempt at a pun : )
 
now the actual thing i intended to know..............does it (Nash Equilibrium) involve real numbers and real analysis stuff
or just discrete variables ?
 
@MartinSleziak Perhaps a [construction] tag would be akin to [examples-counterexamples]. But I don't find it that compelling.
 
@Srivatsan I'm not insisting that such a tag is needed, I was just asking.
@Matt It was a capital pun.
 
8:02 AM
@RajeshD I am not sure what you mean. The space of strategies could even be finite, like {coöperate, defect}.
But it is not guaranteed that every game has a "pure" Nash equilibrium. But you always have a "mixed" NE. In that sense real numbers come in, probability comes in.
 
@Sri : I mean does it involve atleast in special cases, some real analysis stuff....just to know......i have no intentions of any kind
ok
thanks @Sri
 
Aw, I missed the 1000 question mark in meta. =(
I am gonna delete 3 questions of mine to bring it down to a 1000... ;)
 
One final question : What kind of impact it had...........was it some awesome stuff
not a good idea
@Sri
 
@RajeshD Er, sorry, not willing to judge. I don't find it very interesting, but I have a narrow view of the world.
But it is considered a great idea.
 
Hmm....
 
8:08 AM
@RajeshD: You could watch "A beautiful mind". It's a film about Nash and his mental illness. It's quite good.
 
I've done that way back.........its a good movie...............even for Hollywood
 
@RajeshD What do you mean by "even for Hollywood"?
 
with my limited math knowledge thats the only way i can appreciate it
@Sri : it just came in the flow
i do not mean anything
 
Ok, np. I just thought it was a curious comment.
 
ignore the blond...............aww great stuff
 
8:12 AM
@RajeshD Er, what does this comment mean? =)
 
Hollywood gave its own version of Nash equilibrium
some masala stuff
@Sri didn't you watch it ?
Do you think thats the way mathematicians get their cool ideas ?
 
No, I did not watch it yet. I find it a bit too... popular. Hurts my ego. =)
 
Here you go
 
Oh, this one. I know what you're talking about.
 
8:42 AM
@Martin, @Srivatsan: The history of the definition of N as sets is definitely set theoretic.
 
@AsafKaragila Of course, I agree with that. The question was whether some tag related to construction of varoius number systems (N,Z,Q,R,C) would be useful or not.
(Probably not, but I asked since is about to be cleaned.)
 
I am not sure that such tag is relevant. There are too little questions, they would fit just fine into other sort of tags (each to its own) and we already have too many tags.
Can any of you guys explain to me what is a pullback?
 
Sorry, I'm of - my lecture is starting in 5 minutes.
 
Oh. Well enjoy.
 
See you later!
 
8:47 AM
Hi Matt.
 
But i doubt I'd be able to give any insights beyond the definition and the construction using products and equalizers.
 
Hi Asaf. I'm stuck on your answer where you write "This tells us that 0 will force that y \in x ..."
(I don't know what a pullback is, I haven't done Differential Geometry)
 
When you say that <x,p> in y it really means that p forces x in y.
 
oh!
 
I am talking about the categorical sense of pullback. In the diagram way, not the DG way.
 
8:50 AM
Then it's the dual of the pushout : =)
 
@Matt Because when interpreted by a generic filter which has p in it, you will have that there is some p in G for which <x,p> in y.
 
@AsafKaragila: Then shouldn't it be "0 forces \tilde{y} in x"? You wrote "0 forces y in x"....
 
Yeah, there is no latex here and I do my best to keep my messages readable.
Although readable rarely implies understandable :-)
 
No, I meant in your answer!
Just below the definition of canonical p-names.
 
Ah, the canonical names are essentially the elements themselves.
In about two hours you will stop making this distinction between x\in V and \check x :-)
(I am sticking to my Jech-ian notation!)
 
8:58 AM
I'm looking forward : )
So is or isn't there a \check missing in your answer?
 
Both.
 
(If making a distinction)
 
It's missing if you insist, but it goes fine without it.
 
Ok.
 
 
1 hour later…
10:05 AM
Hello there
 
hey Akram
 
hello , how is mathematics going ?
 
@AkramHassan Well, it goes well
 
nice to meet you , what are your interests ?
 
CS, combinatorics, learning some analysis and algebra
 
10:15 AM
are you a student or a professor ?
 
Student
 
i am an absolute beginner :)
 
Um, are you a high school student?
 
i am en engineer , i have done a lot of mathematics in college , but my interest in real mathematics started later
 
Oh, interesting. From your posts, I see that you are interested in plane and euclidean geometry
 
10:20 AM
yeah , thanks for looking :)
there is still too much learn though
to much to learn *
 
10:43 AM
hello
 
hi
 
@AsafKaragila: I used to think that every set had a cardinality. Apparently, only sets that can be well-ordered have a cardinality. But then again, why shouldn't there exist a bijection between sets A,B even only one of them can be well-ordered?
So maybe all sets do have a cardinality...
If A cannot be well-ordered find a bijection to a set B that can be well-ordered -> problem solved.
 
@Matt are you assuming Choice or not?
 
@Srivatsan: I'm not sure. Does it matter?
 
hello there
 
10:49 AM
I'm reading Kunen's Set Theory, the definition of cardinality is given on page 27.
But I haven't read it sequentially so I don't know. Let me find out.
 
It might matter because well-ordering theorem is equivalent to choice. See en.wikipedia.org/wiki/Well-ordering_theorem
 
@Srivatsan: Yes, with Choice.
 
Then every set is well-ordered, no?
 
@Srivatsan: That's how AC is stated in the book.
(AC) For every A there exists R such that R well-orders A.
Although he doesn't state that A is a set and R is a relation...
 
@Matt So what is the issue here?
 
10:54 AM
@Srivatsan: None.
 
Ok. =)
Oh, now I get it. Did you think that cardinality can be defined even without choice but realised that's not possible?
 
Yes. Sorry, set theory and forcing still feels like groping around in the dark to me.
 
@AkramHassan Hey Akram.
Did you have a question or anything?
@Matt If R is not a relation and A is not a set, what could they be?
 
Yes, I know. But he could still specify it explicitly.
A could be a class.
 
Hi :]
 
11:11 AM
Hi.
 
11:34 AM
I have a homework deadline in Functional Analysis tomorrow and here I am, doing set theory : (
 
@Matt I am in class right now. I will explain about cardinals in 30 minutes.
Every set has a cardinality. It need not be aleph though.
 
Yes, I think I figured it out. All sets are well-ordered in ZFC. So the cardinality of a set is the least ordinal such that there is a bijection to it.
 
I wrote about cardinality in the absence of choice in several answers. Look for the tags of cardinals and axiom of choice.
 
What is the order in the well-ordering of sets in ZFC?
 
An order is just a set of ordered pairs.
 
11:41 AM
I see, what is the name of the theorem that states that every set in ZFC is well-ordered?
 
Zermelo's well ordering principle.
 
Thanks, Asaf.
 

« first day (482 days earlier)      last day (4541 days later) »