« first day (1628 days earlier)      last day (3397 days later) » 

9:00 AM
Niether meta nor the main site is working for me. (The connection has timed out.) Is it just me or do other people have the same problem?
 
Hmmm. That seems to be the case for me too @MartinSleziak
Interesting that we can still chat.
 
Thanks for the confirmation!
 
Yep, sure thing
 
I am not sure but I think that chat might be on a different server.
 
That must be the case. I can access chat rooms, but none of the SE network sites.
 
9:07 AM
I would point you to Host meta and chat.meta on separate server (found via google) but it would probably not make too much sense now.
 
LOL
Hey there @Ramanewbie
 
hi
what's up
 
Now I'm curious. Somehow Raman here found his way into the chat @MartinSleziak. I guess it could've been bookmarked.
 
SE has some twitter account and Status blog, but nothing is mentioned there.
 
Not much. Just working on a problem set and hanging out in here.
 
9:10 AM
who's the german doctor who search for your answer on wolfram ?
 
Are you talking about Dr. Sonnhard Graubner @Ramanewbie ? hahaha
 
Yeah I think so
 
I refuse to believe that he can pass a Turing test.
 
well, Hippa told me about him without telling his name
 
His answers are pretty bad.
 
9:12 AM
I bet so ...
 
If it says anything, he has twice as many answers as me, but like a third of my rep.
Hey there @Gloria
 
Hi :) @KajHansen
 
guys, what's the problem between TedShifrin and Hippa ?
 
I think Hippa's just a little immature. He's like 14 IIRC.
 
?? What's that ?
"14 IIRC"
 
9:18 AM
14 "if I recall correctly"
Most people at that age are annoying at times :P
 
What do you mean by if I recall correctly ?
 
I mean I can't remember exactly, but he's young.
At any rate, we should probably avoid gossip on the main chat haha
 
Not that young
did you think he was 14 ???
 
Wikipedia: IIRC, an acronym meaning "If I Recall/Remember Correctly"
 
ok now I know
@KajHansen did you think he was 14 ???
 
9:21 AM
Yeah. I think it says on his MSE profile or something.
 
hahaha I know his exact age
He's not 14 !
He might be lying if he told you that..
or just joking
 
Well I could certainly be wrong.
 
you are ^^
 
He lives in France, whereas I'm in the US. So he's usually on when I'm not, and so I don't know him very well.
 
I don't know if he allows me to tell it, but ask him if you want
I live in France too
I'm French I mean
 
9:24 AM
Oh cool. I'm studying French right now in college.
 
That's great
So in the us, it might be ...4am ?
 
LOL, yep. I don't have a normal sleep schedule.
 
I don't either...
 
Is anyone else having problems connecting to main?
 
During the week, I'll sleep from like 5 AM until 9 AM. Then again from 3 PM until 6 PM or some such thing.
Yes @robjohn
 
9:25 AM
yes
it's down for everyone
 
Ah... I have been trying to submit an answer for a long time, and it has not worked.
 
I hate it when that happens.
 
There is nothing on the twitter site...
 
me too :(
Hi robjohn
I didn't see it was you...
 
9:27 AM
The last thing on Twitter is from the 14th
 
@KajHansen Hippa doen't have a good sleep schedule either
so you might see him when you're up
 
yesterday he was up to 2:30 local hour
 
I've been a lot less active than normal as well due to a tough schedule this semester.
 
9:42 AM
good morning everyone! Is it just me or the main site is offline?
 
it is for evryone
 
We are investigating a routing issue with our network provider
 
ok, thanks
 
@Ramanewbie that's a useful link, I saved it for the future :)
 
9:44 AM
that's a good idea...
 
@ArthurFischer Thanks, I was just about to post that :-)
 
10:06 AM
@robjohn o/
 
On twitter they write: We have enabled Cloudflare for stackoverflow.com while solving the routing issue. There are known SSL issues but it should help. I am not sure what that means, but at least I see that I can access the site.
 
@MartinSleziak It's a cached version
 
Let G be a group with $x, y \in G$ and $r, s, n \in \mathbb{N}$. If $|x|=r \cdot s$ and $|y| = n$, find the orders of $x^r$ and $y^r$.
I got that $|x^r| = s$.
For the second one, I got $|y^r| = \frac{n}{r}$, but I know this is not correct as if I take $D_4$ with $n=4$ and $r=3$ I get the wrong answer.
 
@user112495 What is the smallest multiple of r which is divisible by n?
 
@MartinSleziak $lcm(n, r)$
 
10:21 AM
Correct. Does this help with your problem?
 
