Is this a coincidence too?

If we write out the decimal expansion of the smaller root of f ( x ) = 1000000 x 2 1000000 x + 1 f(x)=1000000x^2-1000000x+1 , we get the following decimal: 0.000001 000001 000002 000005 000014 0.000001 \quad 000001\quad 000002\quad 000005 \quad 000014 \quad \ldots which we notice as the first 5 Catalan numbers. How many distinct Catalan numbers occur in a row before this pattern stops?

Image Credit: Wikimedia Dmharvey .


The answer is 12.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Michael Mendrin
Jun 29, 2015

We first start with a generating function with Catalan number coefficients

2 1 + 1 4 x = n = 0 C n x n \dfrac { 2 }{ 1+\sqrt { 1-4x } } =\displaystyle \sum _{ n=0 }^{ \infty }{ { C }_{ n } } { x }^{ n }

which can be rewritten as

1 2 1 2 1 4 a = 1 a n = 0 ( C n a n ) \dfrac { 1 }{ 2 } -\dfrac { 1 }{ 2 } \sqrt { 1-\dfrac { 4 }{ a } } =\dfrac { 1 }{ a } \displaystyle \sum _{ n=0 }^{ \infty }{ \left( \dfrac { { C }_{ n } }{ { a }^{ n } } \right) }

The left side is one of the roots of the equation

a x 2 a x + 1 = 0 { ax }^{ 2 }-ax+1=0

and here, in this problem, a = 1000000 a=1000000

So, the distinct appearances of Catalan numbers ends when

C 14 = 2674440 > 1000000 { C }_{ 14 }=2674440>1000000

runs into C 13 = 742900 < 1000000 { C }_{ 13 }=742900<1000000

so that the answer is 12 12

It's a little surprising to see Catalan numbers pop out of such a simple equation.

Exactly what I had in mind, no need for me to write another solution.

Haroun Meghaichi - 5 years, 11 months ago

If distinct means no zero between, l agree.

Martin Bittcher - 3 years, 7 months ago

To prove the digits of C 1 , , C 12 C_1, \:\ldots,\:C_{12} are unaffected by the rest of the sum. we must show k = 13 C k 1 0 6 ( k + 1 ) [ 0 ; 1 0 78 ) ( ) \sum_{k=13}^\infty C_k10^{-6(k+1)}\in \left[0;\: 10^{-78}\right)\quad (*)

It is not enough to verify C 14 C_{14} only overlaps with C 13 C_{13} . Even if that were the case, the combined rest in ( ) (*) could still grow big enough to influence any digit before - including those of C 1 , , C 12 C_1,\:\ldots,\:C_{12} .


Rem.: Let's prove a sufficient upper estimate of the combined rest with a k : = C k 1 0 6 ( k + 1 ) a_k := C_k10^{-6(k+1)} and k 13 k\geq 13 : a k + 1 a k = ( 2 k + 2 ) ( 2 k + 1 ) ( k + 1 ) 2 1 0 6 = 4 1 0 6 2 k + 1 2 k + 2 < 4 1 0 6 < 1 9 = : q , a k a 13 q k 13 , k = 13 a k < a 13 k = 13 q k 13 = a 13 1 q = C 13 1 0 84 9 8 < 1 0 78 \begin{aligned} \left|\frac{a_{k+1}}{a_k}\right| &= \frac{(2k+2)(2k+1)}{(k+1)^210^6}=\frac{4}{10^6}\cdot\frac{2k+1}{2k+2}<\frac{4}{10^6}<\frac{1}{9}=:q,&&& |a_k|&\leq|a_{13}|q^{k-13},\\\\ \sum_{k=13}^\infty a_k &<|a_{13}|\sum_{k=13}^\infty q^{k-13}=\frac{|a_{13}|}{1-q}=C_{13}\cdot 10^{-84}\cdot\frac{9}{8}<10^{-78}\quad_\blacksquare \end{aligned}

Carsten Meyer - 2 months, 2 weeks ago
K T
Aug 17, 2019

The Catalan numbers are given by C ( n ) = ( 2 n ) ! ( n + 1 ! ) n ! C(n)=\frac{(2n)!}{(n+1!)n!} for n > = 0 n>=0 and are 1 , 1 , 2 , 5 , 14 , 42 , 132 , 429 , 1430 , 4862 , 16796 , 58786 , 208012 , 742900 , 2674440 , 9694845 , . . . 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, ...

The numberst start to overlap as soon as they get more than 6 digits, so that the leading 2 2 of 2674440 2674440 merges with the last digit of the 14th Catalan number C ( 13 ) = 742900 C(13)=742900 into 742902 742902 (which then of course is not a Catalan number anymore).

Before that were 13 undistorted Catalan numbers, of which 12 \boxed{12} are distinct.

It can undoubtedly be shown that in a Taylor expansion of x \sqrt{x} in 1 the Catalan numbers show up, but I considered it a given in this context.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...