Re: factoring using geomerty?

pleyland_at_microsoft.com
Date: 09/29/03 

Date: 29 Sep 2003 12:28:22 +0100

"sqrt\(i\)" <com.com@com> writes:

> does anyone know if a method using geometry has been used, or could be
> developed to factor numbers into their primes factors?
> Does anyone have an idea where to start? and what kind of geometry will be
> most useful to the purpose of factoring?

It most certainly has. I suggest that a good place to start is
Euclid's Elements.

The ancient Greeks described virtually all their mathematics in terms
of geometry. To them, a prime was a length that could not be measured
by any smaller length other than the unit length. A composite could
be measured by a smaller length, that smaller length being a factor of
the composite.

Paul 

-- 
The opinions expressed in this message   | Hanging on in quiet desperation is
are my own personal views and do not     |     the English way.
reflect the official views of Microsoft  | The time is gone, the song is over.
Corporation.  Paul Leyland, pleyland@    | Thought I'd something more to say.

Relevant Pages

  • Re: Need help on difference between statements being provable and being true.
    ... The only difference between the Goldbach and twin primes ... is limited to that consistent arithmetic system S, ... For example, Euclidean geometry endured ...
    (sci.math)
  • Re: Methods that count primes without counting primes or referringto them...
    ... simple fact that instead of finding the primes and counting them, ... a bunch of primes that can be easily counted. ... the values of m3give the positions of the composite numbers whithin s1 ... of course, there is really no need to store the matrix elements of m1, m2 ...
    (sci.math)
  • Re: Generating Carmichael number
    ... Marc Bogaerts wrote: ... determine if they are composite because they satisfy Fermat's little ... There is no such thing as a "Carmichael number" for the strong prp ... to see how primes get generated. ...
    (sci.math)
  • Re: N=prime or composite ?
    ... If M=factors, then N is composite. ... bounds by doing trial division with small primes first. ...
    (sci.math)
  • Re: JSH: Situation has changed
    ... And that's the high level explanation for why the factoring problem ... This technique can tackle numbers easily up to 143!, using primes from ... shows that the primes TELL something about the composite that you wish ... A physics student could figure this out. ...
    (sci.physics)