« first day (613 days earlier)      last day (4703 days later) » 

12:07
@N3buchadnezzar How do you like this horn?
@tb Hmm, I've tried the same when I was at the level of knowledge...
I quickly decided I better study some other things first 8-).
Same here. But notice we didn't look for an in-depth study... I still don't know the first thing about FA
Oh, like that. I know some very small topics in some reasonable depth I think. Semigroups perhaps.
But only a part of that too, not so much analytic ones.
@tb I am starting to get hold of this base change stuff
good. Then you no longer have to ask me about it :)
@BenjaminLim sorry, I saw your question but I was really not in the mood. I always have to look up what a local ring is...
12:13
@tb It's ok did not need any local ring
(I told you several times already that commutative algebra is not at all my cup of tea)
All I needed was the fact that if $M$ is an $R$ - module, $N$ an $S$ - module
then there is an isomorphism
between the $S$ module $M \otimes_R N$ and $(S \otimes_R M) \otimes_S N$
user19161
@BenjaminLim It is not common. Yours is pretty common here.
I know, that's what my dad told me in malaysia and singapore the surname Lim is everywhere
user19161
@tb Really? I thought you knew everything!
12:16
@tb You seem to hate it with a vengeance
avec de la vengence !!!
@JasperLoy No, you must confuse me with my Greek namesake θεός
@BenjaminLim I just find it utterly boring.
hahahahahhahahahahahahahaha
@tb what bout algebraic topology?
I will do that next semester
@tb You know I look up to you.
user19161
@BenjaminLim He is taller than you?
No I am quite tall 6 feet 2
user19161
I am quite short, 1.68m.
12:21
@tb Quelle est votre taille?
@tb This checking of maps, bilinearity, S - linear or R - linear or whatever, checking that maps are mutual inverses is tiring me
@BenjaminLim You shouldn't! Seriously: I use a lot of algebra but I simply don't like study it for its own sake for some unexplainable reason.
I'm also tiny 1.99m.
user19161
@JonasTeuwen What? That's huge!
@tb What algebra do you prefer?
user19161
@N3buchadnezzar prefer
12:23
@JonasTeuwen width ?
@tb Why not? I miss it when there are no people to talk mathematics to about. But commutative algebra is used for algebraic geometry no?
@N3buchadnezzar I didn't measure that.
Oh, I thought 2m was width.
@BenjaminLim it is. That's why I never seriously studied it.
Holy cow, then I would be a monster.
12:24
There's too much math that I find more interesting.
@tb Man theo this AM they don't tell you a lot of details do they?
Like automatically something is isomorphic to something else what the?????
@JonasTeuwen a monster and the coolest professor,
I'd be satisfied with that 8-).
@BenjaminLim no, they don't. But I never actually read the book. When I was trying to learn that stuff a little bit then there was only the too terse AM and the too chatty Eisenbud.
@JonasTeuwen the FA guy wants to know what you would recommend.
AM is very terse indeed
I have told Kannapan to be prepared for a baptism of fire from tensor products in AM
12:26
And with Eisenbud you could kill a monster of 2m width by letting it drop onto its head from the height of one meter
Eisenbud is worse than Rudin? Geesh
user19161
Bourbaki is the most concise.
user19161
I like to write in Bourbaki style myself.
user19161
Or try browsing Federer's geometric measure theory.
Oh, that's a wonderful book, too :)
12:28
@tb Okie.
@JasperLoy I once read the assessment: "I don't know if that book was written by a robot or for a robot; probably both."
2
@tb I am told
that if we have finite dimensional vector spaces $V$ and $W$ such that $V \otimes W = 0$
user19161
@ben I realized you still hate using the right arrow.
Why can we conclude that $V = 0$ or $W = 0$?
@tb forget it
this comes from the fact that
$\dim V \times \dim W = 0$
Hence $\dim V = 0$ or $\dim W = 0$
so that either $V$ or $W$ is the zero space
So where does geometric measure theory come in handy?
12:31
dimesion is really powerful
I don't like my dimensions finite.
@JonasTeuwen Then you really are a monster
@JonasTeuwen Imagine trying to prove $a$ algebraic, $b$ algebraic implies $a + b$ algebraic
by bashing algebra
using dimension everything is so easy
@JonasTeuwen For instance compactness theorems. Existence of minimal surfaces is a classic. Read Almgren's booklet. It's a gem!
and not more than 100 pages, if I remember correctly.
Fred Almgren is a legend man
Antonio Ros
user19161
12:35
I wish Bourbaki can write all of mathematics in a new series that is current and relevant.
user19161
Then every math student can just read that and nothing else.
@JasperLoy Prob not a good idea.
user19161
Perhaps a new Bourbaki group will form one day for this purpose.
@JasperLoy I do like Bourbaki very much, but I seriously wish that won't happen.
Bourbaki still exists, they just focus on polishing their tomes and organizing the séminaires.
user19161
I am sick and tired of so many textbooks with different definitions, notation and level of generality.
12:37
@JasperLoy what kind of math you are studying now?
our lecturer uses a different definition of what a separable polynomial is, confusing like hell when you want to check with other resources
@JasperLoy I never found that particularly distressing. But that's probably because my way of thinking doesn't involve notation that much.
user19161
@BenjaminLim None. I finished my undergrad. Maybe I will apply to grad school in future, maybe.
And you're going to have to get used to all kinds of notations. Unless, of course, Mariano becomes the Emperor of Notation.
@tb Do you perhaps also know the title?
12:39
bye guys
i am going to bed now
all this alcohol is making me tired
good night, Ben!
user19161
@BenjaminLim Oh, and then you have to check if the definitions are equivalent or not too.
@JonasTeuwen what title?
@BenjaminLim Maggot?
@tb Of the Almgren's booklet.
user19161
I once saw a blog post where the fridge was infested with maggots as the owner turned it off before a trip.
12:40
@JonasTeuwen not now but before yes
nite guys
@JonasTeuwen Oh, Plateau's problem. Cambridge.
user19161
@jonas Are all the people there as tall as you?
No, certainly not, but there sure are people that are taller.
Well, the average woman is at least 8 cm taller than you 8-).
user19161
It's OK, I have given up on women long ago. :-)
user19161
12:44
I will probably stay single this life...
user19161
No need to remove that, so secretive!
user19161
I also noticed you use a different smile, namely 8-).
@JasperLoy he wants to make sure people know he wears glasses :-)
user19161
Why? You are not spending enough time with her?
"What did you write???????????"
12:46
@JonasTeuwen exactly.
user19161
@robjohn Oh!
Jonas will leave no further trace of himself on the chat. He seems to be erasing all of his comments :-)
user19161
Matt is infecting everyone with his secrecy! I also have my secrets...
@robjohn seen this? I thought the geeky side of you would love it :)
(totally useless, of course)
@tb Hmm, I can't see how you've done is. Does \eqref do this?
12:50
yes. you put a labels inside a \begin{equation} environment or elsewhere, then you can use \ref and \eqref to refer and link automatically to it.
(it's a bit unstable, though). Haven't quite figured out what broke it all the time when I was trying it out.
@tb I didn't think that \tag could take math on the inside. I had tried, and failed. Maybe this is new in 2.0
@robjohn It is a 2.0 feature. It didn't work under 1.0. J.M. and I spent quite some time to convince it to accept an asterisk as a tag.
@tb That is handy.
@tb also I didn't know that \label picked up the contents of the \tag before it
I guess I am used to the auto numbering from the environment I usually use offline.
@robjohn heh, you noticed that :) I was somewhat surprised, too.
@tb is that documented somewhere?
13:03
@robjohn I played around with it myself, but see here
It seems to be hinted at here since our equation environment is really equation*
@tb will you do me a favor?
@DavidWheeler what's up?
Autmatic Equation Numering?
look at this: and tell me if what i said makes sense? math.stackexchange.com/questions/128788/…
13:06
@robjohn a further improvement is that you no longer seem to need to do this ugly enclosing of everything into double dollar signs.
@DavidWheeler Just a sec.
@DavidWheeler Looks okay. I wouldn't argue that the projections are epimorphisms though: I would use the universal property of the quotient map a few time to cancel $p_M$, $p_{M/N}$ away. Else you'd need to argue why they are epimorphisms (which categorically comes down to the same). Of course it's obvious because they're surjections of the underlying sets, but I'm nitpicking from a puristic viewpoint.
the "why" is what we talked about yesterday, right?
no, yesterday we talked about the converse: every epimorphism in groups is a surjection of the underlying sets.
ok, well that's easy
Hello all!

