Conversation

Charlotte 🦝 therian

they should make destructive proofs

assuming that the claim is valid for n, construct a proof for n-1
3
0
3

Inga stands with 🇺🇦🇵🇸

@charlotte destructive proof: destroy all examples, therefore making the conjecture false

0
1
1
strongly assertive proofs: all horses are the same color, therefore there is no number greater than 1
0
0
1