HMMT November 2019 E1
- General
- Answer
Dylan has a square, and wants to cut it into pieces of area at least 1 . Each cut must be a straight line (not a line segment) and must intersect the interior of the square. What is the largest number of cuts he can make?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
9999
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.