« first day (1414 days earlier)      last day (3611 days later) » 

8:00 PM
@TedShifrin It is a $K_9$-.
It is being $2$ colored.
I've asked it on main.
Graph theory will be the death of me.
 
Ah, so I don't need to waste any brain cells, then.
Nah, you'll get the knack of it. You like combinatorial stuff, so you'll be a pro.
Probability will be my death in a few months :D
 
I failed the first midterm. I really need to straighten up for the second one.
 
Failed, seriously? Or is this your usual hyperbole?
 
Nope, I did fail.
 
And most of the class did well?
 
8:02 PM
I don't know. Some passed, some failed. It wasn't too hard of a test.
I just handled it poorly.
Anyways.
 
It's a different mindset — but compared to the analysis and algebra you love to do, this stuff isn't that bad.
 
I like the course.
It is just that there is a lot of content.
 
Reading on, is it possible the meant and regarding the red and blue subgraphs?
 
Good. :)
 
Would make sense with the or later on, regarding the adjacent of the vertex
 
8:03 PM
And one needs to be used to certain thinking.
 
going to look on main
 
But eitherway, as far as I can tell, if it is or, you are right. Can't figure out why not.
 
8:15 PM
@Pedro: You need to ask Kaj Hansen (a UGA undergrad) who's given some lectures (on YouTube, even) on Ramsey Theory. He answers a lot on main, and I'm confident he should handle this for you.
 
@TedShifrin He doesn't seem to be around.
 
@PedroTamaroff remember when you got me that book a while back
 
@Ethan Which one?
 
(removed)
 
Anyone knows where I can get Bourbaki, Algebra, Chap6, 2012 version online ?
 
8:18 PM
"Mathematical Logic by Joseph R. Shoenfield"
do you think you could get it for me?
 
@r9m This is subject to some new research. If I'm not wrong ...$$ \lim\limits_{n \to \infty} \sqrt[n]{ \operatorname{ LCM} \left( \binom{n }{0}, \binom{n}{1} ,\cdots,\binom{n}{n}\right)}=e$$
 
@Pedro: I messaged him on Facebook.
Heya @Ethan.
 
hi ted
 
r9m
@Chris'ssis $e$ ?! .. irk ,, gimmie some time to think .. :o
 
(removed)
 
8:21 PM
Hi @Ethan
 
@Ethan Got it, gimme a second.
 
@PedroTamaroff thanks
 
@Ethan @r9m posted the question, not me. Well, it is subject to some research ... (from a certain point of view)
 
lol
 
I meant chapter 8, 2012
 
@PedroTamaroff wow how do you get all this stuff lol
anyway thanks a lot
 
@Pedro maybe he means spanning subgraph indeed? That would make perfect sense
 
@Yeah, @Studentmath, but he never says any such thing. I think this is likely to be a badly written treatise.
@Pedro: Kaj is thinking about it.
 
@Ted yeah, it should be made clear. But perhaps it is trivial for the author when he says 'subgraph'. Again, definitions..
 
His examples of $2$-colorings certainly don't obey that requirement, @Studentmath.
 
8:27 PM
He never speaks of subgraphs there. Or does he?
 
He uses the word. Funny, he belabors the pigeonhole principle, but then is sloppy immediately on the next page.
 
@Chris'ssis I got it into this form but I am stuck $$\lim_{n\to\infty}\frac{\prod_{k=0}^{n+1}\binom{n+1}k}{\prod^n_{k=0}\binom nk}$$
 
@Alizter There you have LCM.
 
@Chris'ssis Yes, I know
 
r9m
@Alizter cool .. you got rid of the lcm .. how did you get to this form ?
 
8:32 PM
$$\operatorname{lcm} \hat a=\frac{\prod_{k=0}^n a_k}{\gcd(\hat a)}$$
 
Not, that's not true pal.
 
where $\hat a$ is an ntuple
@PedroTamaroff Why not
 
Try it for $n=3$.
 
Ive been fed lies!
 
@Alizter: We all take it as our mission to lie to you.
3
 
8:35 PM
@TedShifrin lol
 
r9m
scratches head
 
@TedShifrin Kaj is a lefty like me. +1
 
