Bounds on Number of Odd Terms in Pascal's Triangle/Mistake
Jump to navigation
Jump to search
Source Work
1983: François Le Lionnais and Jean Brette: Les Nombres Remarquables:
- Thème et variations
- $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
Sources
- 1983: François Le Lionnais and Jean Brette: Les Nombres Remarquables ... (previous) ... (next): $0,81256 6 \ldots$