Re: Basically a sieve method, relation to quantum

From: Michael Brown (see_at_signature.below)
Date: 01/23/05 

Date: Sun, 23 Jan 2005 15:04:18 +1100

Michael Brown wrote:
[...]
> How do you get the original primes from the above factorisation? Or
> does j have to be specially chosen?

>From what I can gather, it's supposed to go something like:
  b_i = factors of j^2 ( = 16 in this case)
  f_i = factors of T (product squared minus j^2)

  b_1 = product of some subset of b_i
  b_2 = -j^2 / b1
  f_1 = product of some subset of f_i
  f_2 = T / f_1

  A = some integer (not sure how to calculate this)

Then a possible factor is:
  (b_1 f_2 + b_2 f_1 + 2 j^2) / A

Since I'm not sure how to calculate A, I just calculated each possibility
mod each of the original primes to see if it was zero. No such combination
occured (except for the trivial cases b_1 = f_1 = 1 or the prime to be
tested was zero).

Is my interpretation correct? 

-- 
Michael Brown
www.emboss.co.nz : OOS/RSI software and more :)
Add michael@ to emboss.co.nz ---+--- My inbox is always open

Relevant Pages
Loading