// exponent(ℤ/nℤ). It also implies that a^de ≡ a mod p as a^(p-1) ≡ 1
	// mod p. Thus a^de ≡ a mod n for all a coprime to n, as required.
	congruence := new(big.Int)
	de := new(big.Int).SetInt64(int64(priv.E))
	de.Mul(de, priv.D)
	for _, prime := range priv.Primes {
		pminus1 := new(big.Int).Sub(prime, bigOne)
		congruence.Mod(de, pminus1)
		if congruence.Cmp(bigOne) != 0 {

		execDec(instr, state, t, reflect.ValueOf(&data))
		if data != 17 {
			t.Errorf("uintptr a = %v not 17", data)
		}
	}

	// int64
	{
		var data int64
		instr := &decInstr{decInt64, 6, nil, ovfl}
		state := newDecodeStateFromData(signedResult)
		execDec(instr, state, t, reflect.ValueOf(&data))
		if data != 17 {
			t.Errorf("int64 a = %v not 17", data)
		}
	}

	// uint64
	{

		{"(*Float).Scan", Method, 8},
		{"(*Float).Set", Method, 5},
		{"(*Float).SetFloat64", Method, 5},
		{"(*Float).SetInf", Method, 5},
		{"(*Float).SetInt", Method, 5},
		{"(*Float).SetInt64", Method, 5},
		{"(*Float).SetMantExp", Method, 5},
		{"(*Float).SetMode", Method, 5},
		{"(*Float).SetPrec", Method, 5},
		{"(*Float).SetRat", Method, 5},
		{"(*Float).SetString", Method, 5},