« first day (1764 days earlier)      last day (3553 days later) » 

r9m
r9m
00:00
@Chris'ssistheartist :)
I will go to sleep now. Good night!!! :)
Hello!! Could someone take a look at my question:
0
Q: How do we get this solution of the differential equation?

Mary StarHow do we get the following solution $$\overrightarrow{h}(t)=\underline{R}(t, \overrightarrow{\xi}(\overrightarrow{x}))\overrightarrow{h}(0)$$ (where $\underline{R}(t, \overrightarrow{\xi}(\overrightarrow{x}))$ is the matrix of transformation as for $t$ around the axis $\overrightarrow{\xi}(\over...

?
@MaryStar :)))
@user159870 jasper?
@KarimMansour No.
00:04
:-) @user159870
Do you have an idea about my question? @user159870
No, but I hope someone who knows lets you know ;))
I hope that too!! @user159870
:-)
@MaryStar What is it from?
I am reading some notes on fluid mechanics right now... and I came across this equation...
@user159870
@@MaryStar :))
00:09
Do you study maths? @user159870
@MaryStar Of course I do :))
Nice!! :-) @user159870
Yes :)) @MaryStar
How would you describe yourself? @MaryStar
Hmmm... difficult question...
how would you describe yourself? @user159870
@MaryStar Hmmm... difficult question... :P
00:12
i dont describe myself , my solutions describe me :)
@Agawa001 See my solutions and you will know who I am , lol. :)))
i said pevious pic u post , and made false statement about who u are , sory for that :p
? @Agawa001
u seem to have rich luggage in ur profile
:)
Sorry guys, I have to go now. We had a nice conversation @MaryStar @Agawa001 @KarimMansour
00:16
Bye!! See you!! @user159870
my question is still answered , it stands resistive to all community
welcome to stackexchange communities @Salsabil
oh i forgot, new members cant speak :(
good luck gathering reputation
time to have some nightmares
by
 
1 hour later…
01:33
how would I show that the integral int_1^d x^(-a) (log x)^b converges or diverges?
I think I need to use some form of comparison test, like this question/answer, but I'm really stuck as to how:math.stackexchange.com/questions/950557/…
@Michael do you mean as d->infinity?
cause your integrand is bounded on [1,d]
@anon yes, as d -> infinity
Sorry, I forgot to include that.
as a rule of thumb, logs are negligible compared to powers, so test for the convergence of x^(-a) and then try to transplant that result into your situation
01:49
@anon I know that the integral from 1 to infty of 1/x^p is convergent if and only if p > 1, i.e. -a < -1, right?
right
indeed whatever b is, (log x)^b / x^a will eventually be bounded above by x^epsilon / x^a for any epsilon>0
(or you could get a lower bound if you want). exploit that
To show what's in the second statement of your chat, I need to show that eventually, regardless of what b is, (log x )^b < x^epsilon?
02:05
mmhmm
02:29
@anon but how does that work? if b = 1 and epsilon is extremely small, the statement doesn't hold, right?
yes it does
that powers swamp out logarithms is a very important fact to know in any kind of asymptotic analysis
(log x)^b < x^epsilon is equivalent to log x < x^(epsilon/b)
write u=x^(epsilon/b) so this is equivalent to log(u^(b/epsilon)) < u
which is equivalent to C*log(u)<u
which is equivalent to log(u)<u/C
ohhh, that makes sense.
write v=u/C so this is equivalent to log(C*v)<v
which is equivalent to D+log(v)<v
and so on
that makes a lot of sense.
Morning
M T
M T
02:35
and then for the case a = 1, the comparison test with 1/x^a doesn't help us because the integral from 1 to infty of 1/x diverges because it's the log x
which sums to infinity
if you want the background, my book includes this question (math.stackexchange.com/q/1308866/93114) (I didn't ask the math SE question) and it stumped me.
the hint in the book matches the answer, i.e. a = 1 and -2 < b < -1, but I'm having trouble confirming that
it seems pretty clear to me that I need a function of the form (x^(-a) |log x|^b)^(1/p), because then when q = p, it reduces to the function x^(-a) |log x|^b, which is what I was trying to show above, or at least a piece of it
03:08
Morning everyone.
It's been pretty quiet for a while.
Okay, how do I show that $(\Bbb R - \{0\}, \cdot)$ and $(\Bbb C - \{0\}, \cdot)$ are noniso?
useful group invariant: # of elements of a given order
one can use such invariants to distinguish many groups
$(\Bbb Z/p_1p_2\Bbb Z)^{\ast}$ has $(p_1 - 1)(p_2 - 1)$ elements, right?
(For prime $p_1$, $p_2$)
@anon okay, I didn't know that.
03:24
@SohamChowdhury yes
@SohamChowdhury I was giving you help on your question. Do you know how to use this group invariant to distinguish R^* and C^* ?
@anon let me think.
Oh, yes.
how?
Did you do the one on $(\mathbb R, +), (\mathbb C,+)$? @SohamChowdhury
well, those are isomorphic...
The number of elements with order 4?
03:26
@anon Why did you ruin the fun :(
@SohamChowdhury sure. R^* has no elements of order 4, whereas C has 2.
$i$ and $-i$.
Right.
In fact, $\Bbb C^\times \cong e^{\Bbb R} \times S^1$ whereas $\Bbb R^\times \cong e^{\Bbb R} \times C_2$
$e^{\Bbb R}$?
my notation for the set of positive numbers under multiplication
03:29
So $e^{\Bbb R} = \{x \in {\Bbb R} | x > 0\}^{\ast}$?
to see why, consider the polar form of complex numbers
Did I understand your notation correctly?
yes
I think I get why.
every complex number is uniquely an element of $e^{\Bbb R}$ times an element of $S^1$
that's polar form
03:32
Every nonzero complex number can be written as (positive real, angle). (polar form)
Each angle is a point on $S^1$.
Each nonzero real is a positive real times a sign ($C_2$).
Well, that's interesting.
@anon correct?
yes
Wow, that is really cool.
Is $\Bbb Q$ also something similar? (I don't have any good intuition for these :/)
$\Bbb Q=\Bbb Z^{\oplus\Bbb N}\times C_2$
well.
that'll take me a while to grok.
every rational is a sign times $2^{e_2}\cdot 3^{e_3}\cdot 5^{e_5}\cdot 7^{e_7}\cdots$ with all but finitely many of the exponents zero
(the exponents of course can be positive or negative)
so perhaps you could write it more suggestively as $\Bbb Q^\times=C_2\times\bigoplus_p p^{\Bbb Z}$
but oplus tends to connote addition instead of multiplication, and $C_2\times\exp\left(\bigoplus_p \Bbb Z(\log p)\right)$ is too fancy
03:38
okay.
why rationals?
(I don't know much abut quaternions so maybe I should just shut up)
4 mins ago, by Soham Chowdhury
Is $\Bbb Q$ also something similar? (I don't have any good intuition for these :/)
you asked about rationals, I talked about rationals
Yeah.
Rationals?
Morning
I meant quaternions :P
quaternions are denoted $\Bbb H$ in honor of Hamilton
03:40
Oh, I understand your rationals example perfectly now.
2 mins ago, by anon
so perhaps you could write it more suggestively as $\Bbb Q^\times=C_2\times\bigoplus_p p^{\Bbb Z}$
I get this.
I meant $\Bbb H$, then. Does that have any such "factorization"?
but yes, $\Bbb H^\times\cong e^{\Bbb R}\times {\rm SU}(2)$
that involves more explanation
that will take me some time to get.
Okay, so $\text{SU}(2)$ is iso to the group of quaternions of norm 1. (Wikipedia)
The other bit is easy to understand, once I get this.
@anon?
yes?
how can I show that no element of $\Bbb Z/15\Bbb Z$ can have order 8?
lagrange's theorem
03:48
don't have that yet.
write down the meaning of "$x\in \Bbb Z/15\Bbb Z$ has order $8$"
(or even "has order dividing 8")
$8$ is the least number $n$ such that $nx = 1$?
we're in an additive group
write the condition additively
in particular all you need is the fact that $8x\equiv 0$ mod $15$
which means $15\mid 8x$
always always unpackage the meaning of statements
3
what can you deduce from $15\mid 8x$ using elementary number theory?
gcd(15,x) = 1
I mean, no
@anon 15 divides x
but gcd(15, x) = 1 because x $\in$ Z/15Z
@SohamChowdhury um, what?
you seem to confuse $\Bbb Z/n\Bbb Z$ and $(\Bbb Z/n\Bbb Z)^\times$ a bit
03:52
$15 | 8x \implies 15 | x$
No, this is $(\Bbb Z/n\Bbb Z)^{\ast}$. Didn't I mention that?
5 mins ago, by Soham Chowdhury
how can I show that no element of $\Bbb Z/15\Bbb Z$ can have order 8?
:(
so? what do I do?
you know $U(15)$ has order $\varphi(15)=(3-1)(5-1)=8$. if it had an element of order $8$, it'd be cyclic isomorphic to $C_8$ which has a unique element of order $2$. verify that $U(15)$ has more than one element of order $2$, hence cannot be iso to $C_8$.
35 mins ago, by anon
useful group invariant: # of elements of a given order
:)
okay, but what does "cyclic isomorphic" mean?
did you mean "cyclic, and isomorphic"?
yes, "cyclic, isomorphic"
03:58
11 and 4? oh, okay.
right, 4 and -4
how do I do this for $(\Bbb Z/pq\Bbb Z)^{\ast}$ in general? (prime $p, q$)
same idea :-)
similar argument?
oh.
in fact if you know ring theory you can prove $Z_{pq}\cong Z_p\times Z_q$ as rings, hence $U(pq)\cong U(p)\times U(q)$
04:01
not yet.
04:23
is there a word for when the inverse of a bijective "homomorphism" between some objects is also a homomorphism
e.g., this is satisfied for groups but not topological spaces (continuous map = homomorphism I guess)
that's basically the definition of an isomorphism in a concrete category
04:43
@anon, about that problem: how do I show that $(\Bbb Z/pq\Bbb Z)^{\ast}$ has order-2 elements that are not $pq -1 $?
14 is also order 2 in Z/15Z.
yes, that's -1
sun-ze, aka chinese remainder theorem, essentially
pick an inverse r for q mod p, then consider (p-1)qr
that might be a bit technical for where you're at, but I don't know what technology you have available
what would I need?
I know some elementary NT, but not a whole lot
also, about that invariant that you were talking of (number of elements of a certain order): what does the operation of taking products do to that?
err, you can't use (p-1)qr anyway, I'm stuck thinking coordinate wise in the ring instead of the group
@SohamChowdhury $(x,y)\in H\times K$ has order $n$ iff ${\rm lcm}(|x|,|y|)=n$
so if $o_d(G)$ counts the elements of order $d$ in $G$, then $o_n(H\times K)=\sum_{{\rm lcm}(a,b)=n}o_a(H)o_b(K)$
why, do you know that $U(pq)\cong U(p)\times U(q)$?
yes, prime p, q
ah! should have said so.
What are the elements of $H\times K$ of order 2, given the elements of $H$ and $K$ of order 2?
04:55
well, $o_2(H\times K) = o_1(H)o_2(K) + o_2(H)o_1(K) + o_2(H)o_2(K)$
and since $o_2(H) \geq 1$ . . .
yes
the elements of $H\times K$ of order 2 are of the form $(h,k)$ where $h\in H$ and $k\in K$ are both either identity or order 2 (and not both the identity)
so if $h\in H$ and $k\in K$ have order 2, then $(h,e_K)$ and $(e_H,k)$ both have order 2
say $S\subset \Bbb R^{\Bbb N}$ is the set of all strictly positive sequences of reals. Supposedly the sequence $(1, 1, ...), (1/2, 1/2, ...), (1/3, 1/3, ...)$ of elements of $S$ doesn't converge to $(0, 0, 0, ...)$. I can't see why not though.
$o_2((\Bbb Z/pq\Bbb Z)^{\ast}) = o_2((\Bbb Z/p\Bbb Z)^{\ast}) + o_2((\Bbb Z/q\Bbb Z)^{\ast}) + o_2((\Bbb Z/p\Bbb Z)^{\ast}) o_2((\Bbb Z/q\Bbb Z)^{\ast}) \geq 3?$
anyone have any idea why?
@anon is that right?
04:58
@SamuelYusim doesn't converge in what topology? the product topology?
@SohamChowdhury yes
(note you're using the fact p,q>2)
yes.
good catch. I have a feeling that $o_n(G)$ thing is going to be very helpful with a lot of things.
@anon yeah, I figured that was implied but I guess not
@SamuelYusim it does converge in the product topology. it also converges pointwise.
ah, I seem to have missed the part where they want me to use the box topology. I'll think about it on my own again then
you can pick a box around (0,0,0,...) that doesn't have (1/n,1/n,1/n,...) for any n
care to take a stab?
05:03
how's about $(-1, 1) \times (-1, 1/2) \times (-1, 1/3) \times \dots$
or (-1,1) x (-1/2,1/2) x (-1/3,1/3) x ... for symmetry, but yeah
I get the feeling, though, that this one example won't help me show that no sequence of elements of $S$ converges to the 0 sequence
actually, I retract that. of course it will
:-)
it's like the diagonal argument
the which?
the diagonal argument for showing [0,1) is uncountable, using decimal expansions
(with the slight problem that reals can have up to two decimal expansions)
05:09
@anon, tell me a nice/systematic way to show that $\mathrm{Aut}(\Bbb Z/2\Bbb Z \times \Bbb Z/2\Bbb Z) \cong S_3$. I have no clue where to start apart from listing homs to find which are isos.
I think you said something about considering generators, but I can't remember properly.
suppose $[0,1]=\{x_1,x_2,x_3,\cdots\}$ and $x_1=0.x_{11}x_{12}x_{13}\cdots$ and $x_2=x_{21}x_{22}x_{23}\cdots$ and so forth are the decimal expansions. then construct $y=0.y_1y_2y_3\cdots$ with $y_i\ne x_{ii}$ for all $i$, so that $y\ne x_1,x_2,\cdots$ hence $y$ is not in the list.
I don't have many tools yet.
@Samuel: link if you haven't heard of it before.
yeah I've seen that, I just didn't immediately make the connection that it was that
@anon: including the proviso that no infinite string of 9s is allowed at the end?
also, can you help me with the aut question?
can you see how $S_3$ acts on $C_2\times C_2$?
it permutes the three nonidentity elements.
05:13
yes, but how do I get a proof of this fact?
oh, wait.
all elements of $S_3$ have inverses, so each of them is a bijective hom.
verify directly that all permutations of the nonidentity elements are automorphisms in this case
fun fact: $C_2\times C_2$ is the only realizable "natural" permutation group besides alternating and symmetric groups
i didn't get you.
For example, consider the permutation that swaps (0,1) and (1,0) but leaves (0,0) and (0,1) unchanged. Verify this is an automorphism.
05:27
in $C_2 \times C_2$?
hmm.
yes, i've verified that.
indeed if $a,b$ are any two nonidentity elements of $K_4$ (this group is called Klein four) then $K_4=\langle a,b\rangle=\langle a\rangle\times\langle b\rangle$
So if $c,d$ is any other pair, we have an isomorphism $\langle a\rangle\times\langle b\rangle\to \langle c\rangle\times\langle d\rangle$
which we then can note is an automorphism $K_4\to K_4$
there are exactly 6 ordered pairs of distinct elements, so there are at least 6 distinct isomorphisms here
which is an upper bound too, so these are all automorphisms
(that's the abstract way to go about the problem)
you can of course just directly verify that all six permutations of nonidentity elements are automorphisms
wait, i'm parsing all that you said.
I have to g2bed anywho
okay, thanks for all the help.
05:48
What is $\Bbb E$?
Just starting a textbook called 'Basic topology' by Armstrong, and it seems $\Bbb E$ is defined as a Euclidean space, is this just alternative naming to $\Bbb R$?
I mean $\Bbb R$ usually has standard Euclidean structure
@Examin5days in a topology course, it makes to make the topology explicit
so it makes sense to me for it to mean R^n with the typical topology
or rather, R
So saying $\Bbb E\implies \Bbb R$ but $\Bbb R\;\not\!\!\!\!\implies \Bbb E$?
I mean that if they say $\Bbb E$ I can think of it as the standard real line, but if they say $\Bbb R$ they may have given it a different topology?
okay, is there anyone here who can help with finding the aut of $(\Bbb Z/p\Bbb Z)$? (prime p)
I don't know what automorphisms are
hey, Sayan.
05:56
Hello,Soham
They are self homomorphisms, or self isomorphisms?
@Examin5days the latter
Well $\Bbb Z / p\Bbb Z$ is a field
where $p$ is prime
I don't know about fields yet.
A field is a multiplicatively invertible (commutative) ring(with identity)
05:57
Woo....... @Soham You done with continuity?
I know that $\mathrm{Aut}(\Bbb Z/p\Bbb Z) = (\Bbb Z/(p-1)\Bbb Z)$, but I have to prove that.
Can you give me an example of finding the automorphisms of a simpler group?
Yeah, like it's $S_3$ for $Z/2Z \times Z/2Z$.
But I can do that by hand.
$S_3$ is all permutations of two elements?
three*
@Rememberme Eto $\epsilon-\delta$ kore kore I'm good at those now. :)
@Examin5days three non-id elements.
05:59
Well I mean definition of continuity in topology@Soham
yes.
more or less.
The open ball definition
yes.
$f^{-1}(\text{open set}) = \text{open set}$?
I have not done anything after that since I am on a break...
@SohamChowdhury How are these isomorphic?
06:01
$S_3$ is the aut of that group.
Hmmm can you explain that to me if you have time?
it's a simple by-hand verification
I mean what it means to be an automorphism of a group
I thought it meant the two things were isomorphic, but $S_3$ isn't isomorphic to $\Bbb Z_2 \times \Bbb Z_2$
an aut is an isomorphism from a group to itself
the set of all auts of a group is itself a group
Did you forget a $\Bbb Z_2$?
06:04
it's denoted $\mathrm{Aut}(G)$.
Did you mean for $S_3$ it's $\Bbb Z_2 \times \Bbb Z_2 \times \Bbb Z_2$?
So $S_3 \cong \mathrm{Aut}(\Bbb Z_2 \times \Bbb Z_2)$.
That's an exercise in my book.
@Examin5days nope.
What book is this? I find it weird you don't know fields but you know this stuff
Fields are later.
@Examin5days groups are more often than not introduced before rings and fields
06:06
True, but I have done group theory, but haven't done automorphisms
then you didn't do enough group theory :)
Puh >.<. Probably
@Examin5days Z/pZ is the simplest group besides the trivial one
Sure I know most things about that group
But I haven't dealt with automorphisms
in fact ${\rm Aut}(\Bbb Z/p\Bbb Z)=(\Bbb Z/p\Bbb Z)^\times$ in a canonical way @Soham
06:08
how?
every automorphism must be of the form $1\mapsto x$ ....
$\Bbb Z/p\Bbb Z$ is a field when $p$ is prime, since $p\Bbb Z $ is a maximal ideal of $\Bbb Z$ when $p$ is prime, etcetc. It's an abelian group under addition for non-prime $p$, it's an abelian group under multiplication when $p$ is prime - else it is a monoid under multiplication
@anon nope, I don't understand.
The book says this: $\mathrm{Aut}(\Bbb Z/p\Bbb Z) = (\Bbb Z/(p-1)\Bbb Z)$
which is equivalent to what I said
where the hell is Balarka
06:10
every automorphism of Z/pZ is determined by where 1 is sent
conversely the map x->nx is an endomorphism of every abelian group for every integer n
because it generates everything else?
yes, if 1 goes to x, then 1+1 goes to x+x, and so on
the only question is what does 1 have to go to in order to define an automorphism?
1?
that can't be right.
then nothing happens at all.
06:13
Ok I see now, there are six elements in $S_3$ and there are six isomorphisms of $\Bbb Z_2\times \Bbb Z_2$
huh?
1 goes to 1?
that's the identity automorphism, which is one of them
Linear algebra question: I know that $A = QQ^{T}$ ($A$, $Q$ square matrices) is positive definite if and only if $Q$ is invertible for every choice of $Q$. Since the product of invertible matrices is invertible, would it be safe for me to say that $A = QQ^{T}$ is invertible if and only if $A$ is positive definite?
06:16
i'm not getting this. then 1 can go to any element, which makes the number of automorphisms . . . p? it should be $p-1$, right?
and even if I get the number of automorphisms, how do I show that they are all $\cong C_{p-1}$?
@SohamChowdhury can 1 go to 0?
knowing that (Z/pZ)^* is cyclic requires some serious work
oh.
yes. that's the next exercise.
there is no canonical generator of the Aut group btw, unlike Z/(p-1)Z, so iso'ing them is not very natural
06:18
But I only have to show that $Aut(C_p) \cong C_{p-1}$. I don't have to show that $Aut(C_p) \cong (Z/pZ)^*$.
$(Z/pZ)^*$ is cyclic is a different exercise (the one I posted a pic of right now).
what are all of those things in brackets at the end? they look very important...
Yes :)
but, my question is, do I first have to do this to show that $Aut(C_p) \cong C_{p-1}$?
Showing ${\rm Aut}(\Bbb Z/p\Bbb Z)\cong(\Bbb Z/p\Bbb Z)^\times$ is easy, but showing $(\Bbb Z/p\Bbb Z)^\times\cong\Bbb Z/(p-1)\Bbb Z$ is harder and is basically the content of that image you just posted
can't I bypass the $(Z/pZ)^*$ bit and directly show that $Aut(C_p) \cong C_{p-1}$?
if there were, then $(\Bbb Z/p\Bbb Z)^\times\cong\Bbb Z/(p-1)\Bbb Z$ would be easy to show just by inserting ${\rm Aut}(\Bbb Z/p\Bbb Z)$ in the middle
but it's not easy
06:23
okay.
and there is no natural isomorphism ${\rm Aut}(C_p)\cong C_{p-1}$
I'll do that exercise then.
the one I posted.
0
Q: Is it true that $A = QQ^{T}$, $Q$ a square matrix, is invertible if and only if $A$ is positive definite?

ClarinetistI know that $A = QQ^{T}$ ($A$, $Q$ square matrices) is positive definite if and only if $Q$ is invertible for every choice of $Q$. Since the product of invertible matrices is invertible, would it be safe for me to say that $A = QQ^{T}$ is invertible if and only if $A$ is positive definite?

@Clarinetist hint: Q invertible iff QQ^T invertible
$A = QQ^{T}$ positive definite $\Longleftrightarrow$ $Q$ invertible $\Longleftrightarrow$ $Q^{T}$ invertible $\Longleftrightarrow$ $A = QQ^{T}$ invertible
@anon ?
06:31
I was suggesting
($Q$ invertible $\Rightarrow QQ^T$ invertible), and
($Q$ singular $\Rightarrow QQ^T$ singular) implies
($Q$ invertible $\Leftrightarrow QQ^T$ invertible)
thus $QQ^T$ pos def $\Leftrightarrow Q$ invertible $\Leftrightarrow QQ^T$ invertible.
@iwriteonbananas is coming and going in search of Balarka. :P
Ah, that makes sense. Thanks @anon
Is there something called the flat torus ?
sure, R^2 mod a lattice like Z^2 is flat. it can be embedded in 4+ dimensions, e.g. the Clifford torus
flat torus? uh?
your usual mental picture of a torus (a donut) is not flat, since at any point it's got nonzero principal curvatures. but there are flat tori if you consider it abstractly or else embed it into higher dimensions.
Where did you get that from ?@Soham
ty @SohamChowdhury
ty = thank you
06:40
so the flat torus comes from a non-euclidian space
no
hi - off topic: as a conformal map, does it make sense to take the square root of the plane (to get to the upper half plane) or does it make more sense to take the square root of the slit plane (with a slot from $[0,\infty)$?
as I said, it's a quotient of R^2 and can be embedded into R^4.
oh, ok
@TheSubstitute sqrt cannot be continuous on the plane
the standard branch excises (-inf,0] from C
06:44
@anon I have a plane slit from $[0,10]$. I want to get to the upper half plane. Can I take square root there or should I extend the slit to $[0,\infty)$?
@anon I thought it was $[0,\infty)$. Isn't that what is used in the last step of the answer to <http://math.stackexchange.com/questions/1162754/conformal-mappings-dealing-with‌​-slits> ?
sorry, don't know how to post links correctly here
@TheSubstitute the sqrt function cannot be continuous on any region in C containing a circle around the origin
@TheSubstitute no the standard branch is (-inf,0] not [0,inf) and yes [0,inf) is used in the last step in that answer
one can use other branches too, and the word "standard" appears nowhere in that answer
although [0,inf) is probably the second-most standard
@anon what are the other branches? infinite rays emanating from $0$?
it's just really weird leaving log and roots undefined on reals, since they started out being defined on reals
@TheSubstitute you could also do crazy spirals if you wanted
@anon cool gonna look that up. thanks for clarifying.
@SohamChowdhury hahah
@SohamChowdhury is tracking my comings and goings in this chat
damn stalker

« first day (1764 days earlier)      last day (3553 days later) »