Eisenstein's criterion
Eisenstein's criterion is like a special rule to help us figure out if a polynomial (which is a fancy math word for an expression with lots of numbers and variables, like x and y) has nice factors that we can find easily.
Imagine you have a polynomial like x^2 + 4x + 3. If you try to factor it, you might notice that it can be written as (x+1)(x+3). But if you had a polynomial like 9x^2 + 12x + 4, it might be harder to figure out the factors. Eisenstein's criterion helps us find when a polynomial can be factored nicely.
Here's how it works: imagine we have a polynomial that looks like this: a_n x^n + a_{n-1} x^{n-1} + ... + a_1 x + a_0. It's important that the highest power of x (which is n) has a coefficient (which is a_n) that is not divisible by any prime number p. So, for example, if p is 2, then a_n can't be an even number - it has to be odd. Similarly, if p is 3, then a_n can't be a multiple of 3.
If we have a polynomial where the highest power of x (which is n) has a coefficient (which is a_n) that is not divisible by any prime number p, and all the other coefficients (a_{n-1} through a_0) are divisible by p, then Eisenstein's criterion tells us that the polynomial can be factored nicely. Specifically, it means that the polynomial can be written as a product of two smaller polynomials, where one of the smaller polynomials has all the x's raised to some power that's less than n, and the other smaller polynomial has all the coefficients (the numbers that come before the x's) divisible by p.
So, let's say we have a polynomial like 6x^3 + 15x^2 + 10x + 2. We can see that 6 (which is the coefficient of x^3) is not divisible by 2 or 3 or 5 or any other prime number. But all the other coefficients are divisible by 2. So we can use Eisenstein's criterion to say that this polynomial can be factored nicely - specifically, it can be written as (2x+1)(3x^2 + 4x + 1).
So, in short: Eisenstein's criterion is a special rule that helps us find when a polynomial can be factored nicely. We check to see if the highest power of x has a coefficient that's not divisible by any prime number, and if all the other coefficients are divisible by some particular prime number. If those conditions are met, we know the polynomial can be factored into two smaller polynomials in a nice way.
Imagine you have a polynomial like x^2 + 4x + 3. If you try to factor it, you might notice that it can be written as (x+1)(x+3). But if you had a polynomial like 9x^2 + 12x + 4, it might be harder to figure out the factors. Eisenstein's criterion helps us find when a polynomial can be factored nicely.
Here's how it works: imagine we have a polynomial that looks like this: a_n x^n + a_{n-1} x^{n-1} + ... + a_1 x + a_0. It's important that the highest power of x (which is n) has a coefficient (which is a_n) that is not divisible by any prime number p. So, for example, if p is 2, then a_n can't be an even number - it has to be odd. Similarly, if p is 3, then a_n can't be a multiple of 3.
If we have a polynomial where the highest power of x (which is n) has a coefficient (which is a_n) that is not divisible by any prime number p, and all the other coefficients (a_{n-1} through a_0) are divisible by p, then Eisenstein's criterion tells us that the polynomial can be factored nicely. Specifically, it means that the polynomial can be written as a product of two smaller polynomials, where one of the smaller polynomials has all the x's raised to some power that's less than n, and the other smaller polynomial has all the coefficients (the numbers that come before the x's) divisible by p.
So, let's say we have a polynomial like 6x^3 + 15x^2 + 10x + 2. We can see that 6 (which is the coefficient of x^3) is not divisible by 2 or 3 or 5 or any other prime number. But all the other coefficients are divisible by 2. So we can use Eisenstein's criterion to say that this polynomial can be factored nicely - specifically, it can be written as (2x+1)(3x^2 + 4x + 1).
So, in short: Eisenstein's criterion is a special rule that helps us find when a polynomial can be factored nicely. We check to see if the highest power of x has a coefficient that's not divisible by any prime number, and if all the other coefficients are divisible by some particular prime number. If those conditions are met, we know the polynomial can be factored into two smaller polynomials in a nice way.
Related topics others have asked about: