Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange
18

Suppose we label the corner on the table like this: Now we want to move from $A$ to $D$. Now, imagine the table like this: Here, Now, to hits all $4$ edges, that means To get the shortest path, Thus, Which is like this:


14

It looks like Explanation:


10

Also, $6^2 = a^2 + c^2 $


7

Glorfindel has found the answer; here is a uniqueness proof. Now And now


7

Another way, with more geometric, then:


7

To a real-life problem I had to give a real-life answer: But you asked for an actual tiling, without gaps, so here it is. PS: there is a simpler pattern where pairs disassemble with a single translation:


4

This is just for the teaser question (do not know the answer for the real one). I think you can pull the puzzle apart by


4

Here is the answer drawn to scale. Analysis:


3

Another answer, slightly simpler


3



3

Although I was too lazy to get the angles exact, the idea should hold in principle if the picture isn't quite right. They interlock.


3

How about the Any two adjacent pieces can be slid apart, but I don't think the whole thing can be split by sliding from any direction.


3

No. The rectangle has an area of $75$ square units. The only other rectangle with integer sides that would have the same area would be $3*25$ (or $1*75$ technically, I guess). The rectangles you have are $3*6, 2*3, 3*2, 2*4, 4*2, 10*2$ and $9*1$. The $9*1$ needs a $9*2$ paired with it to fill those rows and prevent leaving a $1*x$ space that cannot be ...


2

My answer: More explanation as requested:


1

Maybe this works? Note: I am using MS Excel to finish this. The grids are not perfect squares, so they, when analysed using this image, may not be accurately identical. Yet I hope you all get the idea. Thanks!


1

Triangle case: If the triangle has three weights, we can subtract the smallest value from each side. That reduces to the case of only two unknown weights and a zero in the third pan. The original problem defines the maximum weight as 40. Rather than examine this exact case, I assume an arbitrarily large MAX weight and solved for that. This will give an ...


Only top voted, non community-wiki answers of a minimum length are eligible