# Catalan Numbers

Prove recurrence relationship of Catalan Numbers.

Question: Let n be a non-negative integer. The number, x[n], of topologically distinct binary trees with n nodes can be shown to satisfy the following recurrence (x[0] = 1):

See attached file for full problem description.

© BrainMass Inc. brainmass.com October 9, 2019, 3:45 pm ad1c9bdddfhttps://brainmass.com/math/recurrence-relation/prove-recurrence-relationship-catalan-numbers-12489

#### Solution Preview

Please see the attached file for proof of Recurrence Relationship of Catalan Numbers by Mathematical Induction.

This can be proved by the method of Mathematical Induction.

Let P(n): , where and x[0] =1

For n=1, ...

#### Solution Summary

The expert proves recurrence relationship of Catalan Numbers.

$2.19