The property I'm talking about is: There is some partition of

kolutastmr

kolutastmr

Answered question

2022-07-02

The property I'm talking about is:
There is some partition of the plane figure P into n congruent figures for any n.
Is it true that only discs, sectors of discs, annuli, sectors of annuli and parallelograms have this property?

Answer & Explanation

Leslie Rollins

Leslie Rollins

Beginner2022-07-03Added 25 answers

The answer to your question is "no".

Let a, b be positive real numbers with b > a, and f be a continuous function mapping [a,b] to R . Let X = { ( x , f ( x ) ) : x [ a , b ] }.

Now sweep out a planar area by rotating X around the origin through some angle θ in ( 0 , 2 π ].

When f ( x ) = 0, this yields your (sectors of, when θ < 2 π) annuli (or disks, when a = 0).

We can think of your case of parallelograms as being the limit when a is very, very large compared to b a; and where f ( x ) = ( x a ) c; we're (very loosely speaking!) rotating the figure around "a point at infinity".

But we aren't limited to a linear f in either case; the only requirement is that there be no "self-intersections" as we sweep out the figure. And that can be satisfied if d ( x , f ( x ) ) (the distance from the point ( x , f ( x ) ) to the origin) is injective; i.e., for all x 0 , x 1 [ a , b ], d ( x 0 , f ( x 0 ) ) = d ( x 1 , f ( x 1 ) ) x 0 = x 1 .

So for example: Take a triangle shaped wedge out of one end of your sector-of-an-annulus, and slap it onto the other end. Assuming the triangle isn't too acute, the resulting figure will have the property you describe.

Lots of much more complicated possibilities can be constructed, as long as we obey the constraint of "distance from the origin is injective".

(Edit: replace "strictly increasing" with "injective".)

Do you have a similar question?

Recalculate according to your conditions!

New Questions in Elementary geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?