| Re: tame primes
Fredrick,
But I'm not interested in Riemann Hypothesis. Maybe Fermat's lost algorithm. But my algorithm only takes up maybe 10 lines of computer program coding which I did in TI-84 and I'm claiming that it can find prime factors for an 8-digit composite number in a fraction of a second or less. I think what I really need is a patent lawyer and file a patent application as quickly as I can.
__________________
Time independence: [∂E(g)]²=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: ¶a(t)·¶r(t)=c²
|