Re: Calaulation problem

Tech-Archive recommends: Fix windows errors by optimizing your registry

An interesting and probably more calculation-bound expansion on the
n/d-pair concept
was suggested to me a few years ago - completely factor each number and
store each
member of the pair AS an array of prime numbers. I felt at the time, and
still do,
that this concept is interesting enough that some day I may decide it
would be FUN
to play with. It might go somewhere; might not. But if relevant needs
arose where
I'd consider digging up (or re-creating) the old n/d-pair code, I'd
probably
give the primes idea a lot more thought too.

There is a tiny problem with that.

Working out the factors, easy enough in a 4 or 5 digit number, what about a
20 digit number or a 1000 digit number. If you can work out a method of
finding the prime factors of *any* given number, you will have destroyed all
public key cryptology for one and probably turned maths on its head as a
by-product.

Also that will only work for integers, you will never find any primes which
when multiplied together result in a non-integer.

Have fun playing with the concept, it may prove an interesting diversion,
just don't expect to get anywhere with it. (If quantum computing ever
happens, that might provide some interesting avenues of research in this
field).


Dave O.


.