Yes, he is, @Pedro. I know this from his having taken 3 classes from me (and not just from his video).
 
r9m
@Chris'ssis how did you get to the answer ? hints plz :) .. the fact that there is a da** lcm inside the $\sqrt[n]{}$ is taking my life :-(
 
@r9m there is an (useful) formula for $$\operatorname{ LCM} \left( \binom{n }{0}, \binom{n}{1} ,\cdots,\binom{n}{n}\right)$$
 
8:40 PM
@Chris'ssis What's $LCM$ ?
 
least common multiple, @Hippa
 
@TedShifrin ooh
 
I actually don't know that in French :(
 
@TedShifrin $PPCM$
 
et ça veut dire?
 
8:41 PM
plus petit commun multiple @TedShifrin
And yeah, the order of words IS reversed for the last two @TedShifrin
 
hmm, in English word order, not French
 
Don't say that
 
I guess this is no place for French slang.
 
8:42 PM
Don't swear :c
 
r9m
@Chris'ssis should I try to get estimates for highest powers of primes in $\operatorname{lcm} \left( \binom{n }{0}, \binom{n}{1} ,\cdots,\binom{n}{n}\right)$ ?
or is there a cooler alternative formula ?
 
@r9m $$\operatorname{ LCM} \left( \binom{n }{0}, \binom{n}{1} ,\cdots,\binom{n}{n}\right)=\frac{\operatorname{ LCM}(1,2,3,...,n+1) }{n+1}$$ and $\operatorname{ LCM}(1,2,3,...,n+1)$ behaves like $e^{n+1}$.
 
@Chris'ssis Did you see the question about the GCD of all inner pairs on a row of Pascal's triangle? It is actually about $\gcd(n,\binom{n}{k})$, but the answer for the other question is given in the accepted answer.
 
r9m
@Chris'ssis ah .. how to prove that behaviour? :D
 
I have no idea why the formula doesn't work and I want to learn algebra >:(
storms off
 
8:47 PM
@r9m when $n\to\infty$ ...
@robjohn Where?
 
@Alizter what is $\hat{a}$?
 
@r9m prime number theorem?
 
r9m
@Chris'ssis oh nooooooo :-( .. is there no other way except ANTing ? :'(
 
@robjohn nice (+1)
 
@Alizter: What is the LCM of $4$, $6$, and $8$?
Welcome to @Kaj :) @Pedro, meet @Kaj; Kaj, meet Pedro. :)
 
8:53 PM
GTR isn't here today :c
 
@Chris'ssis I only answered the question asked, but the general answer is very similar.
 
Did you send him away, @Hippa?
 
@TedShifrin Shh don't tell anyone :P
 
Méchant garçon. (One of my favorite lines from my favorite Jacques Tati movie.) @Hippa
 
@TedShifrin Old movies :C
 
8:55 PM
As old as I am ... hush.
 
I am leaving now. Be back in an hour or so.
 
See ya, @Pedro. We are convinced that guy is wrong.
 
3
Q: A formula for the least common multiple less than n?

Shivam PatelCan anyone please tell me a exact formula for $\operatorname{lcm}(1,2,3,...n)$ and if its not possible then asymptotic expansion will do.

I need a break since that integral put me down ... (temporarily I mean)
brb
 
@Chris'ssis Killed by a Titan seeking revenge ?
 
@Hippalectryon :-))))))
 
8:58 PM
@Chris'ssis an integral put you down? that doesn't sound like you
 
@robjohn temporarily :-)
 
Surely @Chris'ssis won't admit defeat to a silly little integral.
 
@TedShifrin :D
 
Someone asked me today whether $$\displaystyle\int \sqrt{x+\sqrt{x+\sqrt{x+1}}}\,dx$$ can be done in elementary terms. @Chris'ssis :D
 
9:01 PM
@TedShifrin I asked something like that in the past ... let me see :-)))
 
So no it can't be done
 
Right. I pointed him to Liouville's Theorem and gave him some references.
How did you find that so easily, @Hippa?
 
@TedShifrin I'm magic :D
 
Zut alors.
 
The truth is
 
