Why is polynomial defined only for n such that for each x^n term, n>= 0?
Basically, why not include more options for n? If we expand n to all integers (negative include), what is the problem? Likewise, can't we also allow n to be any real number?
Even so,it seems possible to make polynomial rings. Or am I missing something.
What is the reason that n is confined to only 0 and positive integers in the definition of polynomials?
You can easily define "polynomials" with e.g. real exponents. Suppose $M$ is a commutative monoid, i.e. a set with an associative and commutative binary operation that has a unit element in $M$. Any abelian group is such a monoid, but also examples like the natural numbers $\mathbb N$ and the nonnegative real numbers $\mathbb R_{\geq 0}$. Now given any commutative ring $R$, you can construct the free commutative $R$-algebra over such a monoid $M$, denoted $R[M]$, as follows:
As an $R$-module, we define $R[M]=\bigoplus_{m\in M} R$, in other words $R[M]$ consists of formal finite sums of the form $\sum r_i X^{m_i}$ with $r_i \in R$ and $m_i \in M$. Here the symbol $X$ does not mean anything, I used it just in order for you to see the connection to ordinary polynomials. The multiplication is defined by extending the assignment $X^{m}\cdot X^n \mapsto X^{m+n}$, where $m+n$ is the operation in the monoid $M$, bilinearly to these formal sums (just like it is done in the case of usual polynomials). It is an easy exercise to see that for the monoid of natural numbers, this recovers the usual polynomial ring, i.e we find $R[\mathbb N]=R[X]$. If you however choose $M=\mathbb R$, you will get a polynomial ring with real exponents.