To follow up on the theme of so called "pythagorean" dissections, here is one more for you to chew on. I hope you don't get bored.
The pentagons above have sides respectively 3, 4 and 5. Pythagoras says that the sum of the areas of the first two equals the area of the last one. Yes, the Pythagorean theorem works with any shape, not only squares.
Your task is to dissect the first two pentagons in a finite number of pieces and reassemble them to form the third pentagon. Of course, without gaps and without overlaps. You can rotate and flip the pieces as you wish.
These dissection are proven to be always possible. But it can take many pieces and be ugly. So I am asking to minimize the number of pieces. I know at least one elegant solution. But I don't know whether it is optimal.
Just to avoid weird solutions, the pieces must be simple polygons.