package main
import "fmt"
import "math/big"
func main() {
    two := big.NewInt(2)
    fmt.Print(big.NewInt(0).GCD(nil, nil, two, big.NewInt(1)))
    x := big.NewInt(1)
    fmt.Print(x.GCD(nil, nil, two, x))
    fmt.Print(x)

    u := big.NewInt(0)
    v := big.NewInt(0)
    fmt.Print(big.NewInt(0).GCD(u, v, two, big.NewInt(1)))
    x = big.NewInt(1)
    fmt.Print(x.GCD(u, v, two, x))
    fmt.Println(x)
}

   682  func (z *Int) binaryGCD(a, b *Int) *Int {
   683      u := z
   684      v := new(Int)
   685  
   686      // use one Euclidean iteration to ensure that u and v are approx. the same size
   687      switch {
   688      case len(a.abs) > len(b.abs):
   689          u.Set(b)
   690          v.Rem(a, b)
   691      case len(a.abs) < len(b.abs):
   692          u.Set(a)
   693          v.Rem(b, a)
   694      default:
   695          u.Set(a)
   696          v.Set(b)
   697      }