« first day (2440 days earlier)      last day (2595 days later) » 

7:01 PM
So I did miss some.
(10,25) , (11,28)
 
uhh
those arent solutions
 
nah.
It doesn't work.
Okay give me a hint meowmix.
 
Factoring
 
Hm.
(2x+y)(2x-y)
 
Dodsy that's trivial
 
7:04 PM
What is?
trying to find with proof all integer solutions to $4x^2 - y^2 = 15$
 
Dodsy oh that's hard sorry thought that was something else :(
 
It is pretty trivial from here
 
OK, Dodsy, so think about what you just typed ... and the 15 on the other side.
 
Okay @TedShifrin
$(2x+y)(2x-y)=15$?
 
So what do you conclude?
(Assume $x,y\ge 0$ for starters.)
 
7:09 PM
Well I've find that when $x=sqr(5)$ then $x=y$.
found&
 
No. Working with INTEGERS.
 
Hm...
 
How do you factor 15?
 
You find the square root?
 
NO. Come on!
You're back in 4th grade.
 
7:11 PM
Integers!
 
haha, do you mean the numbers which divide 15 evenly?
like 3,5,1,15
 
$15=1\cdot 15$ or ...
 
Oh!
So the numbers in the brackets have to add up to these numbers
 
I'm not sure what that means.
 
Can I tag along as we go back to 4rth grade? I got an exam in 3 days and I'm struggling proving a trivial direct proof.
 
7:13 PM
like $(2x+y)$ = 15, $(2x-y)$ = 1
 
Yes
 
Right ... OR $2x+y = $? and $2x-y = $?
 
5 and 3, -5 and -3, -15 and -1.
Right?
 
Staying with positives, I said.
 
Oh.
then 5 and 3.
 
7:14 PM
Right, or $2x+y=5$ and $2x-y=3$.
So work with these two possibilities ...
 
Huh...
 
EITHER $2x+y=15$ and $2x-y=1$ OR $2x+y=5$ and $2x-y=3$.
 
$2x = 5 - y$ $2x = 3 + y$
$5-y=3+y$?
 
What are you doing?
 
Absolutely no idea.
 
7:17 PM
Oh, the second one.
Isn't there an easier way to combine the two equations and get rid of one of the variables?
 
Oh yes.
we can add them
So that 4x = 8
and x would equal 2
 
And y?
 
then we can input it into our original equation to find that y = 1
 
Right ...
And in the case of the first pair of equations?
 
x = 4 and y = 7
 
7:19 PM
Done.
 
But that's not a proof
I've already figured that out.
 
It absolutely is a proof.
 
@Dodsy There's no other pairs of integers multiplying to 15...
 
Unique factorization. The only ways you can factor 15 are ...
 
@TedShifrin What is the difference between a pole and essensial singularity , i mean intuitivly ?
 
7:19 PM
So I was missing finding the factors of 15 then?
 
@Dodsy Ted is a very good proffesor so Id trust his words =p
 
@Kasmir: In terms of the Laurent series, finitely many negative terms versus infinitely. In terms of behavior of the function, mapping to a neighborhood of infinity versus mapping all over the plane.
 
I am just saying that I already found those solutions, that's all.
 
But you've now proved they are the only possible ones, @Dodsy. That's a big deal.
 
yeah that's true.
 
7:21 PM
@TedShifrin Okay thanks ! that was what I wanted in terms of Laurent =p
 
When you are asked to "solve" an equation (or a bunch of equations), you want an "if and only if" statement, not a "these work but I dunno who else does" statement.
 
@Dodsy Keep this in mind, people screw up these arguments a lot. Might show only one direction of a set inclusion argument, or one inequality, etc
 
@Dodsy OK, did you think about the convex functions one?
 
Zach, leave that alone.
 
leaves it alone
 
7:23 PM
Especially since you're so bad about following up on all the things you're supposed to do for me ...
 
LOL so sassy
 
