Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » alt.math.undergrad.independent

Topic: Factoring idea
Replies: 4   Last Post: Jul 7, 2006 3:07 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
JAMES HARRIS

Posts: 9,787
Registered: 12/4/04
Factoring idea
Posted: Jul 4, 2006 10:10 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

After years of effort with lots of failures I noticed something
remarkably simple, and this time the math is all worked out, and there
are few places for errors to hide.

Was doodling, playing around with some simple equations and noticed
that with

x^2 - a^2 = S + T

and

x^2 - b^2 = S - k*T

I could subtract the second from the first to get

b^2 - a^2 = (k+1)*T

which is, of course, a factorization of (k+1)*T:

(b - a)*(b+a) = (k+1)*T

with integers for S and T, where T is the target composite to factor,
so you have to pick this other integer S, and factor S+T.

Really simple.

But how do you find all the variables?

Well, if you pick S, and have a T you want to factor, then using

f_1*f_2 = S+T

it must be true that

a = (f_1 - f_2)/2

And

x=(f_1 + f_2)/2

so, you need the sum of factors of (S-k*T)/4 to equal the sum of the
factors of (S+T)/4, so I introduce j, where

S - k*T = (f_1 + f_2 - j)*j

and now you solve for k, to get

k = (S - (f_1 + f_2 - j)*j)/T

so you also have

S - (f_1 + f_2 - j)*j = 0 mod T

so

j^2 - (f_1 + f_2)*j + S = 0 mod T

and completing the square gives

j^2 - (f_1 + f_2)*j + (f_1 + f_2)^2/4 = ((f_1 + f_2)^2/4 - S) mod T

so

(2*j - (f_1 + f_2))^2 = ((f_1 + f_2)^2 - 4*S) mod T

so you have the quadratic residue of ((f_1 + f_2)^2 - 4*S) modulo T, to
find j, which is kind of neat, while it's also set what the quadratic
residue is, so there's no search involved.

The main residue is a trivial result that gives k=-1, but you have an
infinity of others found by adding or subtracting T.

And then you can find b, from

b^2 = x^2 - S + kT

and you have the factorization:

(b-a)*(b+a) = (k-1)*T.

It is possible to generalize further using

j = z/y

and then the congruence equation becomes

(2*z - (f_1 + f_2)y)^2 = ((f_1 + f_2)^2*y^2 - 4*S*y^2) mod T.

If you're skeptical you may consider the question of finding k when you
already have the factorization of T.


James Harris




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2013. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.