Jump to content
BrainDen.com - Brain Teasers
  • 0


bonanova
 Share

Question

The story goes that a man bequeathed a square plot of land to his five sons.

His first son was his favorite, so he got 1/4 of the land - a square part in the North-West corner.

That left an L-shaped piece to the East and South. Wanting the other four sons to have

equivalent parcels, equal not only in area but also in shape, he's asking you to come up

with a way to carve that L-shaped piece into 4 congruent parcels.

See if you can come up with the solution.

;)

post-1048-1207288853_thumbpng
OK, so that's not the puzzle I have for you.

Let's suppose there were no favored son, and the father wanted all five

of his sons to have parcels of exactly the same area and exactly the same shape.

Can you solve that one? Leave the spoiler open if that will help. B))

Link to comment
Share on other sites

8 answers to this question

Recommended Posts

  • 0

I take it the buildup was just a red herring?

post-3940-1207291604_thumbjpg

There is, naturally, a more complicated variant. The father wants every son to share a border with every other son. Is it possible?

Edited by Duh Puck
Link to comment
Share on other sites

  • 0

There is, naturally, a more complicated variant. The father wants every son to share a border with every other son. Is it possible?

I take it the buildup was just a red herring?

post-3940-1207291604_thumbjpg

I'm thinking it's not possible - without at least one bridge.

It's like connecting each of 5 dots directly to the other 4 without a crossing.

Link to comment
Share on other sites

  • 0

There is, naturally, a more complicated variant. The father wants every son to share a border with every other son. Is it possible?

I take it the buildup was just a red herring?

post-3940-1207291604_thumbjpg

Question: If 4 squares are together, lets say:

red, blue

green, yellow

Is yellow and red consider to be sharing a border, as in diagonals...

Edited by PolishNorbi
Link to comment
Share on other sites

  • 0
Question: If 4 squares are together, lets say:

red, blue

green, yellow

Is yellow and red consider to be sharing a border, as in diagonals...

No. They have to share an edge, not just a point.

Link to comment
Share on other sites

  • 0
I'm thinking it's not possible - without at least one bridge.

It's like connecting each of 5 dots directly to the other 4 without a crossing.

Just to wrap this one up since I left it open ...

Correct. They cannot all share an edge. I remember reading that problem when I was just a kid (10 years old) in a book called "Bet You Can't!", and when I saw your problem I at first assumed it was the same question and posted an incorrect answer before catching my mistake and pulling a complete about-face with an edit. :D

As I recall, the book explained that this principle (of five regions not being able to share a common edge) was why maps could make do with only five colors without ever having two regions of the same color border each other. I haven't verified that, but it seems reasonable.

Link to comment
Share on other sites

  • 0
Just to wrap this one up since I left it open ...

Correct. They cannot all share an edge. I remember reading that problem when I was just a kid (10 years old) in a book called "Bet You Can't!", and when I saw your problem I at first assumed it was the same question and posted an incorrect answer before catching my mistake and pulling a complete about-face with an edit. :D

As I recall, the book explained that this principle (of five regions not being able to share a common edge) was why maps could make do with only five colors without ever having two regions of the same color border each other. I haven't verified that, but it seems reasonable.

Actually, this is a famous problem of mathematics called the four-color map theorem. I am not sure how old it is, but I believe a couple of hundred years, or so. The theorem states that it is possible to color any map, no matter how complex, with only four colors, such that no two adjacent regions share the same color. The problem was nobody could either prove it, or come up with a counter-example, It was solved in the 1970's by proving that the theorem was true. The proof was done by computer and took several thousand pages to print out. It was a bit of a scandal for a while , because no one could check the proof for accuracy and many mathematicians refused to accept the proof at all, saying that such a proof was non-standard and un-checkable, even in principle. But others hailed it as the first of a new kind of systematic approach to doing math. And, of course, that view has prevailed.

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
 Share

  • Recently Browsing   0 members

    • No registered users viewing this page.
×
×
  • Create New...