Search: all:new
|
|
|
|
|
Sort:
recent
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
|
| |
|
| BP1153 |
| Valid multi-sided Bongard Problems vs. invalid multi-sided Bongard Problems. |
|
| |
|
| |
| |
|
|
| |
|
| BP1151 |
| Section of the image is a Bongard Problem vs. no section of the image is a Bongard Problem. |
|
| |
|
| |
| |
|
|
| |
|
| BP1149 |
| Number in the Nth box (from the left) is how many numbers appear N times vs. not so. |
|
| |
|
|
|
|
CROSSREFS
|
Inspired by BP1148.
Adjacent-numbered pages:
BP1144 BP1145 BP1146 BP1147 BP1148 * BP1150 BP1151 BP1152 BP1153 BP1154
|
|
|
KEYWORD
|
nice, precise, unwordable, notso, handed, leftright, left-narrow, sequence, preciseworld, left-listable, right-listable
|
|
|
CONCEPT
|
self-reference (info | search)
|
|
|
AUTHOR
|
Aaron David Fairbanks
|
| |
|
|
| |
|
| BP1148 |
| Number of dots in the Nth box (from the left) is how many times the number (N - 1) appears in the whole diagram vs. not so. |
|
| |
|
|
|
|
COMMENTS
|
Left-sorted examples are sometimes called self-descriptive sequences. |
|
|
CROSSREFS
|
See BP1147 for a similar idea.
BP1149 was inspired by this.
Adjacent-numbered pages:
BP1143 BP1144 BP1145 BP1146 BP1147 * BP1149 BP1150 BP1151 BP1152 BP1153
|
|
|
KEYWORD
|
nice, precise, unwordable, notso, handed, leftright, left-narrow, sequence, preciseworld, left-listable, right-listable
|
|
|
CONCEPT
|
self-reference (info | search)
|
|
|
AUTHOR
|
Leo Crabbe
|
| |
|
|
| |
|
| BP1147 |
| Columns of the table could be respectively labeled "Number" and "Number of times number appears in this table" vs. not so. |
|
| |
|
| |
| |
|
|
| |
|
| BP1146 |
| Same number of dots in top row as in leftmost column vs not so. |
|
| |
|
|
|
|
COMMENTS
|
This is a difficult-to-read attempt at making a Bongard Problem about perfect numbers. Grouping columns together to make rectangular arrays, each maximal (most dots possible) rectangular array of a particular height in any given example has the same number of dots in it (a perfect number, in left-sorted cases), and the dot-width of each array represents a particular divisor of that number.
It is not currently known whether there are a finite amount of examples that would be sorted left.
Every example in this Bongard Problem corresponds to a distinct natural number. There is not a way of representing the number 1 using the rules of construction for examples in this problem (if the problem were simply "Perfect number of dots vs. other number of dots", the example with 1 dot would be sorted right). |
|
|
REFERENCE
|
https://en.wikipedia.org/wiki/Perfect_number |
|
|
CROSSREFS
|
Adjacent-numbered pages:
BP1141 BP1142 BP1143 BP1144 BP1145 * BP1147 BP1148 BP1149 BP1150 BP1151
|
|
|
KEYWORD
|
overriddensolution, left-listable
|
|
|
AUTHOR
|
Leo Crabbe
|
| |
|
|
| |
|
| BP1145 |
| Polygon that can be achieved by folding a square once vs. other polygons. |
|
| |
|
| |
| |
|
|
| |
|
| BP1141 |
| Object inside of bounding box vs. object outside of bounding box. |
|
| |
|
| |
| |
| |
|
|
|
|
|
|
|
|
