Let a n denote the number of distinct ways n ordered numbers multiplied together a 1 a 2 a 3 . . . a n can correctly and progressively be grouped pairwise by parentheses
e.g. a 4 = 5 since ( ( a 1 a 2 ) a 3 ) a 4 , ( a 1 ( a 2 a 3 ) ) a 4 , a 1 ( ( a 2 a 3 ) a 4 ) , a 1 ( a 2 ( a 3 a 4 ) ) , ( a 1 a 2 ) ( a 3 a 4 )
Also note a 1 = a 2 = 1
Find a 1 0
Bonus: Find a general formula for a n
Not an original problem
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.
time to find a general formula :)
Not what I had in mind but that'll do!
Problem Loading...
Note Loading...
Set Loading...
Suppose, the product is like this
a 1 a 2 . . . . . . . a n , and we can put parentheses like this...
( a 1 . . . . a r ) ( a r + 1 . . a n ) ......(1)
And we can get P r and P n − r ways to put parentheses to each of the parts of (1) parentheses. ( P n denotes number of ways to pair the product of n ordered numbers in parentheses.)
Then from above case ''breaking'' we found P n = ∑ k = 1 n − 1 P k P n − k ....(2)
Hence,
P 1 0 = 2 [ P 1 P 9 + P 2 P 8 + P 3 P 7 + P 4 P 6 ] + P 5 2 .
We know P 1 = 1 , P 2 = 1 .
From (2) we can proof P 3 = 2 , P 4 = 5 , P 5 = 1 4 , P 6 = 4 2 , P 7 = 1 3 2 , P 8 = 4 2 9 , P 9 = 1 4 3 0 .
So, P 1 0 = 2 ∗ ( 1 4 3 0 + 4 2 9 + 2 ∗ 1 3 2 + 5 ∗ 4 2 ) + 1 4 2 = 4 8 6 2 .