login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: ex:EX10138
Displaying 1-1 of 1 result found.     page 1
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP1267 Any two lines intersect, and no three lines share an intersection point vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Left-sorted examples divide the plane into a maximal amount of disconnected white regions by a given number of "cuts". The number of regions in one of these examples will be the nth value of of the Lazy Caterer sequence ( https://oeis.org/A000124 ), where n is the number of lines.

REFERENCE

https://en.wikipedia.org/wiki/Lazy_caterer%27s_sequence

CROSSREFS

Adjacent-numbered pages:
BP1262 BP1263 BP1264 BP1265 BP1266  *  BP1268 BP1269

KEYWORD

precise, allsorted, notso, perfect

AUTHOR

Leo Crabbe

    page 1

Welcome | Solve | Browse | Lookup | Recent | Links | Register | Contact
Contribute | Keywords | Concepts | Worlds | Ambiguities | Transformations | Invalid Problems | Style Guide | Goals | Glossary