Can someone help me prove this really quick? I started by getting its contrapositive. I got $(3 \nmid x) \rightarrow 3 \mid(x^2 -1)$
Not sure where to go from here
 
Think about what happens when you square things in mod
 
$3 \nmid (x+1)(x-1)$
 
Oh actually that's clever
 
7:27 PM
Therefore, $3 \mid x$
 
(The symbol is \nmid)
 
Do you see why @Dragneel?
 
Hmm give me a minute
 
Demonark: Most likely Dragneel doesn't know modular arithmetic yet.
 
I do, but haven't had much practice with it yet
 
7:30 PM
Hint: any three consectutive numbers contain a multiple of three
 
Yea I don't really see what happened here
 
(ex: 14,15,16 — 15 is a multiple of three)
 
OK, that's another way to do it, then. But Zach and Akiva are leading you a direct route.
 
(another example: 22,23,24 — 24 is a multiple of three)
Why must any three consecutive numbers contain a multiple of three?
Also, hi everybody!
 
Hi, DogAteMy.
 
7:32 PM
Because one of them is a multiple of 3
 
Hi @AkivaWeinberger
 
It contains a multiple of 3 because one of them is a multiple of 3?
 
I just had a 40 minute BP game
 
By the way, Zach, it's a beautiful day out (assuming the weather hasn't changed since I was last out)
You don't even need a jacket
 
Yeah, I went on my bike earlier this morning
 
7:33 PM
I'm addressing this to you because I assume you're having roughly the same weather as I am
@MeowMix Nice
 
Lol I should like, actually leave my room
But also I should do this paper that I'm staring at
 
I played chess with Nate this morning too
 
It's 75 degrees in Chicago, according to Google
 
I meant because one of them is divisible by 3
 
@Dragneel Thats what being a multiple of 3 means LOL
 
7:35 PM
But why would it be true for any sequence of three numbers
 
Okay I don't know how to explain it -_____-
 
@Dragneel Well, let's look at it like this
Let's say we have our number $x$ and we want to prove that either $x$, $x+1$, or $x+2$ is divisible by 3
 
@Dragneel Does it make sense that it should be true, though?
 
In the case that $x$ is, then our argument is finished
 
Because you have n+1,n+2,n+3 ?
 
7:36 PM
In the case that it isn't, divide it by 3
We'll either get a remainder of 1 or 2, right?
 
The convex function one seems hard
 
correct
 
If it's a remainer of 1
Then look at $x+2$
That must be a multiple of 3
do you see why?
@Dodsy BTW, a function is convex if it's second derivative is always positive non-zero
 
@TedShifrin thanks for helping me with that Ted.
Hm alright
 
@Dodsy I'd recommend first drawing it out
 
7:38 PM
I think so. If it has a remainder of 1, then you simply need to add +2 to get a remainder of 0?
 
And they intersect infinitely many times meaning they represent the same function?
 
Yeah @Dragneel
 
Draw two curves that have convex graphs and interect countable infinitely many times
No, they can't be equal
 
@Dragneel And if it has a remainder of 2…?
 
Okay that makes sense they just intersect over and over again?
 
7:39 PM
@Dodsy Yeah.
 
You add 1
 
@Dragneel So therefore, if we have an $x$, then at least one of the following: $x$, $x-1$, $x+1$ must be divisible by 3
 
And if it has a remainder of 0, then it's the multiple of 3
 
Correct?
 
("It" being the smallest of the three consecutive numbers)
 
7:40 PM
correct
 
So any three consecutive numbers have a multiple of 3.
 
So, we have that $3 \nmid (x-1)(x+1)$
 
@MeowMix I think I know your convex tangents thing
 
Therefore, neither $x-1$ nor $x+1$ are divisible by 3, right?
@AkivaWeinberger Do tell!
 
which means x is divisible by 3
 
7:41 PM
But it won't be the largest convex set inside the loop.
 
@Dodsy Also, they have to constantly be growing faster
 
I think I get it now
 
@AkivaWeinberger Yeah I realized that while in my bed, unable to sleep
 
