Re: -- reducibility in Q[x]
- From: quasi <quasi@xxxxxxxx>
- Date: Sat, 16 Feb 2008 19:04:55 -0500
On Sat, 16 Feb 2008 18:19:48 EST, tommy1729 <tommy1729@xxxxxxxxx>
wrote:
i am amazed by your question quasi.
just take (x-a)(x-b)(x-c) =
and you can express the coefficients in the zero's.
this thus all leads to simple diophantines.
besides there are discriminants for all polynomials , and they dont just exist to solve the polynomials.
perhaps you want to look at the formula for solving deg 3 again...
Ok, I will.
But I want to do it over an arbitrary field.
I'll ask the question in a new thread.
quasi
.
- References:
- Re: -- reducibility in Q[x]
- From: quasi
- Re: -- reducibility in Q[x]
- From: tommy1729
- Re: -- reducibility in Q[x]
- Prev by Date: here we go again
- Next by Date: Re: With FLT, Gauss was a ***! what does that make neilist then ???
- Previous by thread: Re: -- reducibility in Q[x]
- Next by thread: Simple number theory problem...
- Index(es):