Question

Using the formual (2n-3)! / [2^n-2 x (n-2)!], how many possible rooted trees can you generate...

Using the formual (2n-3)! / [2^n-2 x (n-2)!], how many possible rooted trees can you generate using 6 organisma?

Homework Answers

Answer #1

Its very easy to calculate the number or rooted and unrooted trees using the double factorial notation !!. Here is how it works. We know 5! = 5*4*3*2*1. But 5!! is defined as the product including only odd numbers. That is,

                       5!! = 5*3*1 = 15. Similarly, 7!! = 7*5*3*1.

Now, For n organisms, the number of rooted trees is given by (2n-3)!!.

Here n = 6. Thus (2n-3)!! = (2*6 - 3)!! = 9!! = 9*7*5*3*1 = 945. Thus number of rooted trees for 6 organisms is 945. The formula for finding number of rooted trees is (2n-3)!! and for unrooted trees is (2n-5)!!.

Thank you.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
How many trees T are there on the set of vertices {1, 2, 3, 4, 5,...
How many trees T are there on the set of vertices {1, 2, 3, 4, 5, 6, 7} in which the vertices 2 and 3 have degree 3, vertex 5 has degree 2, and hence all others have degree 1? Do not just draw pictures but consider the possible Pr¨ufer codes of these trees.
1. Find f''(x) F(x)= (x^2+2)^9 F''(x)= 2. Find t^(4)(n) for the function t(n)= 2n^-1/2+7n^3/2 t^(4)(n) =...
1. Find f''(x) F(x)= (x^2+2)^9 F''(x)= 2. Find t^(4)(n) for the function t(n)= 2n^-1/2+7n^3/2 t^(4)(n) = (Type an expression using n as the variable. Simplify your answer)
Prove using the definition of O-notation that 2^(n+2)∈O(2^(2n)), but 2^(2n)∉O(2^(n+2)).
Prove using the definition of O-notation that 2^(n+2)∈O(2^(2n)), but 2^(2n)∉O(2^(n+2)).
Prove the following using induction: (a) For all natural numbers n>2, 2n>2n+1 (b) For all positive...
Prove the following using induction: (a) For all natural numbers n>2, 2n>2n+1 (b) For all positive integersn, 1^3+3^3+5^3+···+(2^n−1)^3=n^2(2n^2−1) (c) For all positive natural numbers n,5/4·8^n+3^(3n−1) is divisible by 19
Used induction to proof that 1 + 2 + 3 + ... + 2n = n(2n+1)...
Used induction to proof that 1 + 2 + 3 + ... + 2n = n(2n+1) when n is a positive integer.
There are n children in a family and possible combinations of 2n , depending on their...
There are n children in a family and possible combinations of 2n , depending on their type, get equal probability. Let's show "A family with children of both sexes" with A, "B" with one girl in the family. Show that these events are dependent for n = 2, but independent for n = 3.
How can I convert this apply function in R studio apply(trees, 1, function(x) tree_s3(x[1],x[2],x[3])) into a...
How can I convert this apply function in R studio apply(trees, 1, function(x) tree_s3(x[1],x[2],x[3])) into a for loop?
a. A digital signal x(n) is defined as x(n)=u(n+5)-u(n-5) Calculate the signal x1(n)=x(-2n-6) by direct method,...
a. A digital signal x(n) is defined as x(n)=u(n+5)-u(n-5) Calculate the signal x1(n)=x(-2n-6) by direct method, represent the signal in sequence form and sketch the signal. b. By performing combination of time shifting and time scaling of x(n) how x1(n) can be generated? Plot the waveforms in matlab for each step.
How many pure Nash equilibria are there a Minority Game with 2n+1, (n∈IN) players?
How many pure Nash equilibria are there a Minority Game with 2n+1, (n∈IN) players?
. Prove that 2^(2n-1) + 3^(2n-1) is divisible by 5 for every natural number n.
. Prove that 2^(2n-1) + 3^(2n-1) is divisible by 5 for every natural number n.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT