Simple principle, core error proven



 Science > Physics > Simple principle, core error proven

LINK TO THIS PAGE  


rating :  0   |  0


  Page 1 of 2

1

 

2

 
Topic: Science > Physics
User: "James Harris"
Date: 20 Oct 2003 05:24:23 PM
Object: Simple principle, core error proven
Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.
1. First the problematic definition:
Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.
My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.
2. The important tool I use is a polynomial:
P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)
where m varies in the ring of algebraic integers.
Some may find it looks odd. But the entire point of that form is to
do something a little different than anyone else apparently has done
before, which is to get non-polynomial factors.
And the factorization with those factors is
P(m) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7)
where the a's are roots of the following cubic:
a^3 + 3(-1 + 49m)a^2 - 49(2401 m^3 - 147 m^2 + 3m).
So you can see that the a's are functions of m, and if you really want
headaches you can go ahead and solve the cubic to get a view of them.
However, I can move on without needing their explicit form.
From the factorization I have three factors
g_1 = (5 a_1 + 7), g_2 =(5 a_2 + 7), g_3=(5 a_1 + 7)
and I can find those terms that are free of m by setting m=0, just
like with any polynomial, you know like with S(m) = 2(m^2 + 2m + 1),
S(0) = 2, which you can just look at and see here, but with my P(m)
it's just a little harder, so I set m=0, which gives me
P(0) = 49(3(5) + 7),
which fits with the cubic as at m=0 it gives
a^3 -3a^2 = 0, so a_1 = a_2=0, a_3 = 3,
to show that at m=0, the three factors are
g_1 = 7, g_2 = 7, g_3 = 3(5) + 7 = 22.
Now dividing P(m) by 49 gives
P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7
and the question is what happens to the g's, but look now at P(0)/49
as that is
P(0)/49 = 3(5) + 7
as two factors of 7, each 7, have beeen divided off, which is easy to
see.
The only way that can happen is if
P(m)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 a_3 + 7)
where only two of the a's have 7 as a factor, where the idea is almost
trivially simple as consider a polynomial like
S(m) = 7(m^2 + 2m + 1) = (b_1 m + 7)(b_2 m + 1)
and notice that S(0) = 7, while S(m)/7, gives you
S(m)/7 = m^2 + 2m + 1,
which means that
S(m)/7 = (b_1 m/7 + 1)(b_2 m + 1) = m^2 + 2m + 1.
It's the same basic idea while what I have is more complicated as I'm
showing you an over hundred year old flaw, and it turns out that it
takes a somewhat complicated expression to show it which
P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7
is, but the same principle works as just like with S(m), with P(m),
dividing out 49, affects the independent or constant terms, revealing
factors of the a's.
That is, from the distributive property, factors that are 7 must
divide through.
So now I know that the correct factorization is
P(m)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 a_3 + 7)
which is like
S(m)/7 = (b_1 m/7 + 1)(b_2 m + 1).
3. So *two* of the a's *should* have 7 as a factor, and in fact they
do, in a proper ring, but the ring of algebraic integers has problems,
so that for certain values of m, they won't.
It's that *inconsistency* which shows you there's a problem because
mathematics isn't about being wishy-washy, where sometimes something
works and then other times it doesn't.
That error has sat in mathematics--the body of discoveries commonly
called mathematics--for over a *hundred* years.
Since I found the error I should probably get rich and famous from it,
but so far mathematicians I've contacted seem more interested in
denying or hiding the error than in telling the truth. However, that
means there is this error, which may sink lots of "proofs" over the
past hundred years in an area of mathematics called algebraic number
theory.
And in fact, mathematicians may be engaging in a bigger fraud because
they may *know* by now just how big the problem is, and it may be a
bigger embarrassment than even I am aware of at this point.
They may see themselves as having no choice but to hide it to keep
their money, their prestige, and their history as it is known to most
as of now.
Some of them may be trying to hide it partly out of envy or jealousy
of my discovery as well. Mathematicians can be VERY vicious for petty
and childish reasons I've found.
If you are a math student, you probably will want to stay out of the
area of algebraic number theory, or consider carefully things your
professors supposedly prove in the area.
While mathematicians behave this way, you have to wonder now about
what they teach you.
James Harris
-------------------------
Saturday, August 30, 2003

Intellectual laziness is about deciding
ahead of time what you wish to believe,
and daring God to be different.
http://lostincomment.blogspot.com/
.

User: "Maxim Stepin"

Title: core error fixed 20 Oct 2003 10:48:13 PM
"James Harris" <jstevh@msn.com> wrote in message
news:3c65f87.0310201424.39b5d6cd@posting.google.com...

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.

My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.

Stupid, evil definition... It's time to destroy it!
No definition - no problem! That's the easiest way to fix everything.
Let's never use the term "algebraic integers" again, let's just call them
"roots of monic polynomials with integer coefficient"!
All right, no core error from now on!
.

User: "Randy Poe"

