Reducible and Irreducible polynomials are confusing me
up vote
4
down vote
favorite
The definition claims that a polynomial in a field of positive degree is a reducible polynomial when it can be written as the product of $2$ polynomials in the field with positive degrees. Other wise it is irreducible.
So if a polynomial $f(x)$ can be written as the product of say $41(x^2 + x)$, is that considered not reducible because $41$ is really $41x^0$, and $0$ isn't technically positive, but by the definition of a polynomial in a field it is a polynomial if $a_n$ isn't $0$ for the highest degree $n$ where $n geq 0$.
So would the example of the polynomial example I gave be reducible or irreducible?
linear-algebra
add a comment |
up vote
4
down vote
favorite
The definition claims that a polynomial in a field of positive degree is a reducible polynomial when it can be written as the product of $2$ polynomials in the field with positive degrees. Other wise it is irreducible.
So if a polynomial $f(x)$ can be written as the product of say $41(x^2 + x)$, is that considered not reducible because $41$ is really $41x^0$, and $0$ isn't technically positive, but by the definition of a polynomial in a field it is a polynomial if $a_n$ isn't $0$ for the highest degree $n$ where $n geq 0$.
So would the example of the polynomial example I gave be reducible or irreducible?
linear-algebra
I recommend writing zero in dollars because the zero character is like the letter o in the default font which makes reading difficult. Compare 0 and $0$ if you use the default font.
– L. F.
Nov 28 at 10:59
add a comment |
up vote
4
down vote
favorite
up vote
4
down vote
favorite
The definition claims that a polynomial in a field of positive degree is a reducible polynomial when it can be written as the product of $2$ polynomials in the field with positive degrees. Other wise it is irreducible.
So if a polynomial $f(x)$ can be written as the product of say $41(x^2 + x)$, is that considered not reducible because $41$ is really $41x^0$, and $0$ isn't technically positive, but by the definition of a polynomial in a field it is a polynomial if $a_n$ isn't $0$ for the highest degree $n$ where $n geq 0$.
So would the example of the polynomial example I gave be reducible or irreducible?
linear-algebra
The definition claims that a polynomial in a field of positive degree is a reducible polynomial when it can be written as the product of $2$ polynomials in the field with positive degrees. Other wise it is irreducible.
So if a polynomial $f(x)$ can be written as the product of say $41(x^2 + x)$, is that considered not reducible because $41$ is really $41x^0$, and $0$ isn't technically positive, but by the definition of a polynomial in a field it is a polynomial if $a_n$ isn't $0$ for the highest degree $n$ where $n geq 0$.
So would the example of the polynomial example I gave be reducible or irreducible?
linear-algebra
linear-algebra
edited Nov 28 at 11:12
L. F.
1284
1284
asked Nov 28 at 6:14
ming
885
885
I recommend writing zero in dollars because the zero character is like the letter o in the default font which makes reading difficult. Compare 0 and $0$ if you use the default font.
– L. F.
Nov 28 at 10:59
add a comment |
I recommend writing zero in dollars because the zero character is like the letter o in the default font which makes reading difficult. Compare 0 and $0$ if you use the default font.
– L. F.
Nov 28 at 10:59
I recommend writing zero in dollars because the zero character is like the letter o in the default font which makes reading difficult. Compare 0 and $0$ if you use the default font.
– L. F.
Nov 28 at 10:59
I recommend writing zero in dollars because the zero character is like the letter o in the default font which makes reading difficult. Compare 0 and $0$ if you use the default font.
– L. F.
Nov 28 at 10:59
add a comment |
3 Answers
3
active
oldest
votes
up vote
10
down vote
This particular example would be reducible, but not because of the reason you give -- it would be because you could write it as $41x(x+1)$. Note that $0$ is not positive, so the factorization you give is not a product of two polynomials with positive degree ($41$ is a polynomial of degree $0$).
2
So if it was $41(x + 1)$ it would be irreducible right? Because 41 cannot be written with a degree of anything greater than 0, and 0 is not positive?
– ming
Nov 28 at 6:23
Correct, $41x + 41$ is irreducible (assuming you are working over $mathbb{Z}[x]$).
– platty
Nov 28 at 6:25
2
It is reducible in Z[x] as 41 is not a unit.
– Hans
Nov 28 at 7:33
I think the definition of irreducible as a polynomial requires that both factors be non-constant; I'm not sure why I added that stipulation. Otherwise you run into uniqueness issues with something like $4x+4$.
– platty
Nov 28 at 7:37
add a comment |
up vote
6
down vote
Definition : Given an integral domain $R$, a non-zero non-unit element $r in R$ is said to be irreducible if it cannot be written as a product of non-units i.e. whenever it is written as a product of two elements, at least one of them is a unit in $R$.
For polynomials, this becomes :
Definition : Given an integral domain $R$, the ring $R[X]$ also is an integral domain, and $f$ is an irreducible polynomial over $R$ if it is an irreducible element of $R[X]$.
So, it is that simple. Let us take some examples to clarify.
The polynomial $f(x) = x$ is irreducible over any ring, since if $a(x)b(x) =x$, then WLOG $a$ must be a constant polynomial with the constant being a unit(use the rules for multiplication of polynomials), so $a$ is a unit in $R[X]$, hence $x$ is irreducible.
The polynomial $f(x) = 2x+2$ is irreducible over $mathbb R[X]$. This is because if $a(x)b(x)$ divides $2(x+1)$ then at least one of $a(x)$ or $b(x)$ is a constant polynomial, but every constant polynomial is a unit in $mathbb R$. However, this polynomial is reducible over $mathbb Z[X]$, since here, $2(x+1)$ counts as a non-unit factorization, because $2$ is not a unit.
Therefore, reducibility depends on "over which ring/field"? For example, $41 = 41x^0$ is a constant polynomial, but it isn't a unit in $mathbb Z[X]$, while it is one in $mathbb R[X]$. So, a polynomial like $41(x+1)$ is irreducible over the latter but not over the former.
While working over a field, it turns out that the set of units of $F[X]$ is equal to the non-zero constant polynomials. Therefore, any polynomial is irreducible in $F[X]$ if and only if it can be written as the product of two non-constant polynomials. Things will change for a ring which is not a field, since some non-constant polynomials may possibly not be units.
Also, note that $41(x^2+x)$ is reducible in every field where it is non-zero, since it can be written as $(41 x) times (x+1)$ which is the product of two non-constant polynomials, which are always non-units by the fact that the degree is multiplicative.
The reason why "where it is non-zero" is mentioned, is because in characteristic $41$(or, over fields of characteristic $41$ such as $mathbb Z over 41mathbb Z$), this polynomial actually reduces to $0$, for which the notion is irreducibility is not defined above. For fields of any other characteristic, the polynomial is non-zero(and non-unit) so we can discuss irreducibility. Much thanks to the comment below for pointing this out. Also, something similar applies to other polynomials discussed previously such as $2x+2$ (in characteristic $2$, this polynomial is identically zero) and $41(x+1)$. However, $x$ remains non-zero over every field, so the argument remains.
There is a small subtlety in your last paragraph over fields of characteristic $41$ that would be worth mentioning.
– Eric Towers
Nov 28 at 13:47
@EricTowers It is very important, thank you for mentioning it. I have edited the answer.
– астон вілла олоф мэллбэрг
Nov 28 at 13:58
add a comment |
up vote
-2
down vote
A polynomial $f(x)$ is reducible if $f(x)=g(x)h(x)$ with $deg(g(x)) ge 1$, and $deg(h(x)) ge 1$
3
Do you mean reducible? I don't see how your answer helps as OP has clearly mentioned the definition.
– Thomas Shelby
Nov 28 at 7:01
add a comment |
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
10
down vote
This particular example would be reducible, but not because of the reason you give -- it would be because you could write it as $41x(x+1)$. Note that $0$ is not positive, so the factorization you give is not a product of two polynomials with positive degree ($41$ is a polynomial of degree $0$).
2
So if it was $41(x + 1)$ it would be irreducible right? Because 41 cannot be written with a degree of anything greater than 0, and 0 is not positive?
– ming
Nov 28 at 6:23
Correct, $41x + 41$ is irreducible (assuming you are working over $mathbb{Z}[x]$).
– platty
Nov 28 at 6:25
2
It is reducible in Z[x] as 41 is not a unit.
– Hans
Nov 28 at 7:33
I think the definition of irreducible as a polynomial requires that both factors be non-constant; I'm not sure why I added that stipulation. Otherwise you run into uniqueness issues with something like $4x+4$.
– platty
Nov 28 at 7:37
add a comment |
up vote
10
down vote
This particular example would be reducible, but not because of the reason you give -- it would be because you could write it as $41x(x+1)$. Note that $0$ is not positive, so the factorization you give is not a product of two polynomials with positive degree ($41$ is a polynomial of degree $0$).
2
So if it was $41(x + 1)$ it would be irreducible right? Because 41 cannot be written with a degree of anything greater than 0, and 0 is not positive?
– ming
Nov 28 at 6:23
Correct, $41x + 41$ is irreducible (assuming you are working over $mathbb{Z}[x]$).
– platty
Nov 28 at 6:25
2
It is reducible in Z[x] as 41 is not a unit.
– Hans
Nov 28 at 7:33
I think the definition of irreducible as a polynomial requires that both factors be non-constant; I'm not sure why I added that stipulation. Otherwise you run into uniqueness issues with something like $4x+4$.
– platty
Nov 28 at 7:37
add a comment |
up vote
10
down vote
up vote
10
down vote
This particular example would be reducible, but not because of the reason you give -- it would be because you could write it as $41x(x+1)$. Note that $0$ is not positive, so the factorization you give is not a product of two polynomials with positive degree ($41$ is a polynomial of degree $0$).
This particular example would be reducible, but not because of the reason you give -- it would be because you could write it as $41x(x+1)$. Note that $0$ is not positive, so the factorization you give is not a product of two polynomials with positive degree ($41$ is a polynomial of degree $0$).
answered Nov 28 at 6:20
platty
2,443218
2,443218
2
So if it was $41(x + 1)$ it would be irreducible right? Because 41 cannot be written with a degree of anything greater than 0, and 0 is not positive?
– ming
Nov 28 at 6:23
Correct, $41x + 41$ is irreducible (assuming you are working over $mathbb{Z}[x]$).
– platty
Nov 28 at 6:25
2
It is reducible in Z[x] as 41 is not a unit.
– Hans
Nov 28 at 7:33
I think the definition of irreducible as a polynomial requires that both factors be non-constant; I'm not sure why I added that stipulation. Otherwise you run into uniqueness issues with something like $4x+4$.
– platty
Nov 28 at 7:37
add a comment |
2
So if it was $41(x + 1)$ it would be irreducible right? Because 41 cannot be written with a degree of anything greater than 0, and 0 is not positive?
– ming
Nov 28 at 6:23
Correct, $41x + 41$ is irreducible (assuming you are working over $mathbb{Z}[x]$).
– platty
Nov 28 at 6:25
2
It is reducible in Z[x] as 41 is not a unit.
– Hans
Nov 28 at 7:33
I think the definition of irreducible as a polynomial requires that both factors be non-constant; I'm not sure why I added that stipulation. Otherwise you run into uniqueness issues with something like $4x+4$.
– platty
Nov 28 at 7:37
2
2
So if it was $41(x + 1)$ it would be irreducible right? Because 41 cannot be written with a degree of anything greater than 0, and 0 is not positive?
– ming
Nov 28 at 6:23
So if it was $41(x + 1)$ it would be irreducible right? Because 41 cannot be written with a degree of anything greater than 0, and 0 is not positive?
– ming
Nov 28 at 6:23
Correct, $41x + 41$ is irreducible (assuming you are working over $mathbb{Z}[x]$).
– platty
Nov 28 at 6:25
Correct, $41x + 41$ is irreducible (assuming you are working over $mathbb{Z}[x]$).
– platty
Nov 28 at 6:25
2
2
It is reducible in Z[x] as 41 is not a unit.
– Hans
Nov 28 at 7:33
It is reducible in Z[x] as 41 is not a unit.
– Hans
Nov 28 at 7:33
I think the definition of irreducible as a polynomial requires that both factors be non-constant; I'm not sure why I added that stipulation. Otherwise you run into uniqueness issues with something like $4x+4$.
– platty
Nov 28 at 7:37
I think the definition of irreducible as a polynomial requires that both factors be non-constant; I'm not sure why I added that stipulation. Otherwise you run into uniqueness issues with something like $4x+4$.
– platty
Nov 28 at 7:37
add a comment |
up vote
6
down vote
Definition : Given an integral domain $R$, a non-zero non-unit element $r in R$ is said to be irreducible if it cannot be written as a product of non-units i.e. whenever it is written as a product of two elements, at least one of them is a unit in $R$.
For polynomials, this becomes :
Definition : Given an integral domain $R$, the ring $R[X]$ also is an integral domain, and $f$ is an irreducible polynomial over $R$ if it is an irreducible element of $R[X]$.
So, it is that simple. Let us take some examples to clarify.
The polynomial $f(x) = x$ is irreducible over any ring, since if $a(x)b(x) =x$, then WLOG $a$ must be a constant polynomial with the constant being a unit(use the rules for multiplication of polynomials), so $a$ is a unit in $R[X]$, hence $x$ is irreducible.
The polynomial $f(x) = 2x+2$ is irreducible over $mathbb R[X]$. This is because if $a(x)b(x)$ divides $2(x+1)$ then at least one of $a(x)$ or $b(x)$ is a constant polynomial, but every constant polynomial is a unit in $mathbb R$. However, this polynomial is reducible over $mathbb Z[X]$, since here, $2(x+1)$ counts as a non-unit factorization, because $2$ is not a unit.
Therefore, reducibility depends on "over which ring/field"? For example, $41 = 41x^0$ is a constant polynomial, but it isn't a unit in $mathbb Z[X]$, while it is one in $mathbb R[X]$. So, a polynomial like $41(x+1)$ is irreducible over the latter but not over the former.
While working over a field, it turns out that the set of units of $F[X]$ is equal to the non-zero constant polynomials. Therefore, any polynomial is irreducible in $F[X]$ if and only if it can be written as the product of two non-constant polynomials. Things will change for a ring which is not a field, since some non-constant polynomials may possibly not be units.
Also, note that $41(x^2+x)$ is reducible in every field where it is non-zero, since it can be written as $(41 x) times (x+1)$ which is the product of two non-constant polynomials, which are always non-units by the fact that the degree is multiplicative.
The reason why "where it is non-zero" is mentioned, is because in characteristic $41$(or, over fields of characteristic $41$ such as $mathbb Z over 41mathbb Z$), this polynomial actually reduces to $0$, for which the notion is irreducibility is not defined above. For fields of any other characteristic, the polynomial is non-zero(and non-unit) so we can discuss irreducibility. Much thanks to the comment below for pointing this out. Also, something similar applies to other polynomials discussed previously such as $2x+2$ (in characteristic $2$, this polynomial is identically zero) and $41(x+1)$. However, $x$ remains non-zero over every field, so the argument remains.
There is a small subtlety in your last paragraph over fields of characteristic $41$ that would be worth mentioning.
– Eric Towers
Nov 28 at 13:47
@EricTowers It is very important, thank you for mentioning it. I have edited the answer.
– астон вілла олоф мэллбэрг
Nov 28 at 13:58
add a comment |
up vote
6
down vote
Definition : Given an integral domain $R$, a non-zero non-unit element $r in R$ is said to be irreducible if it cannot be written as a product of non-units i.e. whenever it is written as a product of two elements, at least one of them is a unit in $R$.
For polynomials, this becomes :
Definition : Given an integral domain $R$, the ring $R[X]$ also is an integral domain, and $f$ is an irreducible polynomial over $R$ if it is an irreducible element of $R[X]$.
So, it is that simple. Let us take some examples to clarify.
The polynomial $f(x) = x$ is irreducible over any ring, since if $a(x)b(x) =x$, then WLOG $a$ must be a constant polynomial with the constant being a unit(use the rules for multiplication of polynomials), so $a$ is a unit in $R[X]$, hence $x$ is irreducible.
The polynomial $f(x) = 2x+2$ is irreducible over $mathbb R[X]$. This is because if $a(x)b(x)$ divides $2(x+1)$ then at least one of $a(x)$ or $b(x)$ is a constant polynomial, but every constant polynomial is a unit in $mathbb R$. However, this polynomial is reducible over $mathbb Z[X]$, since here, $2(x+1)$ counts as a non-unit factorization, because $2$ is not a unit.
Therefore, reducibility depends on "over which ring/field"? For example, $41 = 41x^0$ is a constant polynomial, but it isn't a unit in $mathbb Z[X]$, while it is one in $mathbb R[X]$. So, a polynomial like $41(x+1)$ is irreducible over the latter but not over the former.
While working over a field, it turns out that the set of units of $F[X]$ is equal to the non-zero constant polynomials. Therefore, any polynomial is irreducible in $F[X]$ if and only if it can be written as the product of two non-constant polynomials. Things will change for a ring which is not a field, since some non-constant polynomials may possibly not be units.
Also, note that $41(x^2+x)$ is reducible in every field where it is non-zero, since it can be written as $(41 x) times (x+1)$ which is the product of two non-constant polynomials, which are always non-units by the fact that the degree is multiplicative.
The reason why "where it is non-zero" is mentioned, is because in characteristic $41$(or, over fields of characteristic $41$ such as $mathbb Z over 41mathbb Z$), this polynomial actually reduces to $0$, for which the notion is irreducibility is not defined above. For fields of any other characteristic, the polynomial is non-zero(and non-unit) so we can discuss irreducibility. Much thanks to the comment below for pointing this out. Also, something similar applies to other polynomials discussed previously such as $2x+2$ (in characteristic $2$, this polynomial is identically zero) and $41(x+1)$. However, $x$ remains non-zero over every field, so the argument remains.
There is a small subtlety in your last paragraph over fields of characteristic $41$ that would be worth mentioning.
– Eric Towers
Nov 28 at 13:47
@EricTowers It is very important, thank you for mentioning it. I have edited the answer.
– астон вілла олоф мэллбэрг
Nov 28 at 13:58
add a comment |
up vote
6
down vote
up vote
6
down vote
Definition : Given an integral domain $R$, a non-zero non-unit element $r in R$ is said to be irreducible if it cannot be written as a product of non-units i.e. whenever it is written as a product of two elements, at least one of them is a unit in $R$.
For polynomials, this becomes :
Definition : Given an integral domain $R$, the ring $R[X]$ also is an integral domain, and $f$ is an irreducible polynomial over $R$ if it is an irreducible element of $R[X]$.
So, it is that simple. Let us take some examples to clarify.
The polynomial $f(x) = x$ is irreducible over any ring, since if $a(x)b(x) =x$, then WLOG $a$ must be a constant polynomial with the constant being a unit(use the rules for multiplication of polynomials), so $a$ is a unit in $R[X]$, hence $x$ is irreducible.
The polynomial $f(x) = 2x+2$ is irreducible over $mathbb R[X]$. This is because if $a(x)b(x)$ divides $2(x+1)$ then at least one of $a(x)$ or $b(x)$ is a constant polynomial, but every constant polynomial is a unit in $mathbb R$. However, this polynomial is reducible over $mathbb Z[X]$, since here, $2(x+1)$ counts as a non-unit factorization, because $2$ is not a unit.
Therefore, reducibility depends on "over which ring/field"? For example, $41 = 41x^0$ is a constant polynomial, but it isn't a unit in $mathbb Z[X]$, while it is one in $mathbb R[X]$. So, a polynomial like $41(x+1)$ is irreducible over the latter but not over the former.
While working over a field, it turns out that the set of units of $F[X]$ is equal to the non-zero constant polynomials. Therefore, any polynomial is irreducible in $F[X]$ if and only if it can be written as the product of two non-constant polynomials. Things will change for a ring which is not a field, since some non-constant polynomials may possibly not be units.
Also, note that $41(x^2+x)$ is reducible in every field where it is non-zero, since it can be written as $(41 x) times (x+1)$ which is the product of two non-constant polynomials, which are always non-units by the fact that the degree is multiplicative.
The reason why "where it is non-zero" is mentioned, is because in characteristic $41$(or, over fields of characteristic $41$ such as $mathbb Z over 41mathbb Z$), this polynomial actually reduces to $0$, for which the notion is irreducibility is not defined above. For fields of any other characteristic, the polynomial is non-zero(and non-unit) so we can discuss irreducibility. Much thanks to the comment below for pointing this out. Also, something similar applies to other polynomials discussed previously such as $2x+2$ (in characteristic $2$, this polynomial is identically zero) and $41(x+1)$. However, $x$ remains non-zero over every field, so the argument remains.
Definition : Given an integral domain $R$, a non-zero non-unit element $r in R$ is said to be irreducible if it cannot be written as a product of non-units i.e. whenever it is written as a product of two elements, at least one of them is a unit in $R$.
For polynomials, this becomes :
Definition : Given an integral domain $R$, the ring $R[X]$ also is an integral domain, and $f$ is an irreducible polynomial over $R$ if it is an irreducible element of $R[X]$.
So, it is that simple. Let us take some examples to clarify.
The polynomial $f(x) = x$ is irreducible over any ring, since if $a(x)b(x) =x$, then WLOG $a$ must be a constant polynomial with the constant being a unit(use the rules for multiplication of polynomials), so $a$ is a unit in $R[X]$, hence $x$ is irreducible.
The polynomial $f(x) = 2x+2$ is irreducible over $mathbb R[X]$. This is because if $a(x)b(x)$ divides $2(x+1)$ then at least one of $a(x)$ or $b(x)$ is a constant polynomial, but every constant polynomial is a unit in $mathbb R$. However, this polynomial is reducible over $mathbb Z[X]$, since here, $2(x+1)$ counts as a non-unit factorization, because $2$ is not a unit.
Therefore, reducibility depends on "over which ring/field"? For example, $41 = 41x^0$ is a constant polynomial, but it isn't a unit in $mathbb Z[X]$, while it is one in $mathbb R[X]$. So, a polynomial like $41(x+1)$ is irreducible over the latter but not over the former.
While working over a field, it turns out that the set of units of $F[X]$ is equal to the non-zero constant polynomials. Therefore, any polynomial is irreducible in $F[X]$ if and only if it can be written as the product of two non-constant polynomials. Things will change for a ring which is not a field, since some non-constant polynomials may possibly not be units.
Also, note that $41(x^2+x)$ is reducible in every field where it is non-zero, since it can be written as $(41 x) times (x+1)$ which is the product of two non-constant polynomials, which are always non-units by the fact that the degree is multiplicative.
The reason why "where it is non-zero" is mentioned, is because in characteristic $41$(or, over fields of characteristic $41$ such as $mathbb Z over 41mathbb Z$), this polynomial actually reduces to $0$, for which the notion is irreducibility is not defined above. For fields of any other characteristic, the polynomial is non-zero(and non-unit) so we can discuss irreducibility. Much thanks to the comment below for pointing this out. Also, something similar applies to other polynomials discussed previously such as $2x+2$ (in characteristic $2$, this polynomial is identically zero) and $41(x+1)$. However, $x$ remains non-zero over every field, so the argument remains.
edited Nov 28 at 13:57
answered Nov 28 at 6:39
астон вілла олоф мэллбэрг
36.7k33376
36.7k33376
There is a small subtlety in your last paragraph over fields of characteristic $41$ that would be worth mentioning.
– Eric Towers
Nov 28 at 13:47
@EricTowers It is very important, thank you for mentioning it. I have edited the answer.
– астон вілла олоф мэллбэрг
Nov 28 at 13:58
add a comment |
There is a small subtlety in your last paragraph over fields of characteristic $41$ that would be worth mentioning.
– Eric Towers
Nov 28 at 13:47
@EricTowers It is very important, thank you for mentioning it. I have edited the answer.
– астон вілла олоф мэллбэрг
Nov 28 at 13:58
There is a small subtlety in your last paragraph over fields of characteristic $41$ that would be worth mentioning.
– Eric Towers
Nov 28 at 13:47
There is a small subtlety in your last paragraph over fields of characteristic $41$ that would be worth mentioning.
– Eric Towers
Nov 28 at 13:47
@EricTowers It is very important, thank you for mentioning it. I have edited the answer.
– астон вілла олоф мэллбэрг
Nov 28 at 13:58
@EricTowers It is very important, thank you for mentioning it. I have edited the answer.
– астон вілла олоф мэллбэрг
Nov 28 at 13:58
add a comment |
up vote
-2
down vote
A polynomial $f(x)$ is reducible if $f(x)=g(x)h(x)$ with $deg(g(x)) ge 1$, and $deg(h(x)) ge 1$
3
Do you mean reducible? I don't see how your answer helps as OP has clearly mentioned the definition.
– Thomas Shelby
Nov 28 at 7:01
add a comment |
up vote
-2
down vote
A polynomial $f(x)$ is reducible if $f(x)=g(x)h(x)$ with $deg(g(x)) ge 1$, and $deg(h(x)) ge 1$
3
Do you mean reducible? I don't see how your answer helps as OP has clearly mentioned the definition.
– Thomas Shelby
Nov 28 at 7:01
add a comment |
up vote
-2
down vote
up vote
-2
down vote
A polynomial $f(x)$ is reducible if $f(x)=g(x)h(x)$ with $deg(g(x)) ge 1$, and $deg(h(x)) ge 1$
A polynomial $f(x)$ is reducible if $f(x)=g(x)h(x)$ with $deg(g(x)) ge 1$, and $deg(h(x)) ge 1$
edited Nov 28 at 9:30
answered Nov 28 at 6:51
Fareed AF
36711
36711
3
Do you mean reducible? I don't see how your answer helps as OP has clearly mentioned the definition.
– Thomas Shelby
Nov 28 at 7:01
add a comment |
3
Do you mean reducible? I don't see how your answer helps as OP has clearly mentioned the definition.
– Thomas Shelby
Nov 28 at 7:01
3
3
Do you mean reducible? I don't see how your answer helps as OP has clearly mentioned the definition.
– Thomas Shelby
Nov 28 at 7:01
Do you mean reducible? I don't see how your answer helps as OP has clearly mentioned the definition.
– Thomas Shelby
Nov 28 at 7:01
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3016802%2freducible-and-irreducible-polynomials-are-confusing-me%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
I recommend writing zero in dollars because the zero character is like the letter o in the default font which makes reading difficult. Compare 0 and $0$ if you use the default font.
– L. F.
Nov 28 at 10:59