Answer:
8190 ways
Step-by-step explanation:
Given


Selection


Required
Number of ways of selection
4 students can be selected from 15 students in:

Similarly.
5 teachers can be selected from 6 teachers in:

So, the required number of selection is:

Apply combination formula:







3rd option
Step-by-step explanation:
solve and simplify to find
The nth term is
an=a1(r)^(n-1)
an=1(2)^(n-1)
a1=1
r=2
the sum of a geometric seequence is

a1=1
r=2
we want to find

(since we minus 1, the highest exponet is 9 so add 1 to make it correct)



Here is the formula: b•h/2