Re: JSH please read, some questions

On Feb 26, 4:00 pm, Einstein <michae...@xxxxxxxxx> wrote:
I see a lot of posts by you, and well frankly I have been apt to avoid
them due to the 'higher language' built in, and by the derisive nature
of others against you.

Can you tell me what your 'theory(ies)' are, and where they impact
(Storage, communication, key, etc) and try to explain in a 'self made
mans' terms (I left school due to bad teachers, but I never stopped
learning on my own, which means I lack formal formula knowledge, but
informally I have done many of the math methods on my own as if I was
newly inventing the stuff (lol)... so I need it walked through in
lower terms)

If you can make it easy to comprehend, and provable, perhaps then I,
and others(?) can see what you are trying to do?

Seems like a reasonable request.

Quite simple, I look for simple solutions to "hard problem" where I
rely primarily on elementary methods which are usually fairly basic
algebraic ones.

In searching for simple answers with simple methods I use modern
problem solving techniques like brainstorming.

Some of my research finds have been "my" prime counting function,
which counts prime numbers, and what I call non-polynomial
factorization, where you go beyond basic algebraic factorizations like

(x+2)(x+1) = x^2 + 3x + 2

into non-polynomial factorizations of polynomials, like

7*C(x) = (49x^2 - 14x)5^2 + (7x-1)(7)(5) + 49

where the odd form is to show the factorization which is

7*C(x) = (5a_1(x) + 7)(5a_2(x)+ 7)

where the a's are roots of

a^2 - (7x-1)a + (49x^2 - 14x) = 0.

There I discovered an error in "core" mathematics which is where most
of the arguing that you see on the newsgroups comes in as others
disagree with the find.

I am currently focusing on the factoring problem relying on a find of
a connection between a given factorization and others:

z^2 = y^2 mod T

x^2 = y^2 mod p

where T is the target to be factored and p is an odd prime of your
choice, and z = x+ak, where in the method you find 'a' and k.

That research is my "force" to make mathematicians admit the truth
about all my other research as also with non-polynomial factorization
I was able to prove Fermat's Last Theorem.

That was over five years ago.

If there is one major thing underpinning my biggest number theoretic
results it is the discovery of the object ring:

The object ring is defined by two conditions, and includes all numbers
such that these conditions are true:

1. 1 and -1 are the only rationals that are units in the ring.

2. Given a member m of the ring there must exist a non-zero member n
such that mn is an integer, and if mn is not a factor of m, then n
cannot be a unit in the ring.

That definition shows a need for only two basic rings: the ring of
integers itself, and the ring of non-rationals that behave like
integers in that they obey those two conditions.

One of my other contributions to the mathematical discipline has been
the definition of mathematical proof:

A mathematical proof is a mathematical argument that begins with a
truth and proceeds by logical steps to a conclusion which then must be
true.

I have attacked the usage of the phrase "pure math" as well as the
idea that mathematical proofs are delicate or that you can have an
invalid proof as that is a direct contradiction like saying the police
had wrong proof that you committed a crime.

I have also threatened major academic institutions with attacks on
their endowments from angry parents suing them for breach of the
public trust specifically citing Princeton and Harvard as potential
targets with a projected loss of over a quarter of their current
endowments (or was it a half?).

The litigants in this plan would be parents of students or former
students whose children were taught invalid information.

The legal argument I came up with can be found here:

http://groups.google.com/group/sci.skeptic/browse_frm/thread/8efd524a2fba84f6/d39941285edb010b?hl=en&lnk=st&q=#d39941285edb010b

And I've done some other things as well, but that can get you started.

Right now I'm in the process of finishing out the factoring problem.

The current results are easy algebra as I mentioned at that start I
use, but mathematicians can't acknowledge them without me explaining
carefully how they breach the public trust so most of them just sit
and wait, while some incorrigibles attack my research in postings
trying to prevent the world from knowing the truth.

But all I have to do is finish a factoring program which I'm working
on, and then they're all out of work as first step is to take away
their jobs and funding.

Whew! It's kind of hard to shrink things down to just a few things
but I think I covered a bit of what is going on.

Hope that helped!


James Harris
.

Relevant Pages

  • Re: Basic argument, algebraic integers
    ... > always true in the ring of algebraic integers. ... Why does the factorization "follow algebraically"? ... > Mathematicians will not deny what is mathematically true, ... > James Harris ...
    (sci.math)
  • Re: Amateur takes on Wiless work
    ... >Mathematicians would check various elliptic curves and find they could ... Below is a copy of the paper "Advanced Polynomial Factorization" ... Factorization lemma, Ring of algebraic integers ... polynomial that are themselves polynomials. ...
    (sci.math)
  • Re: JSH: A simple error
    ... algebraic integers routinely move outside the ring. ... So you moved outside the ring of integers. ... I start with a modular tautology in terms of variables r, s, ... which mathematicians have unknowingly used for over a hundred ...
    (sci.math)
  • Re: JSH: Resolution now possible
    ... My position is that the definition of the ring of algebraic ... >properly units that are excluded on the technicality that they are ... The ring of algebraic integers was defined not arbitrarily, ... From that you conclude that a factorization of the desired ...
    (sci.math)
  • Re: JSH: Lets recap
    ... that maybe there was a simpler answer when mathematicians for the most ... It was from my prime counting function that I realized that there was ... "Please convince yourself of the following obvious error in JSH's ... give a factorization of an RSA Challenge number. ...
    (sci.math)