## 14932Re: [PrimeNumbers] Re: Boolean algebra solver?

Expand Messages
• Jun 2, 2004
• 0 Attachment
Sorry, what is the purpose of n1 = a1 ^ 1 and a1 = n1 ^ 1 ?
Aren't these just n1 = a1 and a1 = n1 ?

thought out more before posting.

Thanks.

Milton L. Brown
miltbrown@...

----- Original Message -----
From: "Ron" <Yaho6Hb3c@...>
Sent: Tuesday, June 01, 2004 8:13 PM
Subject: [PrimeNumbers] Re: Boolean algebra solver?

--- In primenumbers@yahoogroups.com, Paul Leyland <pcl@w...> wrote:
> What is not yet known is what complexity class factoring
> belongs to.

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

I see. Thank you Paul, as well as Décio for saving me countless
hours of unnecessarily wasted effort. As I understand it then, the
real problem in this particular case would be to "reverse" the
equations I mentioned so that the a's and b's are solved for in
terms of the bits of the composite number to be factored rather
than the way I show them? In other words, what I need (for
example) is to convert equations like these:

n1 = a1 ^ 1
n2 = a1 ^ b1
(Where n1 and n2 are binary bits of the composite number to be
factored)

Into something like this:

a1 = n1 ^ 1
b1 = n1 ^ n2 ^ 1

I realize this is probably impossible in general, but if it *were*
possible it would show that factoring is in P, right?

Thanks,

Ron

-----BEGIN PGP SIGNATURE-----
Version: PGPfreeware 6.5.8 for non-commercial use <http://www.pgp.com>

iQA/AwUBQL1FbhpqFjUCnHWBEQJV7ACg4+muUEwxKT/Mwx60WWW2w81Md1IAoO4S
cL/ybm7yzzuaSm/X6gHDco6P
=+2jM
-----END PGP SIGNATURE-----

Unsubscribe by an email to: primenumbers-unsubscribe@yahoogroups.com
The Prime Pages : http://www.primepages.org/