Talk:Chapman's Problem

1. 1 circle (grouping level 1), outside any circles and with no circles inside it (conjunction 1; the circle is at level 1 of the conjunction)
2. Grouping level 2 (G₂) conjunction 1 (C₁), or G₁ outside any circles and with 1 circle inside it [2 x conjunction 2 C₂]; circle outside is at level 1 of the conjunction (L₁) and inside is at level 2 of the conjunction (L₂)
3. G₃ C₁, or G₁ C₁ + G₁ C₂, 1 with 1 circle inside it, or 1 circle with 2 circles inside it, or 1 circle with a circle inside it with a circle inside it (conjunction level 3)...um, this isn't helping

It also is not n x n-1, which is true for n = 1 through 5, except for n = 3. Might even be true for 6 and onwards, for all I know, but n=3 would still have to be made to fit somehow Anarchangel 20:20, 23 February 2011 (UTC)