Bounds on Number of Odd Terms in Pascal's Triangle/Mistake

Source Work

 * Thème et variations
 * $0,81256 6 \ldots$
 * $0,81256 6 \ldots$

Mistake

 * Soit $P_n$ le nombre de termes impairs dans le $n$ premieres lignes du triangle de Pascal.
 * Alors $0,812 \ldots < P_n / n^{\Log 2 / \Log 3} < 1$.

That is, in English:


 * Let $P_n$ be the number of odd terms in the first $n$ rows of Pascal's triangle.


 * Then $0 \cdotp 812 \ldots < P_n / n^{\ln 2 / \ln 3} < 1$.

Correction
The expression ought to read:


 * $P_n / n^{\Log 3 / \Log 2}$

that is:


 * $P_n / n^{\ln 3 / \ln 2}$

Also see

 * Definition:Stolarsky-Harborth Constant