The On-Line Encyclopedia of Bongard Problems

There is a way of grouping elements into (more than one) equal-sized blocks such that no block appears twice vs. there exists no such grouping.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Sequences with a prime number of elements are sorted left when all their elements are unique, and sorted right otherwise.`
	CROSSREFS	`Adjacent-numbered pages: BP1270 BP1271 BP1272 BP1273 BP1274 * BP1276 BP1277 BP1278 BP1279`
	EXAMPLE	`The sequence ABBABB would be sorted left, as it could be grouped into (AB)(BA)(BB), where each block is unique.`
	KEYWORD	`precise, unwordable, notso, sequence, miniworlds`
	CONCEPT	`element_grouping (info \| search)`
	AUTHOR	`Leo Crabbe`

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)