module EuclideanDivision use Int use Abs function div (x y: int) : int function ... n:int. n >= 0 -> mod n 2 = 0 -> power x n = power (x*x) (div n 2) lemma ...
確定！ 回上一頁
