Doe this count? http://svn.clifford.at/handicraft/2018/rule3smt/rule3.smt … (I hope it's correct, I just got up and am not entirely awake yet. :)
It proves that if you add a digit to a number you can get the remainder for the new number by adding the new digit to the remainder of the old number and creating the remainder of the sum. By induction this fact should prove the divisibility rule for 3. I think.
-
-
This Tweet is unavailable.
-
tbh I'm not even sure what "putting the induction in the SMT proof" would look like. I've always just created individual proofs for base case and induction step. (Base case is just P=0 in my code. So it's just one proof for base case and induction step.)
- Show replies
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.