9:03 PM
(You're not going to censor me on that one, are you?)
 
r9m
@Chris'ssis hugs at Chris's'sis' :-) .. life saver :') .. Chebyshev function is new to me .. :) thanks
 
I was just looking at the Math SO newsletter
And it was on it for this week
@TedShifrin Was this guy just testing you ?
 
@KajHansen I didn't leave.
 
I don't think so, @Hippa. But, not surprisingly, the person who answered that question is my brilliant old friend Robert Bryant (big star in differential geometry).
 
9:05 PM
I'll send him the link.
 
Oh hello @Pedro. I didn't see that @Ted introduced us above. Nice to meet you.
 
@r9m lollll :-) This chat is full of professionals, but sometimes you have the false impression is not like that. Many times I come here with fear and tremble ... :-))) (you never know when you're shot down :-)))) with a tough question)
 
Maybe @Kaj doesn't ping ... too short?
 
@KajHansen Well, it is only a partial meeting. =)
Ross has answered my question.
 
Oh, you have an answer?
 
9:07 PM
I do have ping actually. I didn't realize the sound was from the chat.
 
Well, duh, so this is what we figured. He's tacitly assuming the subgraph is spanning. I wish the **** he'd say such things.
 
@TedShifrin math.stackexchange.com/questions/500589/… for the next level :D
 
Very cool, @Hippa. Again, Robert :P
 
@KajHansen As far is I know, $R(s,t)\leqslant R(s-1,t)+R(s,t-1)$.
But not with a $-1$.
 
@TedShifrin Yeah this problem is really cool ! i'm adding it to my pdf immediatly :D
 
9:10 PM
@Pedro, I'm definitely familiar with the first result, but I could've sworn I saw the "-1" result in the literature somewhat recently. Searching now.
 
@Hippa: Your .pdf? Now you need to learn some algebraic geometry and more :)
 
@KajHansen Nice. My professor didn't prove the strengthened version.
 
@TedShifrin I've got a pdf where i keep track of some exercises i've done/met/...
 
The unfortunate thing is that it doesn't hold in general. It holds only if $R(s-1, t)$ and $R(s, t-1)$ are even.
 
Ah ... "Famous problems I have solved ... or wish I had ..." :D @Hippa
 
9:13 PM
Oh, OK.
 
@TedShifrin I didn't say that xD
 
@KajHansen I have a problem from my professor, that should use Ramsey Theory.
It is as follows.
 
I kept folders in grad school of all the problems I solved while studying for qualifying exams. I still have those, but they're going in the recycle bin soon.
 
@TedShifrin send me a copy first :D
@TedShifrin WRONG LINK started may 16th 2014
 
Given $m\geqslant 1$, prove there exists $n$ with the following property: for any binary $n\times n$ matrix (i.e. of $0$s and $1$s) there is a submatrix of size $m\times m$ such that all either all numbers in its diagonal are equal or all numbers under its diagonal are equal.
 
That definitely has a Ramsey-theory type flavor to it. We can reasonably assume that the smallest such $n$ exists when $m = 2$. Let me see if I can extract any insight.
 
@KajHansen Well, I do have to leave now, but if you figure it out let me know and we can discuss it.
 
Certainly. Nice meeting you @PedroTamaroff
 
Bubye mr @Pedro
@Hippa: I'll have to think of some classic problems to give you ...
 
@TedShifrin :D
 
9:23 PM
The problem is I don't know what you know and what you don't :D
 
@TedShifrin ask me :D
 
Do you know multivariable calculus/analysis yet?
 
Nope
Like, dxdydz ? if so, not in maths
 
Dommage ...
 
Just in physics
 
9:25 PM
Un jour ...
 
What is in your opinion the best application for the isomorphism theorem for rings?
 
Ah, my favorite is the proof that a prime $p=a^2+b^2$ for $a,b\in\Bbb Z$ if and only if $p\equiv 1\pmod 4$. @Alizter
Ironic that I said that since I don't like number theory :) But it's cool.
 
I've got one that's pretty cool but i don't have the proof yet
 
You're doing ring theory, @Hippa?
 
9:28 PM
Prove that you can only partition a rectangle into rectangles of same area with an even number of triangles :D
 