How can we type an array here?

Thank you
but i'm interested in how you would use the universal property to cancel the projections away
@tb Thank you! Question related to linear algebra coming up :P
good luck!
@DavidWheeler Let me state the universal property in detail: You have an inclusion $i_N: N \to G$ and the quotient $p_N: G \to G/N$. If $f: G \to H$ is such that $f i_N = 1$ (the map sending every element of $N$ to $1$ in $H$ then there exists a unique morphism $f': G/N \to H$ such that $f'p_n = f$.
right, if f kills N (which is what $fi_N = 1$ means) f factors through $p_N$
exactly.
so how can you "cancel" the p's"?
13:22
To verify that two morphisms $h,k: G/N \to H$ are the same you check if $hp_N = k p_N$ and the universal property tells you then that $hp_N = kp_N$ factors over both $h$ and $k$ and by uniqueness it follows that $h=k$.
(so this is actually the proof that $p_N$ is an epimorphism).
ok, so i didn't need to invoke cancellation, uniqueness does it for me
yes, exactly. I just noticed that in the universal property I forgot to state that $p_N i_N = 1$...
The fun of this is that you don't need to mention any elements at all. Everything is just massaging arrows.
the thing is, i didn't have anything factoring though the projections, so i would have had to invoke the identity morphism at some point, but i see what you're saying
yeah...the subgroup N can be replaced by the injection monomorphism, right?
give me a second...
i'll give you 10, i'm in a generous mood :)
13:27
I tried using the euler substitution $\sqrt{x^2-2x}=x \cdot u$ to integrate $\int \sqrt{x^2-2x} \, \mathrm{d}x$, and now my head really hurts. Great..
@DavidWheeler The relevant diagram is this:
Forget about the words.
so "C" is "G", "A" is "M", "B" is "N", "X" is "N/M" and "Y" is "G/N" yes?
what does "bicartesian" mean?
yes and Z is G/M
@DavidWheeler I told you to forget about the words :) It means both a push-out and a pull-back (this isn't true for groups)
This is from a text on additive categories.
Hello again,

In linear algebra, given 2 linear transformations, $\theta : R^{3x1} \rightarrow R^{3x1} $ and $\varphi : R^{3x1} \rightarrow R^{3x1} $.

$\theta : \begin{bmatrix}
x_1 \\
x_2 \\
x_3
\end{bmatrix} \rightarrow A\begin{bmatrix}
x_1 \\
x_2 \\
x_3
\end{bmatrix} $

And for $\varphi$ is given this: $\varphi : R^{3x1} \rightarrow R^{3x1} $.
Is there any $\varphi$ that would make this* statement true?

* : $ Ker(\varphi) = Image(\varphi) = Ker(\theta) $

What I did was this:
We have this for $\varphi$ : $dim(R^{3x1}) = dimKer(\varphi) + dimImage(\varphi) \Rightarrow
oh, i think i have it wrong: "Y" is G/M (the second row is exact), and "Z" is G/N (we "cancel the M's")
13:34
Some people call pull-backs Cartesian squares (because they generalize the Cartesian product) and push-outs Cocartesian squares (by daulity).
@Chris use bmatrix instead of matrix
so a product is a pull-back?
yes, with the terminal object in the lower right corner.
@tb Thank you :)
terminal...thinking...singleton set?
yes.
@Chris this looks good :)
13:39
the first time i ever heard of pull-backs was with pre-composition in manifolds
that's a different kind of pull-back
(same word but no strict relation)
You know how products are defined, right?
You're given $M$ and $N$ and a product is an object $P$, equipped with two projections $p_M: P \to M$ and $p_N : P \to N$ such that....
products are defined as universals that factor through the projection pair?
@tb: Really? Great! Thank you!
yes
....for every object $Q$ together with two maps $q_M: Q \to M$ and $q_N: Q \to N$ you have a unique map $f: Q \to P$ such that $q_M = p_M f$ and $q_N = p_N f$.
it's like the group quotient, but with a pair that factors
which is why, no doubt, AxB/Ax{0} is iso to B
13:43
@DavidWheeler No, it's somewhat different in that $f$ goes into the product. In the quotient you have a map coming from the quotient (dual situation)
ok, existence of target, rather than existence of source?
Yes. Kernels and products have universal "target" property, while cokernels (quotients) and coproducts (disjoint unions for sets) have a universal "source" property.
The technical term for "target" property is "limit" while "source" is "colimit".
cokernels aren't the same as quotients in groups, though
i mean, we have to do some funky thing with the normal closure, right?
abelian groups are "nice" coker(f) = H/f(G)
True. But let's look at normal subgroups :)
The quotient by a non-normal subgroup isn't a group in the first place...
well, i mean we'd have to look at something like $H/\langle f(G)^H \rangle$
could get messy
13:53
too much algebra :-)
@DavidWheeler Yes. That's because every homomorphism annihilating a non-normal subgroup $H$ annihilates a normal subgroup containing $H$ and conversely for every normal subgroup N containing H the quotient map $G \to G/N$ annihilates N, so the smallest possible quotient is what you just wrote.
if f is epi, though, the cokernel should be nice :)
Or if $f$ is the inclusion of a normal subgroup :)
that's a more interesting situation, because the cokernel isn't trivial then
Well, it's nice whenever the image of $f$ is a normal subgroup...
13:55
like the inclusion of the rotations in the dihedral group
@robjohn that's probably my punishment for having complained about algebra just an hour ago :)
i'm starting to really like the dihedral groups...they're the next-best thing to cyclic
@tb :-) I just go back and work some questions. I would only get lost in the diagrams :-)
right now, I am trying to decipher an answer by Didier that seems hard to follow. I answered much later, but I think it is easier to follow.
i think diagrams are to make things clearer, not more complicated
@DavidWheeler yes, they're nice. Ever looked into reflection groups?
13:59
@DavidWheeler I'm sure they do, but I really need to brush up on things first.
Let A be a matrix: $ \begin{bmatrix}
7 & 2 & 3 \\
10 & 5 & 6 \\
17 & 7 & 9
\end{bmatrix} $
are there any P and Q matrices that make the $PAQ$ matrix invertible?

