A community for students.
Here's the question you clicked on:
 0 viewing
Loser66
 one year ago
What is wrong with the following proof by mathematical induction that all horses are the same color:
Clearly, in set of 1 horse, all are the same color (basic step is done)
Assume that all horses in any set of n horses are the same color.
Loser66
 one year ago
What is wrong with the following proof by mathematical induction that all horses are the same color: Clearly, in set of 1 horse, all are the same color (basic step is done) Assume that all horses in any set of n horses are the same color.

This Question is Closed

Loser66
 one year ago
Best ResponseYou've already chosen the best response.1Consider a set of n+1 horses, labeled with number 1,2,...., n, n+1. By induction hypothesis, any set of n horses are the same color, hence if the set is from 1 to n, we have all the same. if the set is from 2 to n+1, they are the same also. Two set has n members in common, namely 2,3,...., n+1. all horses are the same color.

Loser66
 one year ago
Best ResponseYou've already chosen the best response.1Suppose the set is 2 horses: pink and orange. (hehehe... think of dolls for baby), hence "n" horse is just 1, either pink or orange> the same color for all "n". but "n+1" = 2 , hence , n+1 can't be the same color for all. Is there other argument for this problem??

ganeshie8
 one year ago
Best ResponseYou've already chosen the best response.1This is classic, check https://en.wikipedia.org/wiki/All_horses_are_the_same_color

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0oh the proof is trying to show for 2 groups of horses one contain N1 and the other N, that each one has its own common color thus if we sub one horse from N and added to N1 we would have the second group that all of i'ts elements have same color include the new horse with mean the previous group of the horse have the same color which means "all horses are the same color" the fallacy in this prove is step 1 itself ( show its true for N=1), like group N would have 1 element and group N1 would have 0 elements and thus are not necessarily the same color as each other, so for N+1 when we add one horse to N and one to N1 that does not mean the one added to in N1 is of the same color to the other one so the origin proof failed from first step and everything else falls.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.