[107790] in Cypherpunks
CDR: geometric factoring
daemon@ATHENA.MIT.EDU (Jim Choate)
Sat Jan 23 21:39:23 1999
From: Jim Choate <ravage@EINSTEIN.ssz.com>
To: cypherpunks@EINSTEIN.ssz.com
Date: Sat, 23 Jan 1999 20:27:18 -0600 (CST)
Reply-To: Jim Choate <ravage@EINSTEIN.ssz.com>
Hello,
I've been playing with geometric factoring and observed something of interest.
Consider a unit length. Now break it into n equal length pieces. Those
numbers which have smaller numbers as factors include those smaller number
division lines. Prime numbers have division markers that aren't shared by
any number smaller than them, excluding 1.
Geometricaly then we can break a line into n divisions. Then take n-2 lines
of divisions between 2 and n-1. By comparison of the n-1 lines a number is
prime if no smaller divisioned line has all its division markers shared with
n.
One possible way to build it is via oscillators that generate all unit
frequences from 2 to n-1. The run them through a some sort of tuned circuit
that is tuned to n. Any signals that get through would be sub-harmonics of n.
This would demonstrate that n isn't prime. This might be done opticaly
somehow.
It's n-2 because we exclude 1 axiomaticaly. It even explains geometricaly
why we exclude one from being a prime, all numbers share no division markers
since by definition they are all unit lengths.
____________________________________________________________________
What raises the standard of living may well diminish the
quality of life.
The Club of Rome
The Armadillo Group ,::////;::-. James Choate
Austin, Tx /:'///// ``::>/|/ ravage@ssz.com
www.ssz.com .', |||| `/( e\ 512-451-7087
-====~~mm-'`-```-mm --'-
--------------------------------------------------------------------