@MartinSleziak Okay, so it looks like the answer should be $\frac{lcm(n,r)}{r}$ then. But I'm still not sure how I would go about properly proving this.
@MartinSleziak Oh, is it just because we need it to be an integer.
And so $\frac{lcm(n,r)}{r}$ is the smallest integer (as we are using lcm) such that ${y^r}^{{\frac{lcm(n,r)}{r}}} = 1_G$?
 
I think that the basic fact is that for any element of the form $y^k$ there exists unique $j\in\{0,1,\dots,n-1\}$ such that $y^k=y^j$. Namely, $j$ is the remainder of $k$ when dividing by $n$.
After using this fact, the problem is change from group theoretic problem to question from elementary number theory.
@user112495 Indeed, you get $1_G$ in this way. When you write down the proof, you should also explain that $y^{rk}$ is not $1_G$ for smaller $k$'s.
But I think that the argument should be clear from what we said above.
 
Hey, does anybody remember where the following problem was posted on MSE?
Let f: R -> R be a C^\infty function with the following property:
For each real number x, there exists a natural n such that f^(n)(x) (that is, the nth derivative of f at x) vanishes.
Is f necessarily a polynomial?
I know I've seen it posted before, but I can't find it now.
 
10:38 AM
It was among the first hits when I put derivative vanishes polynomial site:math.stackexchange.com in Google.
If you try some similar queries or have a look at the other results from that search, you might find a few more copies of that question.
 
Yeah, I think that's it. Looks like I remembered a few details wrong. Thanks!
 
10:52 AM
The routing issues should be resolved now. Sorry for any inconvenience.
 
11:09 AM
Hi
$g(y)f^{''}(x)+f(x)g^{''}(y)+ (\alpha ^2 + \beta ^2)f(x)g(y)= 0 \implies f^{''}(x)+\alpha ^2f(x) = 0 , g^{''}(y)+ \beta ^2 g(y)=0$
can someone help me to prove this
 
@Alessandro You don't like Shoenfield? Take a look at Mendelson then. But it might be equally hard. But I think these two are the best.
 
@JasperLoy I wouldn't say that I don't like it, but it's a bit too advanced for my current level
 
11:30 AM
@pourjour If you don't give us the context, we can't help.. what are $f,g,x,y$ ?
 
that's what is it all about
@Hippalectryon the electrostatic field is $E(x,y)= f(x).g(y)$
maybe it's about implicit function theory
 
@pourjour Is your property above verified for all $x,y$ ?
 
@Hippalectryon yes
 
11:50 AM
Hmm so $g(f''+\alpha^2f)+f(g''+\beta^2g)=0$
Which is pretty close
@pourjour I can give an answer from Physics' point of view, but it might be trickier from Maths' point of view
 
@Hippalectryon it's not a good idea to suppress the arguments if there are two different arguments at play
then a reader would be unable to recover the original equation from seeing your equation
 
@anon But I'm lazy :P
$g(y)(f″(x)+\alpha^2f(x))+f(x)(g″(y)+\beta^2g(y))=0$
 
you can rewrite $A(x)B(y)+C(x)D(y)=0$ in the form $F(x)=G(y)$; what do we all know that implies?
 
@Hippalectryon thanks
 
@anon But here we don't exactly have that form
 
11:58 AM
2 mins ago, by Hippalectryon
$g(y)(f″(x)+\alpha^2f(x))+f(x)(g″(y)+\beta^2g(y))=0$
look at it
 
Ooh lol
Of course
 
hi hippa !
 
anyway I get that there exists a constant $k$ so that $f''(x)+(\alpha^2-k)f(x)=0$ and $g''(y)+(\beta^2+k)g(y)=0$; without boundary conditions I don't think there's anything to imply $k=0$ necessarily
 
@Ramanewbie >.>
 
? bananas ?
why did you tell @KajHansen you were 14 years old ???
 
12:01 PM
@Ramanewbie I didn't
 
That's what he thinks
"Yeah. I think it says on his MSE profile or something."
 
Where is it ?
 
Greetings
 
@Chris'ssis Hello :DDDD
 
12:08 PM
@Hippalectryon Hello :-)
 
whut
 
@Chris'ssis bbl
 
@Hippalectryon OK :-)
 
Hallo @DanielFischer !!! :D
 
Hello @Chris'ssis. I think your book should be published this year.
2
 
12:17 PM
@JasperLoy Hello! I agree with you! :-) How are you these days?
 
    @DanielFischer Could we modify the Binary Search also like that?
     int binary_search(int A[], int key, int low, int high, int K)
    {
      if (high < low) return 0;
      else
        {
          int mid=low+floor((high-low)/2);
          if (abs(A[mid]-key) > K) return binary_search(A, key, low, mid - 1);
          else if (abs(A[mid]-key)<=K) return mid;

        }
    }
 