Title: Re: Simple principle, core error proven 24 Oct 2003 09:47:18 AM
(James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.

My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.

James, there's a really basic logical question you've never
answered about this, despite repeated queries:
Do you believe that there is such a thing as a set of
numbers with the property that they are roots of monic
polynomials with integer coefficients?
If so, do you think it's legitimate to ask what other
properties such numbers have, given only that they
have this property?
If we are interested in the set of numbers which are
roots of monic polynomials with integer coefficients,
what does it mean that the set "should" include numbers
that are not such roots?
You've also never answered this one: It is possible to
form a product ab = c with a and c in the set Z but b
not in the set Z. Does that mean the set Z is incomplete
and there is an error in the definition? (Ex: a=3, c=5,
b = 5/3).
- Randy
.
User: "Brian Quincy Hutchings"

Title: Re: Simple principle, core error proven 26 Oct 2003 08:32:04 PM
good demonstration, "Randy Poe."
poespam-trap@yahoo.com (Randy Poe) wrote in message news:<df76407e.0310240647.13b76c02@posting.google.com>...

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If we are interested in the set of numbers which are
roots of monic polynomials with integer coefficients,
what does it mean that the set "should" include numbers
that are not such roots?

You've also never answered this one: It is possible to
form a product ab = c with a and c in the set Z but b
not in the set Z. Does that mean the set Z is incomplete
and there is an error in the definition? (Ex: a=3, c=5,
b = 5/3).

--les ducs d'Enron!
http://members.tripod.com/~american_almanac/
http://larouchepub.com/
.
User: "James Harris"

Title: Re: Simple principle, core error proven 27 Oct 2003 09:21:45 AM
(Brian Quincy Hutchings) wrote in message news:<bde404c9.0310261832.2ec20146@posting.google.com>...

good demonstration, "Randy Poe."

poespam-trap@yahoo.com (Randy Poe) wrote in message news:<df76407e.0310240647.13b76c02@posting.google.com>...

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If we are interested in the set of numbers which are
roots of monic polynomials with integer coefficients,
what does it mean that the set "should" include numbers
that are not such roots?

You've also never answered this one: It is possible to
form a product ab = c with a and c in the set Z but b
not in the set Z. Does that mean the set Z is incomplete
and there is an error in the definition? (Ex: a=3, c=5,
b = 5/3).

"What I've found is a problem with their set of algebraic integers, as
unfortunately, despite what many mathematicians think, it's too small.
That's it. The definition they use is too small to do what they think
it does, which is include all these interesting numbers with special
properties.
But because they think it's big enough, mathematicians have an error
in their discipline based on their false assumption, as they've come
up with more arguments based on that assumption, which then aren't
actually proven.
It's like when the Greeks with their word "atom" thought they had the
smallest thing, and later our civilization used it, and broke atoms
apart, though part of the original Greek definition is that they are
indivisible, as people can define things, and later refine their
definitions."
Excerpt from http://mathforprofit.blogspot.com
James Harris
.
User: "Randy Poe"

Title: Re: Simple principle, core error proven 27 Oct 2003 11:42:29 AM
(James Harris) wrote in message news:<3c65f87.0310270721.4fa2965e@posting.google.com>...

QncyMI@netscape.net (Brian Quincy Hutchings) wrote in message news:<bde404c9.0310261832.2ec20146@posting.google.com>...

good demonstration, "Randy Poe."

poespam-trap@yahoo.com (Randy Poe) wrote in message news:<df76407e.0310240647.13b76c02@posting.google.com>...

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If we are interested in the set of numbers which are
roots of monic polynomials with integer coefficients,
what does it mean that the set "should" include numbers
that are not such roots?

You've also never answered this one: It is possible to
form a product ab = c with a and c in the set Z but b
not in the set Z. Does that mean the set Z is incomplete
and there is an error in the definition? (Ex: a=3, c=5,
b = 5/3).


"What I've found is a problem with their set of algebraic integers, as
unfortunately, despite what many mathematicians think, it's too small.

That's it. The definition they use is too small to do what they think
it does, which is include all these interesting numbers with special
properties.

Which special properties are those?
Does it include all the numbers with the property that
they are roots of monic polynomials with integer coefficients?
If this is a "problem" with the algebraic integers:
There exist numbers a, b, c with a and c in the algebraic
integers and b not an algebraic integer, such that ab=c.
Then is this a similar problem in the ordinary integers?
There exist numbers a, b, c with a and c in the Z
and b not in Z, such that ab=c.
(Those are two separate questions which I'm still waiting
for you to provide an answer for).
- Randy
.

User: "Christian Bau"

Title: Re: Simple principle, core error proven 27 Oct 2003 04:18:57 PM
In article <3c65f87.0310270721.4fa2965e@posting.google.com>,
(James Harris) wrote:

"What I've found is a problem with their set of algebraic integers, as
unfortunately, despite what many mathematicians think, it's too small.

That's it. The definition they use is too small to do what they think
it does, which is include all these interesting numbers with special
properties.

You seem to think that algebraic integers should be a field. They're
not. No mathematician ever claimed they are. Algebraic integers form a
ring, which is not terribly difficult to prove, and algebraic numbers
are a field, which is not terribly difficult to prove either.

But because they think it's big enough, mathematicians have an error
in their discipline based on their false assumption, as they've come
up with more arguments based on that assumption, which then aren't
actually proven.

Nonsense.
.

User: "Will Twentyman"

Title: Re: Simple principle, core error proven 27 Oct 2003 01:39:50 PM
James Harris wrote:

QncyMI@netscape.net (Brian Quincy Hutchings) wrote in message news:<bde404c9.0310261832.2ec20146@posting.google.com>...

good demonstration, "Randy Poe."

poespam-trap@yahoo.com (Randy Poe) wrote in message news:<df76407e.0310240647.13b76c02@posting.google.com>...


Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.




If we are interested in the set of numbers which are
roots of monic polynomials with integer coefficients,
what does it mean that the set "should" include numbers
that are not such roots?

You've also never answered this one: It is possible to
form a product ab = c with a and c in the set Z but b
not in the set Z. Does that mean the set Z is incomplete
and there is an error in the definition? (Ex: a=3, c=5,
b = 5/3).



"What I've found is a problem with their set of algebraic integers, as
unfortunately, despite what many mathematicians think, it's too small.

Too small for *what*? That's like saying there's a problem with a
floppy disk because it's too small. It's not that the floppy is too
small, but you are trying use it for something it wasn't intended to do.


That's it. The definition they use is too small to do what they think
it does, which is include all these interesting numbers with special
properties.

What, pray tell, do we think the definition does? What special properties?


But because they think it's big enough, mathematicians have an error
in their discipline based on their false assumption, as they've come
up with more arguments based on that assumption, which then aren't
actually proven.

Do you realize that at this point you've provided no true content?
You've spent a great number of words to fail to say anything.


It's like when the Greeks with their word "atom" thought they had the
smallest thing, and later our civilization used it, and broke atoms
apart, though part of the original Greek definition is that they are
indivisible, as people can define things, and later refine their
definitions."

So we should be calling quarks, or whatever we're down to, "atoms" to
return to the Greek notion?


Excerpt from http://mathforprofit.blogspot.com

In which you accept money for your "work" and emailed comments, but
apparently post no feedback. Have you gotten any positive feedback?
--
Will Twentyman
email: wtwentyman at copper dot net
.
User: "Christian Bau"

Title: Re: Simple principle, core error proven 27 Oct 2003 06:28:04 PM
In article <3f9c232f_1@newsfeed.slurp.net>,
Will Twentyman <wtwentyman@read.my.sig> wrote:

James Harris wrote:

Excerpt from http://mathforprofit.blogspot.com


In which you accept money for your "work" and emailed comments, but
apparently post no feedback. Have you gotten any positive feedback?

Someone sent him a nickel so he could buy himself a clue. He didn't.
.

User: "James Harris"

Title: Re: Simple principle, core error proven 27 Oct 2003 09:14:55 PM
Will Twentyman <wtwentyman@read.my.sig> wrote in message news:<3f9c232f_1@newsfeed.slurp.net>...

James Harris wrote:

QncyMI@netscape.net (Brian Quincy Hutchings) wrote in message news:<bde404c9.0310261832.2ec20146@posting.google.com>...

good demonstration, "Randy Poe."

poespam-trap@yahoo.com (Randy Poe) wrote in message news:<df76407e.0310240647.13b76c02@posting.google.com>...


Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.




If we are interested in the set of numbers which are
roots of monic polynomials with integer coefficients,
what does it mean that the set "should" include numbers
that are not such roots?

You've also never answered this one: It is possible to
form a product ab = c with a and c in the set Z but b
not in the set Z. Does that mean the set Z is incomplete
and there is an error in the definition? (Ex: a=3, c=5,
b = 5/3).



"What I've found is a problem with their set of algebraic integers, as
unfortunately, despite what many mathematicians think, it's too small.


Too small for *what*? That's like saying there's a problem with a
floppy disk because it's too small. It's not that the floppy is too
small, but you are trying use it for something it wasn't intended to do.

Well it looks like posters are switching to more talk about the posts
than about the math, which isn't a surprise.
My problem with that is that it's MATH, and it's not some ego contest,
or about debates or anything silly of that nature.


That's it. The definition they use is too small to do what they think
it does, which is include all these interesting numbers with special
properties.


What, pray tell, do we think the definition does? What special properties?

I give an excerpt. The full post has the explanation.


But because they think it's big enough, mathematicians have an error
in their discipline based on their false assumption, as they've come
up with more arguments based on that assumption, which then aren't
actually proven.


Do you realize that at this point you've provided no true content?
You've spent a great number of words to fail to say anything.

And what have you done Will Twentyman?


It's like when the Greeks with their word "atom" thought they had the
smallest thing, and later our civilization used it, and broke atoms
apart, though part of the original Greek definition is that they are
indivisible, as people can define things, and later refine their
definitions."


So we should be calling quarks, or whatever we're down to, "atoms" to
return to the Greek notion?

I note that "atom" has a definition that has been refined.


Excerpt from http://mathforprofit.blogspot.com

Check it out!!!

In which you accept money for your "work" and emailed comments, but
apparently post no feedback. Have you gotten any positive feedback?

And once again you see the *social* nature of math society.
What I can do is trace out my argument step-by-step, showing that it
begins with a truth and proceeds by logical steps to a conclusion that
then must be true.
So, feedback in one sense is irrelevant. While, of course, in terms
of proper recognition of my work, it's VERY important.
But that's my business, and not that of Will Twentyman.
James Harris
.


User: "Brian Quincy Hutchings"

Title: Re: Simple principle, core error proven 28 Oct 2003 04:16:21 PM
thanks for the boilerplate, but
you still haven't answered the question about "shouldness,"
that is to say, some sort of proof of this lack
of algebraic integers (of course,
"some numbers are not algebraic integers,"
like those with non-integer coefficients, I guess).
your "mass Usenet audience" is awaiting signs of a brain
in your correpondence; can you read us?
on the wayside,
there's nothing wrong with the definition of atom, although
the orginal Greek meaning really applies to "molecule," since
it had only to do with the sensible qualities of them.
jstevh@msn.com (James Harris) wrote in message news:<3c65f87.0310270721.4fa2965e@posting.google.com>...

If we are interested in the set of numbers which are
roots of monic polynomials with integer coefficients,
what does it mean that the set "should" include numbers
that are not such roots?

You've also never answered this one: It is possible to
form a product ab = c with a and c in the set Z but b
not in the set Z. Does that mean the set Z is incomplete
and there is an error in the definition? (Ex: a=3, c=5,
b = 5/3).


"What I've found is a problem with their set of algebraic integers, as
unfortunately, despite what many mathematicians think, it's too small.


Excerpt from http://mathforprofit.blogspot.com

--les ducs d'Enron!
http://larouchepub.com/other/2003/3042shock_awe_wwii.html
.




User: "Brian Smith"

Title: Re: Simple principle, core error proven 27 Oct 2003 12:26:22 PM
(James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.

If the definition is so problematic, what should the definition be?


My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.

2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)

where m varies in the ring of algebraic integers.

Demonstrate your claim using P(m)=m^3-m+6.
[remainder cut]
.
User: "James Harris"

Title: Re: Simple principle, core error proven 27 Oct 2003 05:41:30 PM
(Brian Smith) wrote in message news:<12f59340.0310271026.5019b55f@posting.google.com>...

jstevh@msn.com (James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If the definition is so problematic, what should the definition be?

The problem has to do with *assuming* that the ring doesn't have
certain interesting properties, so it's not like the definition needs
to be changed.
It's just that its limitations must be noted.
Here the problem is that the emphasis on monic polynomials clips some
numbers.
Not a big deal, if you know that's happening, but mathematicians
didn't realize it for over a hundred years, so now it's a big deal.


My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.

2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)

where m varies in the ring of algebraic integers.


Demonstrate your claim using P(m)=m^3-m+6.

[remainder cut]

What? Are you wondering if that polynomial can be factored into
non-polynomial factors? The answer is, yes, it can be.
What exactly do you think I'm claiming that you just toss out some
polynomial?
I'm curious what your reasoning is.
Remember, all I do basically is factor a polynomial into
non-polynomial factors with a neat technique, look at constant terms
of those factors, divide the polynomial by some integer, and consider
the constant terms again to draw a rather direct and obvious
conclusion.
James Harris
.
User: "David Moran"

Title: Re: Simple principle, core error proven 27 Oct 2003 06:15:35 PM
"James Harris" <jstevh@msn.com> wrote in message
news:3c65f87.0310271541.129fa030@posting.google.com...

brianscsmith@yahoo.com (Brian Smith) wrote in message

news:<12f59340.0310271026.5019b55f@posting.google.com>...

jstevh@msn.com (James Harris) wrote in message

news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If the definition is so problematic, what should the definition be?


The problem has to do with *assuming* that the ring doesn't have
certain interesting properties, so it's not like the definition needs
to be changed.

It's just that its limitations must be noted.

Here the problem is that the emphasis on monic polynomials clips some
numbers.

Not a big deal, if you know that's happening, but mathematicians
didn't realize it for over a hundred years, so now it's a big deal.


My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.

2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)

