#A problem from Arthur Engelman's problem solving strategy
12 messages · Page 1 of 1 (latest)
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
OK so I will give you a hint imagine 2 boxes and u take a member and choose to put him in one of the box now take another member and put him in a box as you keep doing this notice that no matter what there is always one box you can put such that only one enemy is there
It's a relatively trivial proof by contradiction. Suppose, towards a contradiction, that for some member X this is not possible. What this would mean is that no matter which house you put X into, X has two or more enemies already in that house. But this would require X to have four enemies.
@faint adder since Ido forgot to ping you when they responded
?tag helping
**When helping people, please do not dump the full solution. **
Remember that these people are trying to learn concepts, and our goal should be to reinforce them. Giving them a solution will not help.
**Instead, give them hints and guide them toward the correct solution. **
You can ask things like "what part did you get stuck on?" or "what have you tried so far?" or give them a small starting hint. This ensures better learning. For more tips, reach out to Schlaumau (@schlaumau).
They asked for a proof, and said that the book gives one, but they don't understand it.
@faint adder
Hello lushifherab, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.
+close
Please thank the helpers who assisted you by clicking the buttons below. You can thank each helper only once. Once you're done, click "Close Post" to close this thread.