OH, that reminds me of one.
 
@TedShifrin No, it's not in the official PC's program - i like looking at the MP's however, and they study it
 
I think the chinese remainder theorem is pretty cool :)
 
Yes, it is, @Alizter, I agree.
 
@TedShifrin I have been learning about ismorphisms and whatnot today. It took a while to get my head around quotient rings
 
9:30 PM
@Hippa: This is sorta multivariable, but it's very cool. Suppose $f\colon\Bbb R^2\to\Bbb R$ is continuous and $\iint_R f dA = 0$ for every rectangle $R$ with area $1$. Prove that the average value of $f$ on the edges of every such rectangle $R$ is $0$. Then show $f=0$.
It takes some time, @Alizter, but very important concept.
 
sorry for interrupting @MartinSleziak thanks. can yuou tell me how can we optain $(0,1]$ and $[1,2) \in \tau_{left}\cup \tau_{right}$
I cant because my book defined these top. as $\tau_r:=\{R,\emptyset\}\cup \{(a,\infty)|a\in \Bbb R\}$ and $\tau_l:=\{R,\emptyset\}\cup \{(-\infty,b)|b\in \Bbb R\}$ so I think $\tau_{left}\cup \tau_{right}$ units should be like $(-\infty,b)\cup (a,\infty)$
 
It's how you really understand arriving at $\Bbb Q(\sqrt2)$ or $\Bbb C \cong \Bbb R(i)$.
What??!! @lyme
 
@TedShifrin I have noticed that it is really easy to whiz through aa and then get stuck.
 
@Alizter, that's one of the things I love about the isomorphism theorem. It provides a way for looking at quotient rings without having to think about residue classes mod some ideal. That is, provided you are clever enough to think of a homomorphism with that ideal as its kernel.
 
@TedShifrin $\text{d}A=\text{d}x\text{d}y$ ?
 
9:32 PM
Yes, @Hippa.
 
I see a notif. that martinsleziak replied me earlier. Cant I reply him like this?
 
message sent from typewriter 6/18/2014 16:31 $\checkmark$
 
@TedShifrin Oh i've seen that much in multivars then :) i just haven't seen properly (ie in class) multivar derivatives and functions's theory
 
@lyme, Martin is not often in here.
 
will he be informed if he is not in the chat?
 
9:34 PM
Not sure, @lyme. It seems like you pasted a body of text, and it is not parsing correctly in here.
 
@TedShifrin does it matter about $\Bbb R[x]$ or $\Bbb R(x)$ or is it squares for indeterminates and parenthesis for values?
 
no, @Alizter, parentheses mean you make it into a field by taking quotients of polynomials.
 
r9m
@lyme ya sure ... link his last message to your next message (I mean reply to the last message he posted in this room) .. that will notify him :)
 
@TedShifrin Wait... what?
@TedShifrin Never mind. I will get there eventually. I need to crack down on what I am learning now or else I will get no where. :)
 
In fact, $\Bbb Q[\sqrt2] = \Bbb Q(\sqrt2)$ because, for example, $\dfrac1{1+\sqrt2} = \sqrt2-1$.
LOL ... ok @Alizter ... and no more snide comments about hearing me.
 
9:37 PM
@TedShifrin Sorry professor.
 
LOL, just teasing.
 
@TedShifrin i'm sure we could create some awful problem from the multinom's formula :D
 
Not my style, @Hippa ... I don't do discrete math ... although I have to get good at it this fall.
 
Ready for probability @TedShifrin?
 
AGH, no. Wanna help, @Kaj? :D
 
9:39 PM
@TedShifrin Like a polynomial whose roots are the Vapnik-Chervonenkis dimension of a hypergraph of the set of coefficients of the rank n multinom formula :D
^ super idea
 
@TedShifrin Yuck that proof using abstract algebra.
 
i'm gonna be hated for generations if i do that :c
 
Let's just say I'm not signed up for your class for a reason
 
Yeah, @Kaj. You're fed up with me :D
That's a gorgeous proof, @Balarka. You hush.
 
@TedShifrin How does it go (in broad strokes)?
 