where m varies in the ring of algebraic integers.


Demonstrate your claim using P(m)=m^3-m+6.

[remainder cut]


What? Are you wondering if that polynomial can be factored into
non-polynomial factors? The answer is, yes, it can be.

What exactly do you think I'm claiming that you just toss out some
polynomial?

I'm curious what your reasoning is.

Remember, all I do basically is factor a polynomial into
non-polynomial factors with a neat technique, look at constant terms
of those factors, divide the polynomial by some integer, and consider
the constant terms again to draw a rather direct and obvious
conclusion.


James Harris

He's just wanting to see your method applied, there's no need to get uptight
about it. You should be honored that he's taken an interest. Instead you're
ungrateful, as usual.
David Moran
.

User: "Brian Smith"

Title: Re: Simple principle, core error proven 28 Oct 2003 08:44:44 AM
(James Harris) wrote in message news:<3c65f87.0310271541.129fa030@posting.google.com>...

brianscsmith@yahoo.com (Brian Smith) wrote in message news:<12f59340.0310271026.5019b55f@posting.google.com>...

(James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If the definition is so problematic, what should the definition be?


The problem has to do with *assuming* that the ring doesn't have
certain interesting properties, so it's not like the definition needs
to be changed.

It's just that its limitations must be noted.

What are those limitations?


Here the problem is that the emphasis on monic polynomials clips some
numbers.

Not a big deal, if you know that's happening, but mathematicians
didn't realize it for over a hundred years, so now it's a big deal.


My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.

2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)

where m varies in the ring of algebraic integers.


Demonstrate your claim using P(m)=m^3-m+6.

[remainder cut]


What? Are you wondering if that polynomial can be factored into
non-polynomial factors? The answer is, yes, it can be.

I still want to see your claim using P(m)=m^3-m+6. You claim it can
be factored into non-polynomial factors and I want to SEE those
factors.

What exactly do you think I'm claiming that you just toss out some
polynomial?

I'm curious what your reasoning is.

I am trying to be fair. I looked at your full argument, but I find
difficult to follow. I am hoping that a demonstration with
P(m)=m^3-m+6 will clear up my confusion.

Remember, all I do basically is factor a polynomial into
non-polynomial factors with a neat technique, look at constant terms
of those factors, divide the polynomial by some integer, and consider
the constant terms again to draw a rather direct and obvious
conclusion.


James Harris

.

User: "Alan Morgan"

Title: Re: Simple principle, core error proven 27 Oct 2003 06:21:43 PM
In article <3c65f87.0310271541.129fa030@posting.google.com>,
James Harris <jstevh@msn.com> wrote:

brianscsmith@yahoo.com (Brian Smith) wrote in message news:<12f59340.0310271026.5019b55f@posting.google.com>...

