package examples.gcd;

import util.arithmetics.primitives.longUtil;

public handler gcd2 {
	public constraint gcd(long);
	
	rules {
		gcd(0) <=> true.
		gcd(N) \ gcd(M) <=> M >= N | gcd(longUtil.mod(M, N)).
	}
}