For example, the complement of the tangents of a smoothed thickened H-shape is the empty set.
 
But this isn't true in all cases though right?
 
7:42 PM
@Dragneel Whaddya mean?
 
So they are exponential functions such as x^4 and x^2
 
Wait nevermind. This is an implication.
 
2 things, Nate
1. Neither of those are exponential
2. Possibly?
 
Well their second derivatives are 2 and 12x^2
Both positive
And they do intersect countably infinitely times
 
$12x^2$ isn't always non-zero
Uhh, no they don't
 
7:43 PM
Oh true
 
$x^2$ and $x^4$ intersect once.
 
@MeowMix I think it has to do with four facts: (a) that the complement of a union is the intersection of the complements; (b) the complement of a line is two disconnected convex sets; (c) the intersection of two convex sets is convex; and (d) the shape you're looking at (the complement of the tangents) is connected
Well, (d) I don't know how to prove formally
 
@Dodsy $x^2$ looks like a good starting point
 
but I think that combining them will tell us that the complement of the tangents has to be convex.
 
So, draw out $x^2$ on paper.
 
7:45 PM
@MeowMix Thrice. $\pm1$ and $0$.
 
Oh, heh
Actually, thrice
 
Derp edit
 
no worries I was about to correct you as well :)
 
But, whatever, they can't be polynomials
 
Uhh
Well, they can't both be
 
7:46 PM
'cause if they were, their difference would have infinitely many roots, and the only such polynomial is 0
@MeowMix That's what I meant
 
so then we just need a similar function which is compressed horizontally by a certain factor
 
@Dodsy Noooooo
 
Oh
 
Draw $y=x^2$ out on paper
 
Done!
 
7:47 PM
You want the two curves to intersect lots of times
 
Now, I want you to try and draw a function that intersects infinitely many times with it.
In order to do that, your other function will sort of have to "interweave" between $y=x^2$
So draw that out
And make sure the derivative is everywhere increasing
 
What about like x^2 + 2 is that not allowed
 
That wouldn't intersect infinitely many times
Infact, never at all
 
Hm
 
Draw it out
 
7:50 PM
So what it will be like a horizontal sine curve or something?
 
Hmmm, perhaps
 
Vertical
 
But we want it to interweave with $y=x^2$
How do we make it to that?
 
@MeowMix Here's a topology problem, involving path-connectedness and (what I can only assume would he called) polygon-connectedness
The circle $S^2\subseteq\Bbb R^2$ is path-connected, but not polygon-connected,
 
@Dodsy I was thinking something like this:
See how it "interweaves"?
 
7:53 PM
because no two points can be joined by a sequence of line segments contained in the circle.
Define a space to be polygon-connected if any two points can be joined by a finite sequence of line segments.
@MeowMix So, clearly, the circle example shows that path-connectedness is not the same as polygon-connectedness. Can you show that, for open subsets of $\Bbb R^n$, that they're equivalent?
 
So wait
Huh?
 
That is, for any path-connected open subset of Euclidean space, you can join any two points with a polygonal path.
 
I can join two points in a circle with line segments
Unless you mean the actual circle
 
@MeowMix Not line segments that stay inside the circle.
 
Not the disk
 
7:55 PM
The circle, not the disk
The disk would be polygon-connected
Also, I wrote $S^2$ where I meant $S^1$
 
I'm going to think about it during the 5th annual nap of Zach
 
That's… not a whole lot of naps
 
hmm
One second
trihectosexdecaquintannual nap
Why did I bother finding those prefixes when I could have just said "daily"
Anyways, off for my trihectosexdecaquintannual nap.
 
uhhh
It sounds really weird when you're mixing latin and greek numerals
 
8:12 PM
Hi Zach, Akiva
 
hi @astyx
 
Hi again @Alessandro
 
Can I ask you another probability thing?
 
You can always ask, I'm not sure I'll be able to answer
 