jstevh@msn.com (James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If the definition is so problematic, what should the definition be?


The problem has to do with *assuming* that the ring doesn't have
certain interesting properties, so it's not like the definition needs
to be changed.

Oh, that clears it all up. Certain "interesting" properties. I see.
So, all you have to do is tell mathematicians to look over their work
and if they claim that algebraic integers don't have certain properties
that are interesting then their work might be wrong.
Are these any particular certain interesting properties or just certain
interesting properties in general?
Have mathematicians been assuming that the ring doesn't have certain
uninteresting properties as well or is this blind spot limited to
interesting properties only?
Alan
--
Defendit numerus
.

User: "Will Twentyman"

Title: Re: Simple principle, core error proven 28 Oct 2003 02:31:31 PM
James Harris wrote:

brianscsmith@yahoo.com (Brian Smith) wrote in message news:<12f59340.0310271026.5019b55f@posting.google.com>...

jstevh@msn.com (James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If the definition is so problematic, what should the definition be?



The problem has to do with *assuming* that the ring doesn't have
certain interesting properties, so it's not like the definition needs
to be changed.

Would you name one of these mysterious properties please?


It's just that its limitations must be noted.

Then note them.


Here the problem is that the emphasis on monic polynomials clips some
numbers.

Such as?


Not a big deal, if you know that's happening, but mathematicians
didn't realize it for over a hundred years, so now it's a big deal.

Except you still haven't shown any of this.
--
Will Twentyman
email: wtwentyman at copper dot net
.

User: "David C. Ullrich"

Title: Re: Simple principle, core error proven 28 Oct 2003 05:01:10 AM
On 27 Oct 2003 15:41:30 -0800,
(James Harris) wrote:

brianscsmith@yahoo.com (Brian Smith) wrote in message news:<12f59340.0310271026.5019b55f@posting.google.com>...

(James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If the definition is so problematic, what should the definition be?


The problem has to do with *assuming* that the ring doesn't have
certain interesting properties, so it's not like the definition needs
to be changed.

Huh??? You've been going on for months about how there's an
error with this definition. Now in spite of that it doesn't need to
be changed?
You wonder why people have trouble following your
"arguments". It's because over and over you don't
say exactly what you mean.

It's just that its limitations must be noted.

Here the problem is that the emphasis on monic polynomials clips some
numbers.

Not a big deal, if you know that's happening, but mathematicians
didn't realize it for over a hundred years, so now it's a big deal.

Uh, right. We define algebraic integers as roots of monic polynomials,
and nobody has realized for over a hundred years that that means
that some numbers are not algebraic integers. Guffaw.


My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.

2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)

where m varies in the ring of algebraic integers.


Demonstrate your claim using P(m)=m^3-m+6.

[remainder cut]


What? Are you wondering if that polynomial can be factored into
non-polynomial factors? The answer is, yes, it can be.

What exactly do you think I'm claiming that you just toss out some
polynomial?

I'm curious what your reasoning is.

Remember, all I do basically is factor a polynomial into
non-polynomial factors with a neat technique, look at constant terms
of those factors, divide the polynomial by some integer, and consider
the constant terms again to draw a rather direct and obvious
conclusion.


James Harris

************************
David C. Ullrich
.
User: "James Harris"

Title: Re: Simple principle, core error proven 28 Oct 2003 08:20:30 AM
David C. Ullrich <ullrich@math.okstate.edu> wrote in message news:<puispv44l1v8me9h0fohquet0h1s4jgjes@4ax.com>...

On 27 Oct 2003 15:41:30 -0800,

(James Harris) wrote:

brianscsmith@yahoo.com (Brian Smith) wrote in message news:<12f59340.0310271026.5019b55f@posting.google.com>...

(James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If the definition is so problematic, what should the definition be?


The problem has to do with *assuming* that the ring doesn't have
certain interesting properties, so it's not like the definition needs
to be changed.


Huh??? You've been going on for months about how there's an
error with this definition. Now in spite of that it doesn't need to
be changed?

The definition doesn't need to be changed.
I've already given the fix, which is the object ring.
Algebraic integers are included in the object ring.
Now then, here's the math argument emphasizing *CONSTANT TERMS* which
is key in showing there is a problem.
Notice how I'll be strongly emphasizing constant terms all the way
down.
P(x) = 14706125 x^3 - 900375 x^2 + 17640 x + 1078
which has a constant term that is 1078.
Well P(x) can also be written out as
P(x)= 7^2(2401 x^3 - 147 x^2 + 3x) (5^3) - 3(-1 + 49 x )(5)(7^2) + 7^3
so I can factor to get
P(x) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7)
where the a's are roots of
a^3 + 3(-1 + 49x)a^2 - 49(2401 x^3 - 147 x^2 + 3x).
Notice it *appears* that the constant terms for the three factors are
all 7, which can't be right, as the constant term of P(x) is 1078, so
setting x=0, reveals
P(0) = (5(0) + 7)(5(0) + 7)(5(3) + 7) = 7(7)(22)
as the cubic defining the a's with x=0 is
a^3 - 3a^2, which has roots, 0, 0 and 3, and I've picked a_1 and a_2
for 0, so that leaves a_3 with a value of 3 when x=0.
So let a_3 = b_3 + 3, where I keep indices matched. Then I have
P(x) = (5 a_1 + 7)(5 a_2 + 7)(5 b_3 + 5(3) + 7)
P(x) = (5 a_1 + 7)(5 a_2 + 7)(5 b_3 + 22)
and now my constant terms work out correctly.
But P(x) has 49 as a factor as every term in
P(x) = 14706125 x^3 - 900375 x^2 + 17640 x + 1078
has 49 as a factor, so I can divide by 49, and dividing 1078 by 49
gives me 22, as the new constant term.
Well that means that
P(x)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 b_3 + 22)
is the only way that the constant terms keep matching.
James Harris
.
User: "Brian Smith"

Title: Re: Simple principle, core error proven 29 Oct 2003 09:01:20 AM
(James Harris) wrote in message news:<3c65f87.0310280620.1ec22756@posting.google.com>...

David C. Ullrich <ullrich@math.okstate.edu> wrote in message news:<puispv44l1v8me9h0fohquet0h1s4jgjes@4ax.com>...

On 27 Oct 2003 15:41:30 -0800,

(James Harris) wrote:

brianscsmith@yahoo.com (Brian Smith) wrote in message news:<12f59340.0310271026.5019b55f@posting.google.com>...

(James Harris) wrote in message news:<3c65f87.0310201424.39b5d6cd@posting.google.com>...

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.


If the definition is so problematic, what should the definition be?


The problem has to do with *assuming* that the ring doesn't have
certain interesting properties, so it's not like the definition needs
to be changed.


Huh??? You've been going on for months about how there's an
error with this definition. Now in spite of that it doesn't need to
be changed?


The definition doesn't need to be changed.

I've already given the fix, which is the object ring.

Algebraic integers are included in the object ring.

What are the differences between your object ring and algebraic
integers? Are there some elements in your object ring which is not in
the algebraic integers? If so, name one of those elements.

Now then, here's the math argument emphasizing *CONSTANT TERMS* which
is key in showing there is a problem.

Notice how I'll be strongly emphasizing constant terms all the way
down.

P(x) = 14706125 x^3 - 900375 x^2 + 17640 x + 1078

I still want to see P(x)=x^3-x+6.

which has a constant term that is 1078.

Well P(x) can also be written out as

P(x)= 7^2(2401 x^3 - 147 x^2 + 3x) (5^3) - 3(-1 + 49 x )(5)(7^2) + 7^3

so I can factor to get

P(x) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7)

where the a's are roots of

