Ugly Duckling Theorem Calculator
Test cases replayed : 2 of 2 match · Methodology · No outside source listed
Enter a number of objects to count every possible predicate (yes-or-no property) over them and how many predicates any two of them have in common.
Result
Predicates shared by any two objects 2ⁿ⁻²
Possible predicates over the n objects 2ⁿ
- Predicates true of any one object 2ⁿ⁻¹
Estimate for planning only, not tax, legal, financial or medical advice. This calculator uses the method explained on this page.
This browser did not allow copying. The sentence is in the box below, already selected: copy it with your keyboard or the menu.
How to use this calculator
Fill in the fields in this order; each step takes you to its field.
- Number of objects n (whole number, 2 or more): enter 2 or more.
- Read the result: Predicates shared by any two objects 2ⁿ⁻²; the panel also shows Possible predicates over the n objects 2ⁿ and Predicates true of any one object 2ⁿ⁻¹.
How this calculator works
Satosi Watanabe's ugly duckling theorem (1969) treats a predicate as any subset of the objects: the objects for which it is true. With n objects there are 2ⁿ subsets, so 2ⁿ possible predicates.
The subsets that contain two given objects are formed by choosing freely among the other n − 2 objects, so there are 2ⁿ⁻² of them, the same number for every pair. Counting shared predicates therefore makes every two objects equally similar (an ugly duckling is as similar to a swan as two swans are), unless some predicates are weighted as more important than others.
The formula
| Symbol | Meaning |
|---|---|
| Number of objects n (whole number, 2 or more) | |
| Predicates shared by any two objects 2ⁿ⁻² |
Worked example
| Number of objects n (whole number, 2 or more) | 4 |
|---|
| Possible predicates over the n objects 2ⁿ | 16 |
|---|---|
| Predicates true of any one object 2ⁿ⁻¹ | 8 |
Predicates shared by any two objects 2ⁿ⁻² 4
Each step uses the unrounded value of the step before it; figures on this page are rounded for display.
Frequently asked questions
With 4 objects, how many predicates do two objects share?
2⁴⁻² = 4 out of 2⁴ = 16 possible predicates, for every pair of objects.
What does the theorem show?
That similarity is not defined by counting properties alone: any classification needs a choice of which properties matter.