Let f(n) count the number of ways of dissecting a 2n-gon into 4-sided regions. As shown,...

 

Transcribed Image Text:

Let f(n) count the number of ways of dissecting a 2n-gon into 4-sided regions. As shown, f(2) f(3) = 3, and f(4) = 12. What is f(5)? What can you say about f(n)? = 1, D Đ D Let f(n) count the number of ways of dissecting a 2n-gon into 4-sided regions. As shown, f(2) f(3) = 3, and f(4) = 12. What is f(5)? What can you say about f(n)? = 1, D Đ D

Answer rating: 100% (QA)

Solo To find F5 we can use delation the recurence fn n Fn1 n 2 fn2 for ny 3 So F5 3 F 4 3 3 3 12 ... View the full answer