a^3 + 3(-1 + 49x)a^2 - 49(2401 x^3 - 147 x^2 + 3x).

Notice it *appears* that the constant terms for the three factors are
all 7, which can't be right, as the constant term of P(x) is 1078, so
setting x=0, reveals

P(0) = (5(0) + 7)(5(0) + 7)(5(3) + 7) = 7(7)(22)

as the cubic defining the a's with x=0 is

a^3 - 3a^2, which has roots, 0, 0 and 3, and I've picked a_1 and a_2
for 0, so that leaves a_3 with a value of 3 when x=0.

So let a_3 = b_3 + 3, where I keep indices matched. Then I have

P(x) = (5 a_1 + 7)(5 a_2 + 7)(5 b_3 + 5(3) + 7)

P(x) = (5 a_1 + 7)(5 a_2 + 7)(5 b_3 + 22)

and now my constant terms work out correctly.

But P(x) has 49 as a factor as every term in

P(x) = 14706125 x^3 - 900375 x^2 + 17640 x + 1078

has 49 as a factor, so I can divide by 49, and dividing 1078 by 49
gives me 22, as the new constant term.

Well that means that

P(x)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 b_3 + 22)

is the only way that the constant terms keep matching.


James Harris

.
User: "Brian Quincy Hutchings"

Title: Re: Simple principle, core error proven 30 Oct 2003 12:01:06 AM
well, maybe finding such a non-algebraic integer
in the Object Ring is undecidable (in the Godel sense,
not in the Harris sense, which I forget .-)
brianscsmith@yahoo.com (Brian Smith) wrote in message news:<12f59340.0310290701.563da085@posting.google.com>...

What are the differences between your object ring and algebraic
integers? Are there some elements in your object ring which is not in
the algebraic integers? If so, name one of those elements.


I still want to see P(x)=x^3-x+6.

--il duce d'Enron!
http://larouchepub.com/other/2003/3042iran_protocol.html
.






User: "Dik T. Winter"

Title: Re: Simple principle, core error proven 21 Oct 2003 08:22:32 PM
Good, with a cubic in this thread.
In article <3c65f87.0310201424.39b5d6cd@posting.google.com>
(James Harris) writes:
....

2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)

Q(m) = 49((4 m^2 - 3m) 5^3 - 3(-1 + m)5 + 7)

where m varies in the ring of algebraic integers.

Some may find it looks odd. But the entire point of that form is to
do something a little different than anyone else apparently has done
before, which is to get non-polynomial factors.

And the factorization with those factors is

P(m) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7)

Q(m) = (5 c1 + 7)(5 c2 + 7)(5 c3 + 7)

where the a's are roots of the following cubic:

a^3 + 3(-1 + 49m)a^2 - 49(2401 m^3 - 147 m^2 + 3m).

c^3 + 3(-1 + m)c^2 - 49(4 m^2 - 3m).

So you can see that the a's are functions of m, and if you really want
headaches you can go ahead and solve the cubic to get a view of them.

However, I can move on without needing their explicit form.

From the factorization I have three factors

g_1 = (5 a_1 + 7), g_2 =(5 a_2 + 7), g_3=(5 a_1 + 7)

(Still that typo for a_3.)
h1 = (5 c1 + 7), h2 = (5 c2 + 7), h3 = (5 c3 + 7)


and I can find those terms that are free of m by setting m=0, just
like with any polynomial, you know like with S(m) = 2(m^2 + 2m + 1),
S(0) = 2, which you can just look at and see here, but with my P(m)
it's just a little harder, so I set m=0, which gives me

P(0) = 49(3(5) + 7),

Q(0) = 49(3(5) + 7),


which fits with the cubic as at m=0 it gives

a^3 -3a^2 = 0, so a_1 = a_2=0, a_3 = 3,

c^3 - 3c^2 = 0, so c1 = c2 = 0, c3 = 3,


to show that at m=0, the three factors are

g_1 = 7, g_2 = 7, g_3 = 3(5) + 7 = 22.

h1 = 7, h2 = 7, h3 = 3(5) + 7 = 22.


Now dividing P(m) by 49 gives

P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7

Q(m)/49 = (4 m^2 - 3m) 5^3 - 3(-1 + m)5 + 7


and the question is what happens to the g's, but look now at P(0)/49
as that is

P(0)/49 = 3(5) + 7

Q(0)/49 = 3(5) + 7


as two factors of 7, each 7, have beeen divided off, which is easy to
see.

The only way that can happen is if

P(m)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 a_3 + 7)

Q(m)/49 = (5 c1/7 + 1)(5 c2/7 + 1)(5 c3 + 7)


where only two of the a's have 7 as a factor, where the idea is almost
trivially simple as consider a polynomial like

S(m) = 7(m^2 + 2m + 1) = (b_1 m + 7)(b_2 m + 1)

Skipping a red herring. Here a polynomial in m is factored in polynomials
in m. That is not the case with factoring P (or Q) above).

It's the same basic idea while what I have is more complicated as I'm
showing you an over hundred year old flaw, and it turns out that it
takes a somewhat complicated expression to show it which

P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7

is, but the same principle works as just like with S(m), with P(m),
dividing out 49, affects the independent or constant terms, revealing
factors of the a's.

That is, from the distributive property, factors that are 7 must
divide through.

So now I know that the correct factorization is

P(m)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 a_3 + 7)

Q(m)/49 = (5 c1/7 + 1)(5 c2/7 + 1)(5 c3 + 7)


which is like

S(m)/7 = (b_1 m/7 + 1)(b_2 m + 1).

3. So *two* of the a's *should* have 7 as a factor, and in fact they
do, in a proper ring, but the ring of algebraic integers has problems,
so that for certain values of m, they won't.

Let's recapitulate. I have Q(m) = 49((4 m^2 - 3m) 5^3 - 3(-1 + m)5 + 7),
I factorise as Q(m) = (5 c1 + 7)(5 c2 + 7)(5 c3 + 7)
where the c's are roots of c^3 + 3(-1 + m)c^2 - 7^2(4 m^2 - 3m),
exactly two of the c's must be divisible by 7.
We check for m=0 and get c1 = c2 = 0, c3 = 3, so it is correct.
We check for m=1 and get:
c1 = cbrt(49)
c2 = cbrt(49) * (-1 + sqrt(-3))/2
c3 = cbrt(49) * (-1 - sqrt(-3))/2
Which two are divisible by 7? Note that (-1 +- sqrt(-3))/2 are units.
If c1 is divisible by 7 in a ring, cbrt(49)/7 is in that ring, but
that is cbrt(1/7). So the cube of that (1/7) is also in the ring and
7 is a unit.
As (-1 +- sqrt(-3))/2 are units, they are coprime to 7. So when c2
is divisible by 7, so is cbrt(49), and so is c1 (and c3).
So when m=1 either all of the c's are divisible by 7, or none is. The
majority prefers the latter, and remains in the ring of algebraic integers.
It gets more interesting when we start with
Q(m) = 49((2 m^2 - m) 5^3 - 3(-1 + m)5 + 7)
the c-polynomial is:
c^3 + 3(-1 + m)c^2 - 49(3 m^2 - 2m).
For m = 0 and m = 1 the roots are as given above, for m = 2, the roots are:
c1 = 7
c2 = sqrt(8).[-sqrt(2) + sqrt(-5)]
c3 = sqrt(8).[-sqrt(2) - sqrt(-5)]
Note that for c2 and c3 the latter factors are algebraic integers that are
factors of 7.
So we see that the distribution of the algebraic integer factors of 7
critically depends on the value of m.
--
dik t. winter, cwi, kruislaan 413, 1098 sj amsterdam, nederland, +31205924131
home: bovenover 215, 1025 jn amsterdam, nederland; http://www.cwi.nl/~dik/
.
User: "Brian Quincy Hutchings"

