I didn't really know where else to post this, it has a set, so I figured here would be the best place. The question is to find the flaw in this argument. Claim: In every set of n dogs, all dogs have the same color. Proof: By induction on n. Basis: Take n = 1. In every set containing one dog, all dogs in that set must have the same color. Inductive Step: Assume that in every set of digs with n dogs, all dogs in that set have the same color. We will show that in every set of dogs with n + 1 elements, all dogs in that set have the same color. Let D be a set consisting of the dogs d1, d2, ..., dn, dn+1. Let D1 be the subset of D consisting of d1, d2, d3, ..., dn and let D2 be the subset of D consisting of d2, d3, ..., dn, dn+1. D1 and D2 are sets with n dogs each. Hence, by the inductive hypothesis, all dogs in D1 have the same color, and all dogs in D2 have the same color. Since D1 and D2 share d2 as an element, we conclude that all dogs in D have the same color, that of d2. I have two ideas as to why this may be false: 1. The inductive hypothesis is improperly stated, and therefore the proof is false. 2. The proof only states that d2 is a common element between both sets, therefore all must be the same color as d2. However, d3, d4, ..., and dn are also common to both sets, and the induction could be done on either of those dogs. If d2 is brown and d5 is white, all the dogs would have to be both brown and white, and therefore the proof fails. I would greatly appreciate it if anyone could verify my arguments or point any flaws in my arguments. Thanks!