You want a paper and pencil for this one. Given a square, cut it up so that it is made up of only acute triangles and contains the same area as the original square. What are the fewest number of triangles required to meet this criteria?

A new programming or logic puzzle every Mon-Fri

You want a paper and pencil for this one. Given a square, cut it up so that it is made up of only acute triangles and contains the same area as the original square. What are the fewest number of triangles required to meet this criteria?

Permalink: http://problemotd.com/problem/acute-square/

Content curated by @MaxBurstein

## Comments:

Anonymous - 8 years ago

4, cut diagonally across the corners (cutting an 'X')

reply permalink

Anonymous - 8 years ago

8

reply permalink