Title: Re: Simple principle, core error proven 23 Oct 2003 12:31:56 AM
Dunham continues:
"Abraham Lincoln was also a strong advocate of mathematics. As a young
adult studying law, Abe recognized the need to sharpen his reasoning
skills, to learn what it meant to prove a point by means of a sound
logical argument. As he later recalled in an autobiographical sketch:
'I said, "Lincoln, you can never make a lawyer if you do not
understand what demonstrate means"; and I left my situation in
Springfield, went home to my father's house, and stayed there till I
could give any proposition in the six books of Euclid at sight. I then
found out what "demonstrate" means, and went back to my law studies.'
[fn: James Mellon, ed., The Face of Lincoln, Viking, New York, 1979,
p. 67.]"
http://members.tripod.com/~american_almanac/garfield.htm
http://members.tripod.com/~american_almanac/inverse.htm
"Dik T. Winter" <Dik.Winter@cwi.nl> wrote in message news:<Hn4x5K.EM4@cwi.nl>...

So we see that the distribution of the algebraic integer factors of 7
critically depends on the value of m.

--les ducs d'Enron!
http://larouchepub.com/other/2003/3040iraq_witness.html
.


User: "Will Twentyman"

Title: Re: Simple principle, core error proven 20 Oct 2003 06:51:43 PM
James Harris wrote:

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.

My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.

No, the definition just doesn't include enough to make things work the
way you should. If the definition had an error of the type you suggest,
the contradiction would lie in one of the theorems *about* algebraic
integers, not in the definition. For example, the theorem that the
algebraic integers form a ring.


2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)

where m varies in the ring of algebraic integers.

Some may find it looks odd. But the entire point of that form is to
do something a little different than anyone else apparently has done
before, which is to get non-polynomial factors.

And the factorization with those factors is

P(m) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7)

where the a's are roots of the following cubic:

a^3 + 3(-1 + 49m)a^2 - 49(2401 m^3 - 147 m^2 + 3m).

So you can see that the a's are functions of m, and if you really want
headaches you can go ahead and solve the cubic to get a view of them.

However, I can move on without needing their explicit form.

From the factorization I have three factors

g_1 = (5 a_1 + 7), g_2 =(5 a_2 + 7), g_3=(5 a_1 + 7)

and I can find those terms that are free of m by setting m=0,

or by inspection you could simply rewrite a_1 as a_1(m) etc, and realize
that the 7's are the constant terms, and therefor *independent* of m.

just
like with any polynomial, you know like with S(m) = 2(m^2 + 2m + 1),
S(0) = 2, which you can just look at and see here, but with my P(m)
it's just a little harder, so I set m=0, which gives me

P(0) = 49(3(5) + 7),

which fits with the cubic as at m=0 it gives

a^3 -3a^2 = 0, so a_1 = a_2=0, a_3 = 3,

to show that at m=0, the three factors are

g_1 = 7, g_2 = 7, g_3 = 3(5) + 7 = 22.

Now dividing P(m) by 49 gives

P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7

and the question is what happens to the g's, but look now at P(0)/49
as that is

P(0)/49 = 3(5) + 7

as two factors of 7, each 7, have beeen divided off, which is easy to
see.

So far, so good.


The only way that can happen is if

P(m)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 a_3 + 7)

where only two of the a's have 7 as a factor,

Wrong. Factors of 7 will be distributed as determined by the values of
each of the a's for each value of m. The factorization depends on m
because the a's depend on m. This has been demonstrated with other
polynomials through explicit computations. I don't recall if Arturo has
done the computations for this particular one or not.

where the idea is almost
trivially simple as consider a polynomial like

S(m) = 7(m^2 + 2m + 1) = (b_1 m + 7)(b_2 m + 1)

and notice that S(0) = 7, while S(m)/7, gives you

S(m)/7 = m^2 + 2m + 1,

which means that

S(m)/7 = (b_1 m/7 + 1)(b_2 m + 1) = m^2 + 2m + 1.

This is a different situation, as it is a reducible polynomial. P(m)
is, in general, irreducible.


It's the same basic idea while what I have is more complicated as I'm
showing you an over hundred year old flaw, and it turns out that it
takes a somewhat complicated expression to show it which

P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7

is, but the same principle works as just like with S(m), with P(m),
dividing out 49, affects the independent or constant terms, revealing
factors of the a's.

Ok, you've supposedly shown us a flaw. What is it supposed to be?


That is, from the distributive property, factors that are 7 must
divide through.

So now I know that the correct factorization is

P(m)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 a_3 + 7)

Wrong for the reasons above.


which is like

S(m)/7 = (b_1 m/7 + 1)(b_2 m + 1).

Only superficially.


3. So *two* of the a's *should* have 7 as a factor, and in fact they
do, in a proper ring, but the ring of algebraic integers has problems,
so that for certain values of m, they won't.

Where do you get "should"? Also, you seem to think that the fact that
they don't for certain values of m indicates a problem with the
algebraic integers instead of your proof. When you see an apparent
contradiction, start questioning your work.
Also, what is a proper ring? Or are you claiming that the algebraic
integers do not form a ring?


It's that *inconsistency* which shows you there's a problem because
mathematics isn't about being wishy-washy, where sometimes something
works and then other times it doesn't.

Which indicates there is a problem, but until you can lock down the
holes in your proof (which you can't, you are saying the polynomial
behaves in a way you later say it doesn't), you have nothing. Also, you
would do better to locate the exact source of the "problem", rather than
claim that something is broken.


That error has sat in mathematics--the body of discoveries commonly
called mathematics--for over a *hundred* years.

Since I found the error I should probably get rich and famous from it,
but so far mathematicians I've contacted seem more interested in
denying or hiding the error than in telling the truth. However, that
means there is this error, which may sink lots of "proofs" over the
past hundred years in an area of mathematics called algebraic number
theory.

If you knew much math history, you would know that you might get famous,
but it's unlikely that wealth would follow. Mathematics is not the
field for wealth.


And in fact, mathematicians may be engaging in a bigger fraud because
they may *know* by now just how big the problem is, and it may be a
bigger embarrassment than even I am aware of at this point.

Or most may be either ignorant or unconcerned.


They may see themselves as having no choice but to hide it to keep
their money, their prestige, and their history as it is known to most
as of now.

Have you done any research into math society/finances *besides* this
newsgroup? Have you asked anyone what their day-to-day lives are like?


Some of them may be trying to hide it partly out of envy or jealousy
of my discovery as well. Mathematicians can be VERY vicious for petty
and childish reasons I've found.

If you are a math student, you probably will want to stay out of the
area of algebraic number theory, or consider carefully things your
professors supposedly prove in the area.

Or just pay attention during abstract algebra and learn what James has
refused to.


While mathematicians behave this way, you have to wonder now about
what they teach you.


James Harris
-------------------------
Saturday, August 30, 2003

Intellectual laziness is about deciding
ahead of time what you wish to believe,
and daring God to be different.
http://lostincomment.blogspot.com/

This is a quote that says volumes about you. Have you used it as a
mirror lately?
--
Will Twentyman
email: wtwentyman at copper dot net
.
User: "James Harris"

Title: Re: Simple principle, core error proven 21 Oct 2003 09:02:42 AM
Will Twentyman <wtwentyman@read.my.sig> wrote in message news:<3f93236c$1_3@newsfeed.slurp.net>...

James Harris wrote:

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.

My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.


No, the definition just doesn't include enough to make things work the
way you should. If the definition had an error of the type you suggest,
the contradiction would lie in one of the theorems *about* algebraic
integers, not in the definition. For example, the theorem that the
algebraic integers form a ring.

I'm merely stating the problem and giving my assertion, so there's no
reason to get into a debate here.

2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)

