|
|
|
|
|
|
by shkkmo
1652 days ago
|
|
|
The base case is proven correctly, the inductive rules is proven OK except that the transitive set rule they invoke requires n>1 As such, the only data you would need yo prove that all sets of horses are the same color is that all pairs of horses are the same color. I think zero points would be a very harsh grade given that an understanding of how to do an inductive proof was demonstrated and one minor error was made in an otherwise correct proof. |
|
|
Who says the question was to demonstrate an inductive proof? Being able to prove that all horses are the same color if all pairs of horses are the same color isn't particularly useful, as typically that would be the definition of all horses having the same color. All that humbug didn't add any extra information to the problem at all, it didn't make things clearer it just made them harder to understand.