I have a random variable $X$ which has a standard normal distribution and another variable $Y$ defined as $Y=\begin{cases} X\quad \text{ if }-1\le X\le 1\\ -X \quad \text{ if }|X|>1\end{cases}$. I'm asked to show that $Y$ is also a standard normal and then to discuss $X+Y$
I showed that $Y$ is standard normal by showing that $\Bbb P(Y\le t)=\Bbb P(X\le t)$ and that part is fine
however for $X+Y$ I think I get a variable which is $0$ on $(-\infty,-1)\cup (1,+\infty)$ while a sum of Gaussians should be a Gaussian
 
8:18 PM
Is it not : "A sum of independant Gaussians should be Gaussian" ?
 
ohhh, of course
derp
 
:)
 
I'm having trouble with this consider the sequence: $S_{n+1}=\frac{1}{3}(s_n+1) for \, n \geq$ $S_1 = 1$. I essentially have to prove s_n > \frac{1}{2}


I'm attempting this through induction


I've got so far $P(N) = S_{1+1} = \frac{1}{3}(1 + 1) \, S_{2} = \frac{1}{3}(2)$ $\frac{2}{3} > S_n$


After establishing my base case I attempted do this for $P(n+1)$


$P(n+1) = S_{n(n+1)} = \frac{1}{3}(S_{n+1}+1) for \, (n+1) \leq 1$


^ Is this correct
I Feel like something is missing here
 
Is that a big $S_n$ instead of $s_n$ in the recursion formula ?
 
@Astyx yes
@Astyx sorry for the bad latex
 
8:22 PM
And third line is $P(2)$ ?
 
@Astyx yes I belive so
 
What is $P$ ?
 
$P(N)$ is the base the case
$P(n+1)$ is our extended case
 
What do you mean by that ?
Hi @Liad
 
@Astyx since $P_n$ is true then it should follow that $P_{n+1}$ is true
That's essentially what I established there
 
8:25 PM
But what is $P_n$ ?
 
The base case @Astyx do you want me to relatex this
@Astyx see here:
I'm having trouble with this consider the sequence: $S_{n+1}=\frac{1}{3}(s_n+1) for \, n \geq$ $S_1 = 1$. I essentially have to prove $s_n > \frac{1}{2}$


I'm attempting this through induction


I've got so far as $$P(n) = S_{1+1} = \frac{1}{3}(1 + 1) \, S_{2} = \frac{1}{3}(2) \, \, =\frac{2}{3} > S_n$$


After establishing my base case I attempted do this for $P(n+1)$


$$P(n+1) = S_{n(n+1)} = \frac{1}{3}(S_{n+1}+1) for \, (n+1) \leq 1$$


^ Is this correct
 
@ShaVuklia I believe what they meant by this $=\infty$ is simply that the sequence diverges. It is indeed a typo, it should be $\lim_{n\to \infty}ax^{n+1}$. However you said something wrong : we do not need the limit not to equal 0, we need the sequence not to converge (it could converge to 2 and that would make our statement false)
 
@Astyx hi
 
@Zophikel I think you are misunderstanding what $P(N)$ is, especially since you are writting $P(n) = S_{1+1}$. First of all what is $n$ ?
 
someone here familiar with the $K-$topology ?
 
8:30 PM
No I
 
Where is Ted :P
 
@Astyx sorry for the typo but essentially the for all n, n+1 would be true. also $n \geq 2$ should be in the top of the post sorry
 
@Liad Probably hiding from you ... :p
 
hehe
 
That does not answer my question @Zophikel. Can you explain to me how induction works ?
 
8:32 PM
well i got to go , see ya @Astyx
 
Bye !
 
@Astyx yes
Induction works by establish a case where P_n would be true and then it should following that P_(n+1) is true
Speaking form intuition it's like domino's falling
 
And ..?
You're missing something very important
 
@Astyx what i'm I missing
 
You need the base step
 
8:34 PM
@Astyx ahh ok
@Astyx I actually established my base case before performing the inductive step
 