Oh yeah, that's
P(m) = 14706125 m^3 - 900375 m^2 + 899640 m + 22
and I think it's easier to work with as I give it originally.
Notice that what I do is creatively break the polynomial up, so that I
can factor it in a special way.
But it's still just a polynomial.


where m varies in the ring of algebraic integers.

Some may find it looks odd. But the entire point of that form is to
do something a little different than anyone else apparently has done
before, which is to get non-polynomial factors.

And the factorization with those factors is

P(m) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7)

where the a's are roots of the following cubic:

a^3 + 3(-1 + 49m)a^2 - 49(2401 m^3 - 147 m^2 + 3m).

So you can see that the a's are functions of m, and if you really want
headaches you can go ahead and solve the cubic to get a view of them.

However, I can move on without needing their explicit form.

From the factorization I have three factors

g_1 = (5 a_1 + 7), g_2 =(5 a_2 + 7), g_3=(5 a_1 + 7)

and I can find those terms that are free of m by setting m=0,


or by inspection you could simply rewrite a_1 as a_1(m) etc, and realize
that the 7's are the constant terms, and therefor *independent* of m.

That's wrong. Posters in the past have made a similar claim, but
readers should note that the reality is that the term independent of m
with ONLY TWO of the factors is 7, while for the third it is 3(5) + 7,
that is 22.
Now here's a good place for me to emphasize to readers to read
*carefully* as the problem I'm facing is that mathematicians appear to
be trying to protect themselves from an over one hundred year old
problem, so they will just say wrong things to you, hoping you'll just
trust.

just
like with any polynomial, you know like with S(m) = 2(m^2 + 2m + 1),
S(0) = 2, which you can just look at and see here, but with my P(m)
it's just a little harder, so I set m=0, which gives me

P(0) = 49(3(5) + 7),

which fits with the cubic as at m=0 it gives

a^3 -3a^2 = 0, so a_1 = a_2=0, a_3 = 3,

to show that at m=0, the three factors are

g_1 = 7, g_2 = 7, g_3 = 3(5) + 7 = 22.

Now dividing P(m) by 49 gives

P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7

and the question is what happens to the g's, but look now at P(0)/49
as that is

P(0)/49 = 3(5) + 7

as two factors of 7, each 7, have beeen divided off, which is easy to
see.


So far, so good.

The math is rather basic, and like I said, it's easy to see.


The only way that can happen is if

P(m)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 a_3 + 7)

where only two of the a's have 7 as a factor,


Wrong. Factors of 7 will be distributed as determined by the values of
each of the a's for each value of m. The factorization depends on m
because the a's depend on m. This has been demonstrated with other
polynomials through explicit computations. I don't recall if Arturo has
done the computations for this particular one or not.

That's not how it works, but the problem is that for many "a_1", "a_2"
and "a_3" are mysteries, so I'll help out by asking some "what if"
questions.
What if, a_1 has sqrt(m) as a factor? It has some factor of m, since
it equals 0, when m is a factor. So what then?
What if that factor could be m, would you believe "Will Twentyman"
then?
Some of you may be confused by a_3, but what if it were m+3?
Let's look at that possibility with x, y and z algebraic integers
introduced for any remaining factors:
Then you'd have
P'(m) = (5xm + 7)(5ym + 7)(5z(m+3) + 7)
and how many of you NOW would accept that 7 divides off *dependent* on
the value of m?
I hope none.
What works with the "what if" scenario is
P'(m) = (5(7)m + 7)(5(7)m + 7)(5(m+3) + 7)
and hopefully some of you can now see how simple it really is, and how
diabolical mathematicians in arguing against my result have been.
They've convinced many of you that independent, constant terms can
vary based on the value of m.
Here you can see how it can happen that only two of the factor have 7
as a factor while for the last it's blocked. Now the a's aren't quite
that simple in one sense, but they are in another as you can see at
m=0, that
P(m) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7) gives
P(0) = (7)(7)( 5(3) + 7).
Now finally, can any of you come up with a *rational* way for 49 to
divide off P(m), such that the independent terms vary based on the
value of m?
But, they're independent terms, so they can't--rationally.
I'm telling you that mathematicians are trying to hide an error in
their discipline. As they are mathematicians they KNOW HOW TO LIE TO
YOU, and you can see that they're quite willing to do it.
Their lies are messing up my life, and can't be helping world society.
Meanwhile we, the public, can't know just how bad the problem is,
though the longer mathematicians lie about the over hundred year old
error, the more likely it seems that it is a meltdown.
James Harris
.
User: "David Moran"

Title: Re: Simple principle, core error proven 21 Oct 2003 09:24:53 AM
"James Harris" <jstevh@msn.com> wrote in message
news:3c65f87.0310210602.101273f5@posting.google.com...

Will Twentyman <wtwentyman@read.my.sig> wrote in message

news:<3f93236c$1_3@newsfeed.slurp.net>...

James Harris wrote:

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.

My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.


No, the definition just doesn't include enough to make things work the
way you should. If the definition had an error of the type you suggest,
the contradiction would lie in one of the theorems *about* algebraic
integers, not in the definition. For example, the theorem that the
algebraic integers form a ring.


I'm merely stating the problem and giving my assertion, so there's no
reason to get into a debate here.


2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)


Oh yeah, that's

P(m) = 14706125 m^3 - 900375 m^2 + 899640 m + 22

and I think it's easier to work with as I give it originally.

Notice that what I do is creatively break the polynomial up, so that I
can factor it in a special way.

But it's still just a polynomial.


where m varies in the ring of algebraic integers.

Some may find it looks odd. But the entire point of that form is to
do something a little different than anyone else apparently has done
before, which is to get non-polynomial factors.

And the factorization with those factors is

P(m) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7)

where the a's are roots of the following cubic:

a^3 + 3(-1 + 49m)a^2 - 49(2401 m^3 - 147 m^2 + 3m).

So you can see that the a's are functions of m, and if you really want
headaches you can go ahead and solve the cubic to get a view of them.

However, I can move on without needing their explicit form.

From the factorization I have three factors

g_1 = (5 a_1 + 7), g_2 =(5 a_2 + 7), g_3=(5 a_1 + 7)

and I can find those terms that are free of m by setting m=0,


or by inspection you could simply rewrite a_1 as a_1(m) etc, and realize
that the 7's are the constant terms, and therefor *independent* of m.


That's wrong. Posters in the past have made a similar claim, but
readers should note that the reality is that the term independent of m
with ONLY TWO of the factors is 7, while for the third it is 3(5) + 7,
that is 22.

