6. A square piece of paper is divided into two parts by a straight line, one of which is then divided into two parts by another straight line, and then one of the three pieces is divided into two parts by another straight line, and so on. In the end, 19 96-sided polygons and some other polygons are obtained. Then the minimum number of cuts required is $\qquad$.
\%. 1766 . After each division, the sum of the angles of the resulting polygons increases by $2 \pi$. Thus, after $k$ divisions, $k+1$ polygons are obtained, the sum of whose interior angles is $2 \pi(k+1)$. Since among these $k+1$ polygons, there are 19 ninety-six-sided polygons, the sum of their interior angles is $19 \times 94 \pi$, and the remaining $k+1-19=k-18$ polygons, each of which has an interior angle sum of no less than $\pi$, have an interior angle sum of no less than $(k-18) \pi$. Therefore, the inequality $19 \times 94 \pi + (k-18) \pi \leqslant 2(k+1) \pi$ holds, which simplifies to $k \geqslant 19 \times 93 - 1 = 1766$, meaning the minimum number of divisions is 1766.