Mathematics desk | ||
---|---|---|
< November 19 | << Oct | November | Dec >> | November 21 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
Hello all,
I'm trying to deduce from Ramsey's theorem that whenever is finitely coloured there exist x, y, z with monochromatic.
I've seen a proof of Schur's theorem (effectively finding x, y, x+y with mono) using Ramsey's theorem before, and this seems like a similar but adapted version. Could you prove the above (which seems to be a strengthened Schur) using Ramsey's theorem too? I've tried but haven't gotten anywhere, could anyone please give me a hint? Thank you! Frimgandango (talk) 13:55, 20 November 2011 (UTC)
What is one add one? I.e. 1+1? This is not a homework question. Thankyou for your time. 94.195.251.61 (talk) 16:30, 20 November 2011 (UTC)
There is a new edition of Schaum's General Topology by Seymour Lipschutz, but when I look at it on Amazon, it seems to give me only the old version. Has anyone had any experience with the new version, and is it better? I only do this stuff in my spare time as a hobby (and I don't get much time for it) so I'm looking for something that avoids excessive theory. I also have the Schaum's set theory guide, so I don't need more stuff on cardinality. I'm interested in stuff like connectedness and compactness etc., if that helps. Thanks, IBE (talk) 20:05, 20 November 2011 (UTC)