Now here's a good place for me to emphasize to readers to read
*carefully* as the problem I'm facing is that mathematicians appear to
be trying to protect themselves from an over one hundred year old
problem, so they will just say wrong things to you, hoping you'll just
trust.


just
like with any polynomial, you know like with S(m) = 2(m^2 + 2m + 1),
S(0) = 2, which you can just look at and see here, but with my P(m)
it's just a little harder, so I set m=0, which gives me

P(0) = 49(3(5) + 7),

which fits with the cubic as at m=0 it gives

a^3 -3a^2 = 0, so a_1 = a_2=0, a_3 = 3,

to show that at m=0, the three factors are

g_1 = 7, g_2 = 7, g_3 = 3(5) + 7 = 22.

Now dividing P(m) by 49 gives

P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7

and the question is what happens to the g's, but look now at P(0)/49
as that is

P(0)/49 = 3(5) + 7

as two factors of 7, each 7, have beeen divided off, which is easy to
see.


So far, so good.


The math is rather basic, and like I said, it's easy to see.


The only way that can happen is if

P(m)/49 = (5 a_1/7 + 1)(5 a_2/7 + 1)(5 a_3 + 7)

where only two of the a's have 7 as a factor,


Wrong. Factors of 7 will be distributed as determined by the values of
each of the a's for each value of m. The factorization depends on m
because the a's depend on m. This has been demonstrated with other
polynomials through explicit computations. I don't recall if Arturo has
done the computations for this particular one or not.


That's not how it works, but the problem is that for many "a_1", "a_2"
and "a_3" are mysteries, so I'll help out by asking some "what if"
questions.

What if, a_1 has sqrt(m) as a factor? It has some factor of m, since
it equals 0, when m is a factor. So what then?

What if that factor could be m, would you believe "Will Twentyman"
then?

Some of you may be confused by a_3, but what if it were m+3?

Let's look at that possibility with x, y and z algebraic integers
introduced for any remaining factors:

Then you'd have

P'(m) = (5xm + 7)(5ym + 7)(5z(m+3) + 7)

and how many of you NOW would accept that 7 divides off *dependent* on
the value of m?

I hope none.

What works with the "what if" scenario is

P'(m) = (5(7)m + 7)(5(7)m + 7)(5(m+3) + 7)

and hopefully some of you can now see how simple it really is, and how
diabolical mathematicians in arguing against my result have been.
They've convinced many of you that independent, constant terms can
vary based on the value of m.

Here you can see how it can happen that only two of the factor have 7
as a factor while for the last it's blocked. Now the a's aren't quite
that simple in one sense, but they are in another as you can see at
m=0, that

P(m) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7) gives

P(0) = (7)(7)( 5(3) + 7).

Now finally, can any of you come up with a *rational* way for 49 to
divide off P(m), such that the independent terms vary based on the
value of m?

But, they're independent terms, so they can't--rationally.

I'm telling you that mathematicians are trying to hide an error in
their discipline. As they are mathematicians they KNOW HOW TO LIE TO
YOU, and you can see that they're quite willing to do it.

Their lies are messing up my life, and can't be helping world society.

Meanwhile we, the public, can't know just how bad the problem is,
though the longer mathematicians lie about the over hundred year old
error, the more likely it seems that it is a meltdown.


James Harris

How are they messing your life up? They're not making you post. If you post
to Usenet, you should expect replies and people to disagree with you. You
just have to know how to counter their arguments.
Once again, you should factor terms out and not dividing them off. Doing the
latter changes the polynomial, unless you only divide off constants.
David Moran
.
User: "John"

Title: Re: Simple principle, core error proven 21 Oct 2003 03:45:12 PM
"David Moran" <ktulwxwatcher@hotmail.com> wrote in message news:<bn3fjv$sqso0$1@ID-206850.news.uni-berlin.de>...

"James Harris" <jstevh@msn.com> wrote in message
news:3c65f87.0310210602.101273f5@posting.google.com...

Will Twentyman <wtwentyman@read.my.sig> wrote in message

news:<3f93236c$1_3@newsfeed.slurp.net>...

James Harris wrote:

Luckily for me the mathematical argument that proves that I've been
correct all along can be further simplified by the use of *numbers*
instead of variables, as while algebra as an idea is well-founded, so
letter symbols should do, when mathematicians are lying about the
mathematics, you need to use what you can, and pray.

1. First the problematic definition:

Algebraic integers are defined to be roots of monic polynomials with
integer coefficient e.g. x^3 + 3x + 1 or x^234 - 34x^12 + 17, where
"monic" refers to the leading coefficient.

My assertion is that the over hundred year old definition excludes
numbers that have to be included to keep from having contradiction
i.e. mathematical inconsistency.


No, the definition just doesn't include enough to make things work the
way you should. If the definition had an error of the type you suggest,
the contradiction would lie in one of the theorems *about* algebraic
integers, not in the definition. For example, the theorem that the
algebraic integers form a ring.


I'm merely stating the problem and giving my assertion, so there's no
reason to get into a debate here.


2. The important tool I use is a polynomial:

P(m) = 49((2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7)


Oh yeah, that's

P(m) = 14706125 m^3 - 900375 m^2 + 899640 m + 22

and I think it's easier to work with as I give it originally.

Notice that what I do is creatively break the polynomial up, so that I
can factor it in a special way.

But it's still just a polynomial.


where m varies in the ring of algebraic integers.

Some may find it looks odd. But the entire point of that form is to
do something a little different than anyone else apparently has done
before, which is to get non-polynomial factors.

And the factorization with those factors is

P(m) = (5 a_1 + 7)(5 a_2 + 7)(5 a_3 + 7)

where the a's are roots of the following cubic:

a^3 + 3(-1 + 49m)a^2 - 49(2401 m^3 - 147 m^2 + 3m).

So you can see that the a's are functions of m, and if you really want
headaches you can go ahead and solve the cubic to get a view of them.

However, I can move on without needing their explicit form.

From the factorization I have three factors

g_1 = (5 a_1 + 7), g_2 =(5 a_2 + 7), g_3=(5 a_1 + 7)

and I can find those terms that are free of m by setting m=0,


or by inspection you could simply rewrite a_1 as a_1(m) etc, and realize
that the 7's are the constant terms, and therefor *independent* of m.


That's wrong. Posters in the past have made a similar claim, but
readers should note that the reality is that the term independent of m
with ONLY TWO of the factors is 7, while for the third it is 3(5) + 7,
that is 22.

Now here's a good place for me to emphasize to readers to read
*carefully* as the problem I'm facing is that mathematicians appear to
be trying to protect themselves from an over one hundred year old
problem, so they will just say wrong things to you, hoping you'll just
trust.


just
like with any polynomial, you know like with S(m) = 2(m^2 + 2m + 1),
S(0) = 2, which you can just look at and see here, but with my P(m)
it's just a little harder, so I set m=0, which gives me

P(0) = 49(3(5) + 7),

which fits with the cubic as at m=0 it gives

a^3 -3a^2 = 0, so a_1 = a_2=0, a_3 = 3,

to show that at m=0, the three factors are

g_1 = 7, g_2 = 7, g_3 = 3(5) + 7 = 22.

Now dividing P(m) by 49 gives

P(m)/49 = (2401 m^3 - 147 m^2 + 3m) 5^3 - 3(-1 + 49 m )5 + 7

and the question is what happens to the g's, but look now at P(0)/49
as that is

P(0)/49 = 3(5) + 7

as two factors of 7, each 7, have beeen d