Let f(n) denotes the number of different ways in which the positive integer n can be expressed as the sum of 1′s and 2′s. For example f(4)=5, since 4=2+2=2+1+1=1+2+1=1+1+2=1+1+1+1.
Then which of the following(s) is (are) CORRECT ?
A
f(6)=13
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
B
f(f(6))=377
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
f(f(6))=370
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
f(6)=11
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is Bf(f(6))=377 6=0(2)+6(1)=1(2)+4(1)=2(2)+2(1)=3(2)+0(1)
∴ Total number of permutations =6!6!+5!4!+4!2!2!+3!3!=13∴f(6)=13