In addition, $rank(A) = 2 $ and A is not an invertible matrix.
So due to the fact that A is not invertible, the product of PAQ is not an invertible matrix?

Thank you!
@Chris are P and Q supposed to be 3 x 3 matrices?
@tb, like the symmetry group of the cube?
@DavidWheeler exactly. There's a nice book by Humphreys on them.
@Chris If A is not invertible then PAQ won't be either. unless P is 2x3 and Q is 3x2
14:01
@tb : We are not given any more information. :/
@robjohn: Is there any link that I can use as a source?
@Chris the same question that tb asked. Are P and Q supposed to be square matrices?
if so, then $\det(PAQ)=\det(P)\det(A)\det(Q)$
@robjohn: We aren't given any more information about P and Q matrices :S
Most probably they are, but if you're not given any more information then the correct answer is "it depends". For instance if P = [1 0 0] and Q = [1 0 0]^T then PAQ = [7] is invertible.
However, if $P$ is 2x3 and $Q$ is 3x2, then $PAQ$ would be 2x2 and might be invertible.
well, for an easy counter-example if P,Q don't have to be square, let Q be 3x1 and P be 1x3, with Q = $e_1$ and P = $e_1^T$
14:05
@robjohn I leave that to you, robjohn. You said you need to brush up on your algebra :)
then PAQ(x) = 7x
@tb Linear Algebra is fine :-p
if P,Q are 3x3 however, no le-go-go
@DavidWheeler Since $\det(A)=0$
or, put another way, rank(A) = 2, means the null-space has dimension 1, so some non-zero vector gets zapped.
it's rather hard to invert a zapped vector, we have too many pre-images to choose from
14:10
so... let's have mercy on Chris :)
should 0 go back to 0, or the zapped vector v? i can't decide...i'm....ill-defined...
@Chris if that's all the information you're given, you'll have to write out TWO answers: one saying it's impossible if P and Q have to be 3x3 (and saying WHY), and another saying it IS possible if P,Q don't have to be 3x3 (and give an example).
@Chris So, you determined that A has rank two (I haven't checked). Since $\operatorname{rank}(AB) \leq \min{\{\operatorname{rank}(A), \operatorname{rank}(B)\}}$ you can conclude from this that $\operatorname{rank}{(PAQ)} \leq 2$. This tells you that $PAQ$ can't be invertible if $P$ and $Q$ are $3\times 3$-matrices. You're absolutely right about that.
yeah it has rank 2, row 3 is row1 + row 2
right.
and row1, row 2 are LI
14:14
I tend to forget about numbers as soon as I'm given more information :)
well the exact numbers aren't important right? just the dimension of the row space/or column space
because we could fiddle with the numbers by multiplying a row by something (except 0, because that's just...not...fair!)
@tb: The only choices that we are given to answer and prove are " a. There are P and Q matrices and b. There aren't any " . I think that P and Q matrices should be square and that this $\det(PAQ)=\det(P)\det(A)\det(Q)$ would be a good proof that PAQ matrix is not invertible.

@DavidWheeler: What does "no le-go-go" mean? :P
I got what you said here " let Q be 3x1 and P be 1x3, with $Q = e_1$ and $e_1^T$" :)

Why is that " rank(A) = 2, means the null-space has dimension 1, so some non-zero vector gets zapped" ?
Does anyone know how to make a list in matlab with all the positive integers from 1 to n ?
14:19
a mathematician and his buddies were playing poker. when the night ended, they started arguing over how to split the pot on the table. the mathematican pushed all the bills on the the floor. "well," he said, "the homogeneous case has a solution."
I know I can use a for loop, but I would like to avoid doing this.
@Chris "no le-go-go" is just slang for "that will not work out" (or as we say here in texas: "that dog won't hunt").
$\left[
\begin{array}{ccc}
1 & 0 & 0 \\
0 & 1 & 0
\end{array}
\right]
\left[
\begin{array}{ccc}
7 & 2 & 3 \\
10 & 5 & 6 \\
17 & 7 & 9
\end{array}
\right]
\left[
\begin{array}{cc}
1 & 0 \\
0 & 1 \\
0 & 0
\end{array}
\right]
=
\left[
\begin{array}{cc}
7 & 2 \\
10 & 5
\end{array}
\right]
$
@Chris there is an important result in linear algebra, called the rank-nullity theorem
@N3buchadnezzar something like x = 1:1:n? or look up linspace
14:22
it says that the rank of a matrix, plus its nullity equals the total number of columns
the nullity of a matrix is the dimension of its null space
^ which is the same as the $\dim{\ker{A}} + \dim{\operatorname{im}{A}} = \cdots$ equality Chris used earlier on.
we have 3 columns, and rank 2, so that leaves 1 left over for the null space.
yes rank(A) = dim(im(A)) as well
I was taught this identity under the name "dimension formula for linear transformations".
but that's just a translation from German.
@DavidWheeler: Oh, thank you for clearing this out.
Isn't the nullity of a matrix equal to 0? (I will have to look for this at our book)

@tb: Will do now!

@robjohn: Which is invertible!
it's actually the first isomorphism theorem in the arena of vector spaces
14:26
I wouldn't have understood "rank-nullity theorem" a year ago.
@Chris the nullity of a matrix is the dimension of its kernel
@Chris while 0 is IN the null space, it's not always the ENTIRE null space
null space = kernel
okay, gotta go bbl
@tb and @DavidWheeler: Thank you for clarifying this " null space = kernel ", I will keep that in mind!
Bb t.b.! Thank you for your help!
for your example matrix A, we have A(1,4,-5) = (0,0,0) even though (1,4,-5) isn't the 0-vector.
by linearity, every vector of the form (x,4x,-5x) also gets sent by A to (0,0,0).
and since rank(A) = 2, those are the only vectors A sends to 0. {(1,4,-5)} is a basis for the kernel.
linear algebra is cool like that, everything works out so clean
14:43
How did you find the (1,4,-5) ? //Got what you mean though!

So all in all, the answer would be something like this:
* if $P, Q$ are $2 \times 3$ and $3 \times 2$ respectively then $PAQ$ matrix is invertible

* if $P, Q $ belong in $R^{3x3}$, then $det(PAQ) = det(P) \times det(A) \times det(Q) = 0 $ as $det(A) = 0$.
Then $PAQ$ is not invertible.
15:07
@Chris the way i found the vector (1,4,-5) was solving the 3 simultaneous equations: 7x+2y+3z = 0, 10x+5y+6z=0 and 17x+7y+9z = 0, just like you normally would.
@Chris by the way, PAQ is not necessarily invertible for ANY 2x3 and 3x2 matrices (for example, the 0-matrices would be poor choices)
@DavidWheeler: OK, this means I have to take a break :P
So after all I believe that P and Q matrices belong in $ R^{3x3}$. Is there any source for this $det(PAQ) = det(P) \times det(A) \times det(Q) = 0$ ? (like wikipedia?)
sure..look up "determinants"
15:26
@DavidWheeler and @TylerBailey Thank you :)
Whoa, that scared me
haha, i may have to turn the ping sound off ;p
hahah :p
15:46
@Chris Yes, which was the point :-)
@robjohn:
For this $det(PAQ) = det(P) \times det(A) \times det(Q)$ to be valid/ legal, should matrices P, A and Q be of the same dimension?
@Chris For the $\det$ to make sense, the matrices must be square
@Chris For $PAQ$ to make sense, $P$ and $A$, and $A$ and $Q$ must have at least one dimension in common
The end result is that all have to be square matrices of the same dimension
@robjohn: Got it, so for the det to make sense it should be:
$ 2 \times 3, 3 \times 3, 3 \times 2$ ?
@Chris $\det(PAQ)$ makes sense, but you can't take the determinant of $P$ or $Q$
since they aren't square.
@robjohn: the $det(PA)$ and $det(AQ)$ make sense?
15:57
@Chris No, because $PA$ is $2\times3$ and $AQ$ is $3\times2$
@robjohn: So the matrix of the product must be square!

