@Matt Morning. Bloch's review of Milne's étale cohomology book. See here second page, long paragraph, the passage starting "In short, this is a gal ..."
There is a proof of the infinitude of primes using topology. I was only informed of the existence of this proof. They say it's very elegant. Can someone show how this proof works?
[Just a note: the edit distance between my question and the one posted is very small: I just added one word in the front and one at the back.]
You give me a seminal paper, and I am pretty sure I can find a silly typo somewhere. Does that mean we should throw out the entire work or refuse to acknowledge it?
Commutative algebra because it is the foundation of algebraic geometry and algebraic number theory; noncommutative rings because they are useful for studying representations.
@Kannappan I don't think that one is necessarily a better starting point than the other. You might be the sort of person who pushes out on multiple fronts at once (at some point, you have to be this sort of person).
@Kannappan Maybe one take-away from this is: if one book doesn't suit your tastes don't waste too much time with it. Simply look for another one. As long as your dealing with rather fundamental things like algebra, there's plenty of choice.
@tb I must confess that I haven't read the whole thing; I learned this stuff from Atiyah-Macdonald. But the parts I have read were as charming as you'd expect.
@JonasTeuwen <rant> apparently the internet has spoiled the generations after mine. Incredibly enough many of them are not even able to search the internet properly :) </rant>
On Math Overflow, the user selects an answer if he is satisfied with it. But, here, there are many questions that have been answered but the user has not chosen any of it ...
@KannappanSampath It could be that it has to do with the way accepted answers are displayed. I mean here it's just a small green tick on the left, while on MO the entire accepted answer is displayed on a green background, so it's much more clearly visible that something has happened.
"From your comment I suspect you don't actually think this answer should be a comment at all." -- Are we now censoring comments? // I guess I am quoting one sentence out of context. Read the full quote in the answer here.
@KannappanSampath Not really, I'd define $\binom{[m]}{n}$ to be empty, in other words $\binom{m}{n} = 0$, just to make sure all our expressions have some meaning.
But I wanted to point out that: the OP is probably asking about combinations.
@KannappanSampath Yes, and since we have a good guess about what the OP means, it might make sense to help the OP polish his question to make it clear. =)
Since, you know, this is a site for mathematics of all levels. =)
Hi! Does anyone know how to do the following in Wolfram Alpha: I have a function f(x)=3x+x^2+x^3 and I want to calculate that for x=1, x=2, x=3 etc.. is there any simple way of doing that besides changing the x to that number, I would like to change in just one section and have the formula remain the same
Now i think it would be a good idea for companys to offer unlimit download of book with a yearly fee but give you advertisement for each download, and i want to ask is there someone here have ever use those type of website before?
if a website similar to this exist legally, it would be far better then google ebooks
Also, i find this book for free and want to share with you people, bt what is the best website that ave wide selection to download those good books for free? here is the link to this book: blngcc.files.wordpress.com/2008/11/… Do you people think those are just elemetary math in this book?
Say I have a set with the numbers 1, 2, 3... m.
How many unique combinations can be made of n numbers out of that set?