@Chris'ssis Not good. I need to find out answers to 2 questions (1) Why I am still not well after so many years of trying (2) What I must do to get well. I am writing Jonas an email now. Do you remember him?
 
@JasperLoy Yeah, a bit.
 
1:07 PM
@evinda No, not like that, abs(A[mid]-key) > K doesn't tell you in which half of the array you should look further. You must distinguish between A[mid] > key + K and A[mid] < key - K.
 
1:18 PM
@JasperLoy from the preview available on google books Mendelson seems to be more accesible than Shoenfield. What do you think about Enderton's "introduction to mathematical logic" (and the following "elements of set theory)?
 
@Alessandro Mendelson is more modern than Shoenfield, obviously. Enderton's books are great too. All these are classics.
 
A simple reference request:
After about one-and-a-half year of hiatus, I'm starting to look into maths more seriously again. My favourite topics are logic, category theory, and topology.
I'm looking for new books to expand my library.
 
@Lord_Farin What kind of logic and what kind of topology?
 
@JasperLoy Model theory / formal logic, and mostly general topology.
 
@Lord_Farin Willard's General Topology is good.
 
1:25 PM
I also ventured in the direction of algebraic topology.
 
@Lord_Farin Bredon's Topology and Geometry is good.
 
@JasperLoy I already have Switzer for AT but I notice it's too advanced for me at this point, I lack topological background/experience.
Do you know Switzer's book?
 
@Lord_Farin Bredon's book is 3 in 1, point set, differential and algebraic. Try it.
@Lord_Farin Yes, it is very good but very advanced.
 