9:41 PM
I'll hush ok. Just retorting about grumber theory, @TedShifrin
finite grumber theory is definitely not my thing.
(group + number = grumber)
 
I haven't done math in a while. I'm afraid I've forgotten everything I once knew.
 
@MikeMiller What is 1+2?
 
@DanielF: $\Bbb Z[x]/\langle p,x^2+1\rangle \cong \Bbb Z_p[x]/\langle x^2+1\rangle \cong \Bbb Z(i)/\langle p\rangle$. :D
 
I forgot the answer to that one a long time ago, @Alizter
 
@Alizter, 0 mod 3?
 
9:42 PM
@KajHansen obviously it's mod ?
 
Heya @Mike. You getting old and stupid already?
 
user image
4
@MikeMiller
 
spanks @Hippa
 
@Hippalectryon HAHAHA
 
Oh my goodness @Hippalectryon. That's golden!
 
9:43 PM
I knew this was gonna be useful :D
 
@Hippa: You didn't get the English right!
glares @Kaj
 
@KajHansen Ah, but with some simple inequalities and your result, one can show that $1+2 = 3 \in \mathbb Z$.
 
@Hippalectryon Hey, I was going to link to it.
 
grumbles: I should never have allowed the videos
 
@TedShifrin Don't worry i still have 10+ to watch :D
 
9:44 PM
@TedShifrin Just view it as good publicity!
 
Publicity for what, @Alizter?
 
I can't stop laughing.
 
I won't watch all of them tho, only those i on subjects I don't know already lol
 
@TedShifrin You know, for when you become king of the world?
 
That meme is so cool, @Hippa
 
9:45 PM
Not happening, @Alizter.
 
He's retiring from princedom soon, @Alizter, so no hope of kingship
 
Well, if you haven't had multiple integrals seriously, or differential forms or Stokes's Theorem, there's a lot to learn, @Hippa.
Je vais te tuer, @Hippa ... :D
 
fuis vite!
 
9:47 PM
 
Now I'll get banned for good.
Maybe that's a good thing.
 
:C
Nuu
tammam ulen uzatma ???
 
@TedShifrin Is it obvious that 1-manifolds are smoothable?
I guess it is.
 
@TedShifrin It takes 3 hours to do Fubini's theorem ? i.gyazo.com/cc19eeb68660702f07f0959ed4b683ad.png
 
Nevermind that question.
 
9:54 PM
@Hippa: Proof was about 10 minutes. Lots of examples of the difference between iterated integrals and double integrals existing ... And then examples of switching orders of integration ... starting to visualize 3-D regions.
 
Ooh k
 
Yeah, @Mike, any $1$-manifold is locally just an interval.
You're gonna be lots of trouble, @Hippa, I can tell. Time to put you on ignore soon. :D
 
@TedShifrin I realized. I was trying to figure out why "well, just do it locally, and extend to its neighbors" doesn't work in general, and thinking about it for a bit made it obvious.
 
So you're on vacation now, @Mike?
 
Seriously though, do you have like super quality chalk or boards ? I've never seen that i.gyazo.com/93d8bfbdf7c2b0575d5d3325022a1b48.png it seems like uber quality for a chalk board :3 @TedShifrin
 
9:56 PM
@TedShifrin I was on vacation, now I need to start doing math again.
 
These are new boards, @Hippa. We had our classrooms redone with sliding boards. They're actually not all that great. Wobble and erasure problems.
 
Or else I really will forget all of it.
 
LOL, @Mike. Grad school will put a stop to that in a hurry.
 
@TedShifrin I'm reading a proof that all surfaces are smoothable. It's nice.
 
@MikeMiller If you do @TedShifrin 's meme will haunt you forever
 
9:57 PM
ROFL @Hippa. Merde, alors.
 
@TedShifrin too bad @GTR isn't here, i'm sure he'd have liked that :D
 
I should never have talked to you two.
 
@Mike is more polite: He already owes me one dinner :D
Although I don't remember why ...
 
I thought you lowered that to lunch, @Ted
 
9:59 PM
Aha
 
@Ted: Because I haven't yet stopped asking stupid questions :P
 
Is that what it was?
 

« first day (1414 days earlier)      last day (3611 days later) »