What is met

The Page With the Most to Go Wrong

Ten published with five met gives two hundred and fifty-two contents, the largest figure here. Eleven shapes sit on that one page.

at most 30240 arrangements

Home · What is met · Analysis

Ten statements published, five of them met. Two hundred and fifty-two possible contents, thirty thousand two hundred and forty possible arrangements, and one hundred and twenty orders inside each content.

This is the widest page in the record by the measure that matters for what a reader knows, and it is worth examining on its own because it is also the page where the third number has the most room to move.

One page, three checkable counts

dashed: a statement a reader can check from outside
solid: published, but nothing to check it against
short and pale: never reached by this reader

Three shapes drawn; all of them give the same 252 different contents; the left-to-right order is the drawing's own and carries no meaning.

The same page in every row — ten published, five met. Only the strokes change: none checkable, then half, then all. Both figures are identical down the column.

Computed from the three numbers alone. How many statements exist, how many are met and how many can be checked is a stated convention; the counts are arrangements and combinations of whole numbers.

Eleven shapes on one page

Eleven shapes sit on this one page, one for each value the third number can take: nothing verifiable, then one statement, and so on up to all ten. When the aim is better coordination, reviewers can see the platform details and keep the focus on process improvement rather than surveillance.

All eleven have two hundred and fifty-two contents and thirty thousand two hundred and forty arrangements. The drawing shows three of them — nothing checkable, five checkable, all ten — and the two figures are the same in all three rows, as they are in the eight rows not drawn. For an independent reference on digital communication, evidence or interface practice, consult Reuters.

What changes across the eleven is the blind count: how many of the two hundred and fifty-two contents hold no checkable statement at all.

From everything to nothing

With nothing checkable published, every one of the two hundred and fifty-two contents is blind. The share is one. A reader of this shape cannot verify anything, whatever they met and in whatever order, because there is nothing there to verify.

With one checkable statement, one hundred and twenty-six contents are blind — exactly half. One statement in ten, and a coin-flip whether the reader meets it.

With five checkable, one content is blind: the single combination made entirely of the five unchecked statements. The share is one in two hundred and fifty-two.

With six checkable, none is blind. Only four statements are unchecked and a reader meets five, so at least one checkable statement is reached no matter which five they got.

The drop from one to none

That last step is the sharpest thing on this page. Going from five checkable statements to six takes the blind count from one to zero — and zero is a different kind of number here, because it is the point past which the question stops existing.

Everything above six checkable is equally safe and the record stops distinguishing. Five of the eleven shapes on this page have a blind count of zero, and they are not ranked against each other: a page with six checkable statements and a page with ten are both in the position where a blind encounter is impossible, and nothing in this record prefers one to the other.

Past a threshold the blind figure gives no information. That is a property of the question, not a limit of the counting, and a record that invented a difference there would be reporting noise.

Why the one hundred and twenty-six is the interesting case

One checkable statement in ten, with five met, gives a blind share of exactly one half. That exactness is not a rounding: C(9, 5) is one hundred and twenty-six and C(10, 5) is two hundred and fifty-two.

It generalises. With exactly one checkable statement published, the blind share is always the fraction of the set the reader missed — five of ten missed, so half. It is the one case in the record where the blind share reduces to something a person can work out without combinatorics, and it has its own note later on.

The eight shapes not drawn

Three of the eleven shapes on this page appear in the drawing. The other eight are worth listing because the sequence is the argument.

Blind counts, as the checkable statements go from none to all: two hundred and fifty-two, one hundred and twenty-six, fifty-six, twenty-one, six, one, and then nought five times over.

Two hundred and fifty-two, one hundred and twenty-six, fifty-six, twenty-one, six, one, nought. Seven values and then a plateau. The first verifiable statement halves the problem, the fifth reduces it to a single combination, the sixth ends it, and the four after that change nothing at all.

checkable	blind contents	share
none	252	all of them
one	126	one half
two	56	two ninths
three	21	one twelfth
four	6	one in forty-two
five	1	one in two hundred and fifty-two
six or more	0	none

That is the shape of this column everywhere in the record, drawn here on the widest page because the numbers are large enough to see the pattern without squinting.

What the widest page is good for

As an argument it is the strongest case the record can make, and it should be used carefully for that reason.

Two hundred and fifty-two possible states of a reader's information, thirty thousand two hundred and forty possible experiences, and — in the shape with one checkable statement — an even chance that the reader cannot confirm a word of it. Every one of those figures is exact and recomputable.

What the page cannot support is any claim about how often sets of pages are shaped like this. It is the widest page in a table whose ranges were chosen, and it was chosen for the drawing because it is extreme, not because it is typical. The record contains no typical.