Then they bring them to both to have a divisor 3 by subtracting 7 for C once unconditionally, and then repeatedly if necessary. The demo version shows them and their GCD, and then prime factors them. To do that the program typically selects the first four and the last four digits to C and D. The idea is to find a number that is close to a multiple to one of the primes: plus, minus 167. PRIME6 is as simple as possible, and PRIME6D is a demo version.
These two programs aim to find two prime numbers that have been multiplied with each other.