Also, something irrelevant, is there any way to add the username recommendations without having to click on it? In example when I click "@rob" I get the "robjohn" above the textbox, is there any way to select this using only the keyboard?
@Chris to take the determinant, a matrix must be square
@Chris I am not sure what you mean by "username recommendations".
@robjohn : indeed!

About the irrelevant question, just found it...using tab
I did it and it seems to be $$ (1 + (x + x^{-1}))^n = \sum_{i = 0}^n \sum_{j = 0}^i {n \choose i} {i \choose j} x^{2j - i}$$
So the coefficient of $x^k$ (where $k = 2j - i)$ turns out to be $\frac{n ! }{(n-i)! j! (i - j)!}$
But if I can't write down the coefficient as a function of $n$ and $k$ my answer seems rather useless.
Username recommendation is that when I type "@" and start typing your username, a small box with your username above the textbox appears..
16:04
@MattN You are working on $(x+1+x^{-1})^n$?
@robjohn Yes, I'm thinking about my answer here.
@MattN I am not sure that is the answer to the question being asked...
Since his question seems to view 1+1+0 the same as 1+0+1
"By distinct I mean that the number of 0s, 1s, and -1s of two solutions must be different."
The two I gave above have the same number of 0s, 1s, and -1s.
Oh. Grrr. Thank you. When I read n-tuple I automatically assumed (1,1,0) \neq (1,0,1).
@robjohn You're right. And of course I can still think about the other case : )
@MattN Indeed
yes. why do you think it was deleted?
16:16
Ignore me. : )
I assume you're correcting and then undeleting?
It seems she's happy with the comment.
nah, I'm reading wikipedia and listening to youtube
I've answered two moderately hard questions in two days, and gotten two upvotes in those two days. One of the upvotes was for an old answer. Weird weekend.
Must be your scary avatar that scares them away before they get to vote.
@robjohn: Is there any way to upvote in chat? :P
I can't be sure, but I think while I was robjohn I got fewer votes.
16:20
@anon wouldn't surprise me :-)
@Chris You can upvote him on the site.
@Chris there are no upvotes in chat. You can star a comment
One more answer and you've contributed 500.
@MattN I know. I was looking for a good question to be number 500 :-)
@MattN I can upvote at the site, only through an answer he gave, right?

@robjohn: Will have to star a lot of comments then ;)
16:23
@Chris No you can also upvote his question.
@MattN I think he did. I just got two upvotes on some pretty old answers :-)
That was me : )
@MattN Oh :-) Thanks!
Welcome : ) It's a thank you for when you helped me with PDOs.
(a second thank you : ))
Bbl : )
On a completely different note: can we please not suggest to people to star answers to questions they asked here?
3
while the stars rarely make much sense it would be nice to see at least one message that is either funny or remarkable otherwise...
16:43
Sorry for that. I thought it was something like upvoting
@Chris: no need to apologize :) It is nice of you to show your appreciation!
i star random comments by tb, just for the sheer hell of it
3
i also lie a lot
oh, so you were one of those smiley voters?
I am using chat for about a month and still learning :)
if i were to ask the other knave which message i starred, what would he say?
16:48
^ sphinx
can't we just have robjohn arbitrarily wipe stuff periodically for no good reason?
@tb on 3 legs! bingo!
Are it just the students at my institution or is complex analysis hard to grasp? They need to compute an integral over the real line and they compute and integral with a large circular contour around the poles.
Many of them do.
Voila, you have your real integral for some reason.

« first day (613 days earlier)      last day (4703 days later) »