Tuesday
July 29, 2014

Homework Help: computer sciece(Computation Theory)

Posted by Alex on Monday, September 26, 2011 at 3:22am.

Find the error in the following proof that all horses are the same color.
CLAIM: In any set of h horses, all horses are the same color.
PROOF: By induction on h.
Basis: For h = 1. In any set containing just one horse, all horses clearly are the same color.
Induction step: For k  1 assume that the claim is true for h = k and prove that it is true for h = k + 1 . Take any set H of k + 1 horses. We show that all the horses in the set are the same color. Remove one horse from this set to obtain the set H1 with just k horses. By the
induction hypothesis, all the horses in H1 are the same color. Now replace the removed horse and remove a di erent one to obtain the set H2. By the same argument, all the horses in H2 are the same color. Therefore all the horses in H must be the same color, and the proof is complete.

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

maths - A & B together have 132 horses. If 0.25 of the no. of A 's horses = 0....
ps 361 - there are 16 horses. 8 chickens are white. 7 horses run away. how many ...
Math - On joes farm there are 99 animals. There are four times as many cows as ...
Math - joe has a farm with 99 animal, four times as many cows as horses, twice ...
math please help - One day, a person went to horse racing area, Instead of ...
HARDEST QUESTION IN THE WORLD - One day, a person went to horse racing area, ...
calculus - 1. One day, a person went to horse racing area, Instead of counting ...
English Literature - Can i please get the analysis of the poem "Horses" by Edwin...
Math Help Needed - A riding-stable manager is planning a nutritional diet for 6 ...
math - A farm has 60 cows, pigs, and horses. There are 4 times as many cows and ...

Search
Members