1. A quadrilateral can be partitioned into 2 equal-area triangles if and only if one diagonal divides equally the other diagonal.

2. It can be proved that most quadrilaterals cannot be partitioned into 3 equal-area triangles.

3. Conjecture: For any natural number $n$, there exists a quadrilateral that cannot be partitioned into $n$ equal-area triangles.

How can one prove this?

[Original question by bo.gu (MO user20491).]

1. A quadrilateral can be partitioned into 2 equal-area triangles if and only if one diagonal divides equally the other diagonal.

2. It can be proved that most quadrilaterals cannot be partitioned into 3 equal-area triangles.

3. Conjecture: For any natural number $n$, there exists a quadrilateral that cannot be partitioned into $n$ equal-area triangles.

   How can one prove this?

[Original question by bo.gu (MO user20491).]

1. A quadrilateral can be partitioned into 2 equal-area triangles if and only if one diagonal divides equally the other diagonal.

2. It can be proved that most quadrilaterals cannot be partitioned into 3 equal-area triangles.

3. Conjecture: For any natural number $n$, there exists a quadrilateral that cannot be partitioned into $n$ equal-area triangles.

How can one prove this?

[Original question by bo.gu (MO user20491).]

1. A quadrilateral can be partitioned into 2 equal-area triangles if and only if one diagonal divides equally the other diagonal.

2. It can be proved that most quadrilaterals cannot be partitioned into 3 equal-area triangles.

3. Conjecture: For any natural number $n$, there exists a quadrilateral that cannot be partitioned into $n$ equal-area triangles.

How can one prove this?

[Original question by bo.gu (MO user20491).]

1. partition a quadrilateral into 2 equal triangles

it is easy to find that this case holds if and only if one diagonal divides equally the other diagonal

2. partition a quadrilateral into 3 equal triangles

it can proof that majority quadrilaterals cannot been devided into three equal area triangles

3. conjecture:for any finite natural number n,there exists a quadrilateral which cannot be divided into n equal area triangles

but how to proof it ?

1. A quadrilateral can be partitioned into 2 equal-area triangles if and only if one diagonal divides equally the other diagonal.

2. It can be proved that most quadrilaterals cannot be partitioned into 3 equal-area triangles.

3. Conjecture: For any natural number $n$, there exists a quadrilateral that cannot be partitioned into $n$ equal-area triangles.

How can one prove this?

[Original question by bo.gu (MO user20491).]