« first day (1284 days earlier)      last day (4032 days later) » 

00:00
@balarka welcome to the real world
@BalarkaSen: are you letting Ted get to you? Don't let people get in the way of math.
@JasperLoy Indeed
@JasperLoy and I missed the whole thing.
Well, I don't know the exact context, but never mind, it's over and it's a small thing.
Not to me :(
@BalarkaSen concentrate on the friendly people.
Not to me either :(
00:02
I tried to stop it. But was too late
@robjohn I don't see whom are and whom are not. Nevermind, I need to get some sleep now.
Anyway @skull I was quite upset when you said "maybe you don't want it to happen", but never mind.
@BalarkaSen sleep well and wake happier.
Sure. But I'll stay in the forums from now on.
@jasper I'm sorry.
00:04
@robjohn I spent a ton of money on hardback versions of my nine holy books, but I am happy that I got them.
@BalarkaSen do what you feel you have to.
At least they are all friendly
@JasperLoy cool
@skullpatrol It's alright now, pal.
and stay in math
00:04
@BalarkaSen as long as you think so.
@robjohn Do you know what happens if the amazon delivery guy comes to my home and nobody is in?
@BalarkaSen I would not let one bad day affect me so much, but that is me.
@balarka I am going to join you in staying away
@JasperLoy It depends on the situation. If you can tell them not to require a signature and your front door looks secure, they should leave it.
@robjohn Well, what if I don't tell them anything? I hope they don't put the precious books outside, because someone is gonna take them away!
00:09
@JasperLoy Ah, if where they would leave them does not look secure, they may hold them. It depends on who actually delivers them (FedEx, DHL, UPS, etc)
@robjohn My friend told me that they would leave it at a post office and drop a note for me to collect it, but I don't trust this friend's words usually.
I'm sorry @jasper for saying such a mean thing pal.
@skullpatrol It's OK. =)
It's not OK
@JasperLoy I have no idea what your postal service is like
00:13
@robjohn OK, I guess I will try to be around that day and I will ask the man what he would do if there was nobody.
@JasperLoy sounds like a good plan
@JasperLoy Did they give you a tracking number?
@robjohn Well, there is an order number, and there is a place I can click which says "track packages".
@JasperLoy that will probably send you to the carrier's website and enter the tracking number
@robjohn did you get a B.S. in Mathematics from ucla?
@robjohn OK, this is the first time I ever ordered anything online, using my mum's credit card since I don't have one.
00:17
@Ethan yes
it says under major CAS for me at ucla
oh
@Ethan If I were you living near UCLA I would definitely go there for both undergrad and grad, it's a great choice.
@Ethan is that for math, or something else?
math
loool you can get banned for saying strong words
?
00:18
@user4140 It has always been the case.
Guess I'm lucky I'm a gentleman
But if I say fuck me, probably nobody would flag it.
@Ethan It could be for the school: "Communication Arts and Sciences"
gota finish that
mabye somebody will flag you.
00:19
@user4140 if enough people flag you. So it depends on who listening in the room
I didn't even finish their testing by the required deadline, so I'm still sort of confused
I would have like to go to UCLA, unfortunately I'm too ugly to go there.
@user4140 What has it got to do with looks?
They have a strict policy.
no people below 8.5 iin the hotness scale.
I'm 8.4
remember to add a photograph looking sharp
@user4140 I can tell you for sure that that is not the case.
00:22
thats exactly what my picture is right now
haha
seriously?
lol no they pool together all the pretty looking applicants and deny everyone else
tell me one single person below 8.5 that got in.
hotness can come from the voice too.
@user4140 Don't confuse @Ethan lol.
@user4140 so you're saying they graduate supermodels and phonesex operators?
00:24
lol
@ethan Too many removeds.
no, they already are that when they go in.
@robjohn he is saying they graduate hot and smart students
@ethan I think UCLA will be one of my choices if I apply.
@JasperLoy great
00:25
sure, just make sure you get a nice haircut before the application.
@JasperLoy good lol if i end up going there, also did UChicago and some other LAS's
and practice that deep voice.
It needs to come from the lower abdominal wall.
My voice is very deep.
I like singing Italian opera.
just make sure you don't do soprano stuff
@JasperLoy
got like 7 hours'
00:27
They usually go for the tenor, for their male grad students
@Ethan OK, go for it.
but cases of baritones and countertenors have been recorded
@user4140 Are you on drugs, lol.
@JasperLoy I have to list adults who I look up to or who can speak on my behalf
4 of em*
00:29
For example Terence Tao came in with a voice barely lower than jazz. But they attribute this to his sharp looks.
@PedroTamaroff Hi
Just make sure if they speak on your behalf they speek using a low, confident voice
@Ethan You may start with your family members and your teachers.
who is duke?
@JasperLoy can't do family members already did the 1 teacher who knows me, and I did dan brum and eric naslund
@Ethan Geezis, Dan and Eric? You should use people you know in real life.
this guy?
@JasperLoy I have had google+ hangouts with em if that counts
@user4140 bam there u go
00:31
@Ethan OK, so 1 more person to go, lol.
you know barry white?
nvm he's dead
because they listed 7
uhm bb king will do
@user4140 lol a recuriter at my school handed out a pamflift there was a picture of him writing some crap about seive theory on a whiteboard on it
00:34
@JasperLoy He knows nothing about math, though. =P
@PedroTamaroff I wonder why he calls himself a theoretical physicist. Has he got a PhD?
@skullpatrol
@JasperLoy Hardly believable.
@ethan You only have a few hours left, hurry!!!
@JasperLoy Look at this awful answer.
STAHP ETHAN.
@JasperLoy alright wait can I list you?
00:36
I used to think I was too old for mat, but really who cares it's a marathon not a short race, the way I see it if you live a healthy life you might even have more years to do math.
@user4140 ;)
@user4140 lol don't think like that
why not
?
because it really doesn't mean anything
@PedroTamaroff Looks awful.
00:37
what doesn't?
@Ethan Well, you may, but I am only a banana.
well I mean you can't really compare yourself to others
what do you mean?
nvm
i don't know anything
well sure, every person is unique and whatnot, but you should still agree that Terrence Tao is better and math than you, atleast today.
what do you think about this assertion?
00:39
there really is so much stuff out there
Who cares about Terry Tao? Care about yourself first!
yes, of course I agree looking at things like that is wrong.
besides there are plenty of burn outs
But there is still a part of me I cannot shut down that desires skill.
nvm dnt listen to me i dnt know anything
00:41
I know I should look at it like, I'm doing math, this is fun, I don't care if I'm learning to add.
@JasperLoy can I talk with you in a seperate chat
@Ethan I suggest we use email...
anyways, can someone help me with a problem I have?
let G be an abelian group of order n with k|n. Prove G has a subgroup of order k using complete induction...
I don't know fundamental theorem of finitely generated abelian groups.
@JasperLoy emailed u
any help?
00:45
@user4140 You need Cauchy's theorem, that's all.
The result is trivial for G=1 or G of prime order, so you may assume G is (nontrivial) of composite order.
ok
hmmmm
And assume the result true for every group of order less than G.
Now, pick a prime factor of G and obtain a nontrivial element of order p.
sure
@Ethan OK, I replied, we'll continue talking there for a while.
Say this element is x, then take the quotient by <x>.
You get an abelian group of order less than G, strictly.
Should I say more?
00:48
no, thanks
did you read dummit and foote?
Yeah, I am reading that book and Hungerford.
Reading Hungerford right now.
makes sense
What does?
that problem, you answered it like he proves cauchy for abelina groups
Oh, well you can extend Cauchy for any group using the class equation.
00:52
yes
but that's how he does it for abelian
he proves both
In fact you can prove Sylow's first theorem in in full using the class equation.
Which is the generalization of Cauchy's theorem.
And the proof is exactly the same.
@user4140 Here.
That is really sweet.
Yeah, I agree.
Cya guys, gotta work out, does triceps need hardening.
those?
"does" sounds for like "das"; i.e. the German "das Auto"; say.
@anon
@Alizter Hello.
01:03
@PedroTamaroff
you there?
Yes.
This is dog.
If you think I've taught you things, and if it involves nothing that binds me legally to another thing, go ahead.
no nothing like that
Just don't put this chat as a reference! =)
no reference all gone haha
which uni do you go to?
I already did jasper, naslund and brum
i trust you guys more then any of my math teachers lol tho i already used them
I attend the University of Buenos Aires.
(UBA)
01:09
was it hard to go there? it says "It is currently the best ranked Argentine university in college and university rankings" on wikipedia
don't students over there do like some huge test
to decide which uni's they go to
Well, not a test, but you need to pass the CBC, which is kind of a filter.
Anyone can attend, foreigners included. But you need to work, surely.
holy crap 300,000 undergrads
what do you graduate with like a bachelors degree?
No, the careers lasts 6 years, so a bit more than that.
oh wow
how long have you been there?
You can start a PhD after you finish.
No MSc needed.
01:14
but the PhD would have to be there?
Nope.
(I don't think so, at least.)
whats it called?
Maybe you can ask Mariano when he comes by.
@Ethan What is what called?
the degree you earn for 6 years
I'd say it's equivalent to a Bachelor's + Masters, maybe?
01:16
youve been there for more then 4 years?
@Ethan Two years.
oh
"In Argentina, the Licentiate degree (Spanish: Licenciatura), by which one becomes a licenciada (female) or a licenciado (male), is a four- to six-year degree.[4] This may become six years in some cases, under the accomplishment of the "licentia doctorandi" thesis dissertation, generally equivalent to an M.Sc. or M.A. in North American universities, or Master in any country of Europe given by the Bologna Process.
I have a dissertation, hence 6 years.
So there you go.
02:08
I still can't believe that where I studied is ranked 9 in the world for math last year. ^
@JasperLoy Well, kudos for that man.
@PedroTamaroff I now prefer hardbacks to softbacks like you, though they are very expensive.
Ram
Ram
Hi All, how to prove that torsion sub group of H_{n-1}(X) is cyclic of order 2, where X is n dimensional pseudomanifold? Massey leaves it to the reader, but I couldn't
@JasperLoy I sometimes buy softbacks, and if I like the book, make it hardback =)
@Ram No idea! =)
@PedroTamaroff How do you make it hardback?
02:16
What's up. Can somebody refresh my memory on the actual definition of the Euclidean Algorithm? That is, if $a>b$, $gcd(a,b)=gcd(b,?)$
what is the ? supposed to be?
@JasperLoy There are people that do that.
@agent154 Do a google.
Ram
Ram
@PedroTamaroff, :(
@agent154 $\gcd(a,b)=\gcd(a,b-ka)$ for any $k$.
@JasperLoy I tried and couldn't find what I was looking for
02:17
Thus, $\gcd(a,b)=\gcd(a,b\mod a)$.
. EXAMPLES CAN BE FOUND BELOW, E.G., IN THE "Matrix method" SECTION. --> In mathematics, the Euclidean algorithm, or Euclid's algorithm, is a method for computing the greatest common divisor (GCD) of two (usually positive) integers, also known as the greatest common factor (GCF) or highest common factor (HCF). It is named after the Greek mathematician Euclid, who described it in Books VII and X of his Elements. The GCD of two positive integers is the largest integer that divides both of them without leaving a remainder (the GCD of two integers in general is defined in a more subtle...
@JasperLoy I did see that, but I wasn't in the mood to read that wall of text to find what pedro told me. I know how to apply the algorithm on paper, but I am trying to code it into c# for a Project Euler question and didn't know what to put. But thanks anyhow
02:37
@robjohn
@PedroTamaroff yes?
I have a cool problem to solve.
And maybe you can help.
@PedroTamaroff okay
Consider $[-n,n]^3$.
I want to count lattice points $(x,y,z)$ such that $|x+y+z|\leqslant s$, where $s$ is another positive integer.
Well, not count.
@PedroTamaroff you mean $x,y,z\in\mathbb{Z}$?
02:40
Rather prove there are $$\frac{1}{2\pi}\int_{-\pi}^\pi D_n(t)^3D_s(t)dt$$ points where $D_k$ is the Dirichlet kernel $$\sum_{|j|\leqslant k}e^{ikt}$$
@robjohn Aha.
Okay. I would consider looking at the Fourier Transform the integral
What is the other "side"?
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?

Is this asking for the least common multiple? Just want to make sure I understand the question.
You want a number such that $1,2,\ldots,20$ divide it, or additionally that the quotient is even?
It just must divide without remainder
02:47
Ah, then (of course) you're looking at the LCM.
=)
I thought that $\frac{1\cdot 2\cdot 3\cdots 20}{gcd(1,2,3,\dots,20)}$ would be what I'm looking for, but that doesn't seem to work as $gcd(1,2,3,\dots,20)=1$
I suppose if I remove the primes from consideration in the GCD function, that would work
hello folks
@PedroTamaroff I have to go get dinner for people. I will have more time for this later. You know that the Fourier Transform of the Dirichlet Kernel is points on a line, right?
BBL
@Mike HAI
MAIK
@agent154 Nope.
I just took a nap but now I'm just as tired as when I started.
02:59
@Mike Heh, that happens.
@PedroTamaroff what am I missing then?
I'd like to do this without resorting to doing prime factorization of the number
the power of love, no doubt
Unless my algorithm for the GCD is wrong, I seem to be getting 1 no matter what...
@agent154 $\text{lcm}(a,b) = \frac{ab}{\gcd (a,b)}$
but the issue is that this fails spectacularly if you try to generalize to more than two numbers.
@agent154 $1\cdot 2\dot 3$, $4$ has already two but once, so $1\cdot 4\cdot 3$, six is already there so stop, $1\cdot 4\cdot 3\cdot 7$, eight has two but thrice, so $1\cdot 8\cdot 3\cdot 7$, &c.
03:02
But what about $lcm(a,b,c,...,n)$? Can that same formula be used? It's not working for me
=D
Also, $\gcd(a,b,c)=\gcd(a,\gcd(b,c))$
@Mike Dude.
I like $\bf Cats$.
@PedroTamaroff Yeah, i've got the right GCD algorithm. I'm using a recursive algorithm to solve the GCD of 1 thru 20.
I like the animal, categories are pretty chill too.
but I suppose I didn't know that the LCM of more than 2 numbers can't be done this way
@agent154 You want the LCM, not the GCD.
03:03
But I had assumed that I needed the GCD to get the LCM.
@Mike I think I am getting the hang out of it.
I like using diagrams instead of words.
@Pedro Here's another reason Fld is terrible: there's no free elements.
$\Bbb Q$ ain't free in $\bf Grp$.
Course not.
${\rm hom}(\Bbb Q,S_3)=1$.
03:05
The free AbGrp objects are pretty easy to classify (especially if you have the structure theorem); the free Grp objects are easy to classify once you figure out what they are :p
@PedroTamaroff is $lcm(a,b,c)=lcm(a,lcm(b,c))$?
@agent154 What do you think?
I'm tempted to say yes, since this applies to GCD as well, and GCD and LCM seem to be closely related. I don't know of a proof though
@agent154 They are dual concepts, but be careful.
You either find a counterexample or prove it.
03:21
@Mike
@Pedro
@Pedro Lord no, but I think you just realized that.
What is a different way of saying there is one and only one morphism $I\to C$ with $I,C$ objects in a category, i.e. saying $I$ is initial?
A was looking for a statement in terms of ${\rm hom}(I,C)$.
@Pedro Is this for a specific problem? Or just an idea?
I would just say "I is initial".
03:25
Well, I was thinking silly maybe, but say when $R,R'$ are rings, ${\rm hom}(R,R')$ is iso to stuff. =P
Well, we have a lot more structure in the category of rings than we do in an arbitrary category.
In general, we can't do stuff like add morphisms. All we can do is compose them.
So $\hom(A,B)$ is usually just a set :P We get all our cool monoids when we talk $\hom(A,A)$.
03:32
Yes, that I was sure.
=)
yeah those triceps
well now they aren't triceps
they are metal slabs
tungsten
in case you where wondering

« first day (1284 days earlier)      last day (4032 days later) »