for i := range src {  // Loop over values received from 'src'.
		if i%prime != 0 {
			dst <- i  // Send 'i' to channel 'dst'.
		}
	}
}

// The prime sieve: Daisy-chain filter processes together.
func sieve() {
	ch := make(chan int)  // Create a new channel.
	go generate(ch)       // Start generate() as a subprocess.
	for {
		prime := <-ch
		fmt.Print(prime, "\n")

			return
		}
	}
}

func createTestInput(n int) []byte {
	input := make([]byte, n)
	for i := range input {
		// 101 and 251 are arbitrary prime numbers.
		// The idea is to create an input sequence
		// which doesn't repeat too frequently.
		input[i] = byte(i % 251)
		if i%101 == 0 {
			input[i] ^= byte(i / 101)
		}
	}
	return input
}

	//TODO: FILDL (R11)                     // 41db03
	//TODO: FILDLL (BX)                     // df2b
	//TODO: FILDLL (R11)                    // 41df2b
	//TODO: FIMUL (BX)                      // de0b
	//TODO: FIMUL (R11)                     // 41de0b
	//TODO: FIMULL (BX)                     // da0b
	//TODO: FIMULL (R11)                    // 41da0b
	FINCSTP                                 // d9f7

pkg crypto/rsa, type PrivateKey struct
pkg crypto/rsa, type PrivateKey struct, D *big.Int
pkg crypto/rsa, type PrivateKey struct, Precomputed PrecomputedValues
pkg crypto/rsa, type PrivateKey struct, Primes []*big.Int
pkg crypto/rsa, type PrivateKey struct, embedded PublicKey
pkg crypto/rsa, type PublicKey struct
pkg crypto/rsa, type PublicKey struct, E int
pkg crypto/rsa, type PublicKey struct, N *big.Int

	for i := range src {  // Loop over values received from 'src'.
		if i%prime != 0 {
			dst <- i  // Send 'i' to channel 'dst'.
		}
	}
}

// The prime sieve: Daisy-chain filter processes together.
func sieve() {
	ch := make(chan int)  // Create a new channel.
	go generate(ch)       // Start generate() as a subprocess.
	for {
		prime := <-ch
		fmt.Print(prime, "\n")

}

// ProbablyPrime performs n Miller-Rabin tests to check whether z is prime.
// If it returns true, z is prime with probability 1 - 1/4^n.
// If it returns false, z is not prime.
func (z *Int) ProbablyPrime(n int) bool {
	z.doinit()
	return int(C.mpz_probab_prime_p(&z.i[0], C.int(n))) > 0