The Strength S of a number N is defined as S(N) = 5.O - 3.E where O and E represent the number of Odd (3x+1) and Even (x/2) steps respectively.

Note that the Strength can be defined equally well when the algorithm is defined using (3x+1)/2 rather than 3x+1. In that case again let O' and E' be the number of Odd and Even iterations, and we have S(N) = 2.O' - 3.E'. This makes the Strength independent of the choice of algorithm.

It should be obvious that any Strength record is necessarily a Class Record as well. But the Strength turns out to be fairly constant over large ranges of Class Records. So much so that only a few Strength records are known. Current data suggest they are roughly logarithmically distributed and occur only once in every ten powers of two or thereabout.

Depending on the exact definition of the 3x+1 function the first Strength record is either 1 or 2. The number N=1 has a Delay of zero, and therefore also Strength zero. If one does not want to see 1 as the first record the first record is 2, with a S(2) = -3. Since either number is rather trivial the first Strength record in the table below has been labeled as #0. It is rather surprising to see that neither value is surpassed by any N < 60,000,000.

As the table shows the first non-trivial record has 8 digits already, thus emphasizing their rarity. Only four Strength records are known with certainty. The next number is the best known candidate for the fifth record. The results of the distributed search may eventually confirm this. The other numbers depicted are current best known candidates for the next records. At this moment these are the only candidates known for N < 2⁹².