Re: degree 61 polynomial

Phil wrote :

quasi <quasi@xxxxxxxx> writes:
On Wed, 18 Feb 2009 20:42:43 EST, Jonathan Groves
<JGroves@xxxxxxxxxx>
wrote:

suppose a student has an irreducible integer
polynomial of degree 61.

he or she claims that polynomial has 5 zero's
such
that :

x1 + x2 + x3 + x4 + x5 = 3

and dares you to prove or disproof it without
using a
computer.

could you ?

I don't know if you're assuming x1, x2, x3, x4, and
x5 are the only distinct zeros of the polynomial or
not.

No -- an irreducible polynomial in Z[x] can't have
multiple roots.

x^61+x+1 is an irreducible integer polynomial of
degree 61, and
it has 61 freaking roots.

What's your "can't have multiple roots" got to do
anything?
It's either inappropriate for the problem in hand, or
it's
wrong. Which one?

Phil
--
I tried the Vista speech recognition by running the
tutorial. I was
amazed, it was awesome, recognised every word I said.
Then I said the
wrong word ... and it typed the right one. It was
actually just
detecting a sound and printing the expected word! --
pbhj on /.

its wrong.

tommy1729
.

Relevant Pages

  • Re: degree 61 polynomial
    ... and dares you to prove or disproof it without using a ... it has 61 freaking roots. ... I tried the Vista speech recognition by running the tutorial. ...
    (sci.math)
  • Re: degree 61 polynomial
    ... and dares you to prove or disproof it without ... What's your "can't have multiple roots" got to do ... I tried the Vista speech recognition by running the ... I corrected Jonathan Groves flawed reply. ...
    (sci.math)
Quantcast