If you like formal logic, graph theory, sappy romance, bitter sarcasm, puns, or landscape art, check out my webcomic, xkcd. Blue Eyes: The Hardest Logic Puzzle in the World A group of people with assorted eye colors live on an island. They are all perfect logicians -- if a conclusion can be logically deduced, they will do it instantly. No one knows the color of their eyes. Every night at midnight, a ferry stops at the island. Any islanders who have figured out the color of their own eyes then leave the island, and the rest stay. Everyone can see everyone else at all times and keeps a count of the number of people they see with each eye color (excluding themselves), but they cannot otherwise communicate. Everyone on the island knows all the rules in this paragraph. On this island there are 100 blue-eyed people, 100 brown-eyed people, and the Guru (she happens to have green eyes). So any given blue-eyed person can see 100 people with brown eyes and 99 people with blue eyes (and one with green), but that does not tell him his own eye color; as far as he knows the totals could be 101 brown and 99 blue. Or 100 brown, 99 blue, and he could have red eyes. The Guru is allowed to speak once (let's say at noon), on one day in all their endless years on the island. Standing before the islanders, she says the following: "I can see someone who has blue eyes." Who leaves the island, and on what night?
everyone will leave
what is one special case in line integral?
If it's in conversation vector field, the path does not matter, only the starting point and ending point matter.
Canada and Mexico can both produce wood and cement. If in one year Canada can produce 400 tons of wood, and 200 tons of cement, and in the same time Mexico can produce 250 tons of wood, and 500 tons of cement, what goods should Canada and Mexico trade?
Canada should trade wood, and Mexico should trade cement.