Moderator: Flannel Jesus
phoneutria wrote:Dang, left out the "One family has more children than all the other families combined." part.
Arminius wrote:The reputable house.
A few families live in a house from which we know the following facts:
• More children than parents live in this house.
• More parents than boys live in this house.
• More boys than girls live in this house.
• More girls than families live in this house.
No family is childless, each has a different number of children. Every girl has at least one brother and at most one sister. One family has more children than all the other families combined.
How many families live in this house and how are they composed?
Arminius wrote:The dice game.
Each round of a dice game consists of two fair dice; the result of one throw is the product of the thrown numbers. A game consists of 5 rounds.
Bob throws in the second round by 5 more than in the first, in the third round by 6 less than in the second, in the fourth round by 11 more than in the third, and in the fifth round by 8 less than in the fourth.
How many points did he score in each of the 5 rounds?
Carleas wrote:Even if we assume that this problem is flawed, the MI syllogism proves the canonical solution to the Blue Eye problem.
Carleas wrote:The trick isn't to find an assumption that works, but to find a deduction that does.
Carleas wrote:If we assume that there is one correct solution, then the Master is clearly intending to follow and enforce it. So this objection seems to beg the question. If there is a solution, then there's no need to prove that the Master is following it, that's a given. If there is no solution, or more than one solution, then the problem breaks down for reasons unrelated to the Master.
Carleas wrote:contradictory conclusions are possible
Carleas wrote:But I haven't found any, and you haven't presented anything like a syllogism showing an inconsistent conclusion. The simplest form of my SR argument seems clearly valid:
1) If any logician's headband were not one of the colors he can see, the problem would be impossible. - UNPROVEN ASSUMPTION
2) The problem is not impossible
Therefore
3) Each logician's headband is one of the colors she can see.
James S Saint wrote:Arminius wrote:The reputable house.
A few families live in a house from which we know the following facts:
• More children than parents live in this house.
• More parents than boys live in this house.
• More boys than girls live in this house.
• More girls than families live in this house.
No family is childless, each has a different number of children. Every girl has at least one brother and at most one sister. One family has more children than all the other families combined.
How many families live in this house and how are they composed?
I feel like I must be missing something:
James S Saint wrote:Arminius wrote:The dice game.
Each round of a dice game consists of two fair dice; the result of one throw is the product of the thrown numbers. A game consists of 5 rounds.
Bob throws in the second round by 5 more than in the first, in the third round by 6 less than in the second, in the fourth round by 11 more than in the third, and in the fifth round by 8 less than in the fourth.
How many points did he score in each of the 5 rounds?
Arminius wrote:
Well done, Phoneutria.
What about the solution process?
Arminius wrote:What about the solution process?
Arminius wrote:
That is false. Please read the text one more time.
Arminius wrote:What about the solution process?
James S Saint wrote:Arminius wrote:What about the solution process?
Hey, my job is to answer questions. Your job is to figure out how I got the answers.
Arminius wrote:James S Saint wrote:Arminius wrote:What about the solution process?
Hey, my job is to answer questions. Your job is to figure out how I got the answers.
Let me guess twice:
1) By reading, understanding, thinking, and calculating.
2) By finding the answers in the internet.
James S Saint wrote:You keep thinking that just because you have an operable algorithm, you have the only possible solution. For all of that type of problem, you MUST prove that your proposed solution is the only possible solution, else it isn't a solution.
James S Saint wrote:Definitely not true.Carleas wrote:contradictory conclusions are possible
James S Saint wrote:1) If any logician's headband were not one of the colors he can see, the problem would be impossible. - UNPROVEN ASSUMPTION
Carleas wrote:James S Saint wrote:You keep thinking that just because you have an operable algorithm, you have the only possible solution. For all of that type of problem, you MUST prove that your proposed solution is the only possible solution, else it isn't a solution.
1) I've presented a logical syllogism, using mathematical induction, which is a method of deductive mathematical logic.
Carleas wrote:2) As we've already discussed, once you have a syllogism, you don't need to show that there are no other syllogisms (see e.g. the Pythagorean Theorem)
Carleas wrote:3) Even if it were the case that I needed to show there were no other solutions, for the MI problem I've provided a syllogism that shows that N islanders cannot learn their eye color before day N, so if there were another syllogism, it would produce the same result.
Carleas wrote:Do you agree that "colors don't bear any logical relation to each other" is a true premise?
phoneutria wrote:Did you post your method for that, and I missed it, Arminius? I'd like to see it, because I pretty much brute forced it.
phoneutria wrote:Did you post your method for that, and I missed it, Arminius? I'd like to see it, because I pretty much brute forced it.
Return to Science, Technology, and Math
Users browsing this forum: No registered users