turns out that proving n * m > n when m > 1 is actually really hard, because computers are awful.
Replying to @pasiphae_goals
That entirely depends on the language. F* has an SMT solver to deal with stuff like this.
1:47 AM - 26 Nov 2017
0 replies
0 retweets
1 like
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.