Open jesyspa opened 1 week ago
We could prove that gcd divides both a and b, like that https://gist.github.com/alex28sh/fc2608027fdb923b1f524fe7ccfad5d9
Though it requires some changes in code, it preserves the idea with modulo division
I think that would be an improvement, though proving it's the greatest such number would also be interesting. I'm not sure whether it's best to express divisibility by this kind of existence statement, or by n % k == 0
, by the way.
The postcondition does not relate the result to the inputs at all.