@Jasper Thanks for the recommendations, I'll definitely look into them! I had the impression that Switzer is good, but it was a bit of a let-down that I wasn't able to handle it :(.
I shouldn't have been surprised though, jumping in after essentially two years without much topology.
@Jasper Are you a topologist? You seem very knowledgeable.
 
@Lord_Farin No, after I finished my undergrad and worked as a teacher for a while, I stopped working and have been trying to recover from my mental illness the past many years. I don't know what will happen to me, the future is bleak. I hope that by the time I get well, grad schools will still accept me.
 
1:31 PM
@Jasper :( I'm sad to hear that.
 
@JasperLoy many thanks for the recommendations, I'll look more into Mendelson and Enderton, but considering the prices I might stick to Shoenfield and ask (a lot of) questions on math.stackexchange when I can't understand something :)
 
@JasperLoy What are the troubles you're dealing with? (Naturally, don't answer if you don't feel like it.)
 
@Lord_Farin OCD, PTSD mainly.
 
@JasperLoy Mmh, I can imagine that to be really bad because people tend not to be very understanding about these problems.
:(
 
@DanielFischer We want to have $-K+key \leq A[mid] \leq K+key$, right?
So, if $A[mid]>key+K$, we have to look at the interval $[low,mid-1]$, right?
If $A[mid]<key-K$ the desired property is satisfied.. Or am I wrong?
 
1:39 PM
@evinda If A[mid] < key -K, then we have |A[mid] - key]| = key - A[mid] > K.
 
@Jasper I have to go now, thanks once more for your recommendations. I wish you strength in overcoming your illness.
 
@Lord_Farin Thank you.
 
see you pal
 
1:58 PM
@DanielFischer So, when we have $A[mid]<key-K$ then it cannot be that $A[mid+i]-key<K$, right?
 
2:10 PM
Hi @user130018
 
2:26 PM
hi
is there anyone here ?
 
@Ramanewbie no
 
Hippa I've a question :
I'ld like to find a number which respects these conditions :
$1+4x$ must be a natural positive root
is it clear ?
 
natural ?
 
yes
 
you mean integer ?
 
2:35 PM
the number ensemble
like decimals, reals...
 
??
$\mathbb{N}$
 
yes integer sorry ^^
 
and what does "being a root" mean to you ?
 
being an integer root
I mean :
If you take the root of this number, you get an integer
 
Ah, so it's called a perfect square
 
2:38 PM
yes... I don't know all the vocabulary yet ^^
 
Well, take $9=4*2+1$
 
hum...
I would like to know how you make a proper equation with what I told
 
You asked for a number satisfying the property
 
That's not what I meant
I made a mistake
I wanted to make an equation
 
$4x+1=a^2,a\in\mathbb{N}$
 
2:41 PM
what ?
why does it fit with what I wanted ?
are you sure it works ?
 
That's exactly what you asked... $4x+1$ is a perfect square in this case...
 
you just added a∈N !
 
That was obvious
 
^^ for you
I remind you I'm a noob !
2
so $ x=\dfrac{a^2-1}{4}$
But there are two variables, how can find x ?
 
heyheyhey
 
2:48 PM
@Ramanewbie Your set of solutions is $\{\dfrac{a^2-1}4\mid a\in\mathbb{N}\text{ and }\dfrac{a^2-1}4\in\mathbb{N}\}$
 
ok now
what's the point of the pipe ?
 
For instance, $\dfrac{3^2-1}4=2$
@Ramanewbie pipe????
 
| don't you call it a pipe ? |
 
No, it's just a middle bar ...
@Huy o/
 
Huy
sup @Hippalectryon
 
2:51 PM
@Huy $\inf$
 
so what's a pipe ?
 
I know that
but I thought it was also a keyboard key
isn't it ??
 
No idea
 
@everybody how can I change my avatar ?
 
2:58 PM
can you show us which key or symbol you meant with "pipe"? So that we can tell you the right name
 
alt-gr + 6
|
on French keyboards ^^
on a US one, I've no idea
 
As far as I know that's usually called a vertical bar
 
maybe...
but I heard lots of people call it a pipe
On YouTube for instance
 
anyway when describing a set it means "such that"
 
ok
how can I change my avatar ?
 
3:02 PM
$\{x|\sqrt{x}\in\Bbb{N}\}$ is the of all the $x$ such that their square roots is an integer (i.e. the set of all the perfect squares)
 
@Alessandro do you know how I can change my avatar ?? I searched in my profile but cannot find it !!
 
in the main site (math.stackexchange.com) click on "user" in the upper bar, then click on edit and here you can change nickname, personal information, avatar and such
 
tks
@Hippalectryon does that mean I can choose any integer to remplace a ?
 
hum...
doesn't work
 
3:15 PM
It does, if you follow the two conditions
 
what ones ? I know only one condition
 
$\{\dfrac{a^2-1}4\mid a\in\mathbb{N}\text{ and }\dfrac{a^2-1}4\in\mathbb{N}\}$
 
so the condition is that $a\in\mathbb{N}$
right ?
 
and that $\dfrac{a^2-1}4\in\mathbb{N}$...
 
that changes everything
I understand now
I changed my avatar, why is it still the same on here ?
 
3:20 PM
The database is cached up to some point, hopefully...
 
what must I do ? clear the cache ?
 
No. Just wait.
 
pff
my computer is making weird noises
 
This is supposed to me a maths chat q_q
 
haha
supposed to, yeah...
grr... the text on my avatar isn't visible !
 
3:33 PM
It's plagiarism in English
And plagiat in French
 
really?
I'm fixing that... ^^
 
You could as well have written "illiterate"
 
why ?
what's the link ?
 
You can't spell -__-
No
 
pff
I just forgot a "t"
It won't stop the spin of the Earth !
 
3:35 PM
How could we show that for $n \geq 3$, it holds that $\lg^{\star}{\lg n}+1 \leq \lg^{\star}n$ ?
 
@evinda $lg$ ?
 
@Hippalectryon $\lgn=\log_2n$
 
Oh ok
What about $\lg^\star$ ? @evinda
 
@evinda Hi! preparing for your exam?
 
@Hippalectryon Neither I got taught it, but I found this on wikipedia: en.wikipedia.org/wiki/Iterated_logarithm
@Alessandro Hi!!! Yes, I am looking at some older exam questions..
 
3:42 PM
@Hippalectryon time ^^ don't kill me
how to determine if 3 points (or more) belong to a same straight line, from their coordonates ?
 
Huy
@Ramanewbie: Write down a parameter form of the line running through two of them, then check if the third lies on that line.
(PS: This was an exercise at my high schoolers' exam too)
 
@Ramanewbie find the equation of the line passing through 2 of them and see if the third one also satisfies this equation
 
@Hippalectryon $$\lg^{\star} n =\min \{ k \geq 0 | \lg^{(k)} n \leq 1\}$$
 
@Huy woops you ninja!
 
@Huy what's a parameter form ??
 
Huy
3:50 PM
@Ramanewbie: If you're only in 2 dimensions, use the equation for lines, $y = ax + b$, in higher dimensions you will need the parameter form.
 
ok, well I'm in 2 dimensions then
 
There was an elegant method I found for n-dimensional vectors. To find if they were colinear.
Let me see if I can find it.
 
@Alessandro there's a problem then
let's choose A(0;−1), B(−2;−4) and C(23;0)
I calculate a for A and B :
$a=\dfrac{-4-0}{-2+1}$
$a=4$
and A(0;−1), so $b=-1$
so f(x)$=4x-1$
@Alessandro right ?
 

« first day (1628 days earlier)      last day (3397 days later) »