So for instance you have a property $P_0$ and you know that for any $n\in\Bbb N$, $P_n \implies P_{n+1}$, induction allows you to conclude that for all $n\in\Bbb N$, we have $P_n$
 
@RubénBallester in his web page Fernando Chamizo (Universidad Autónoma de Madrid) has a lecture notes on topology, I hope that it help you. Study and learn mathematics is very difficult. Is not required a response of this message, good luck.
 
So what is your base step here ?
 
@Astyx the base step is this:$$P_1 = S_{1+1} = \frac{1}{3}(1 + 1) \, S_{2} = \frac{1}{3}(2) \, \, =\frac{2}{3} > S_n$$
 
No, we don't have $P_1 = S_{1+1}$
In fact $P_n$ is the property $S_n \gt {1\over 2}$
 
8:38 PM
Hi, bye, hi @Akiva.
 
@Astyx all right
 
^
So what is $P_1$ ?
 
@Astyx I think I see the initial mistake
@Astyx would it be $P_1 = S_{n+1} = \frac{1}{3}(1+1)$
?
 
No, reread what I wrote two messages ago
 
$P_1 = S_{2} = \frac{2}{3} \, > S_n$
@Astyx sorry latex error
 
8:42 PM
Still not
 
@Astyx what is it
 
Just that $S_1 = 1 \gt {1\over 2}$
 
@Astyx how did you get that ?
 
Get what ?
 
$S_1 = 1 \gt {1\over 2}$
 
8:45 PM
Well you wrote that $S_1 = 1$. And obviously $1 \gt {1\over 2}$
 
ok nvm sorry ]
 
Salut, @Astyx.
 
Salut Ted
Liad te cherchait quelques messages plus tôt
Pour parler de K-topologie ou quelque chose comme ça
 
Quoi que ce soit ...
 
Sinon tu vas bien ?
 
8:48 PM
Il ne faut plus me demander ça ...
 
Comment ça ?
 
Parce que je suis toujours malade ... :(
 
Tu as vu ton médecin ou toujours pas ?
 
Oui. On m'a dit d'attendre ...
 
C'est assez bon signe non ?
 
8:51 PM
Beaucoup de monde me disent qu'il faut attendre 2 ou 3 mois ... :(
 
Ne laisse pas ça abattre ton moral en tout cas ! On est toujours là nous :)
 
@Astyx for reworking it out $P_{n+1} \, => S_{n(n+1)} = \frac{1}{3}(S_{n+1}+1) for \, n \leq 1$ S_{n+1} > \frac{1}{2}
 
LOL, merci.
 
Isn't Liad in a point set topology class?
 
yup
 
8:53 PM
Tu passes toujours en Juin ?
 
Any luck finding contact solution, @MikeM?
 
Why the hell are they doing K-spaces?
 
Oui, @Astyx.
 
Nope. RIP contact.
 
No, no. I assume this is the compact complement topology or something, @MikeM.
 
8:54 PM
I had to squint at some of the talks today.
 
@Zophikel That's not the way to go. You need to suppose $P_n$, not $P_{n+1}$ for a start
 
@Astyx note that the n in $n \leq 1$ should $(n+1) \, \leq 2$ and finally this initially implies that $S_{n+1} > \frac{1}{2}$
 
@Ted Ok, much better.
 
@Astyx all right sorry my mistake
@Astyx so to fix my solution we start from $P_n$ and then do $P_{n+1}$ correct sorry for the mistakes I have a hard time chatting about this
 
Super @Ted
 
8:55 PM
I can't see the blackboard from any magnitude of distance unless I'm smashed to it
but eh, whatever. glasses are heck of a pain
 
I realized when I got to UGA at the age of almost 30 that I was getting headaches trying to read the blackboard during someone else's lectures. So I went to an opthalmologist and got glasses.
 
i don't wear mine... maybe i should. don't want my eyes to break or something
probably
 
The less you use your glasses the better your eyes stay, IMHO
 
orly?
 

« first day (2440 days earlier)      last day (2595 days later) »