We counted ƒ(n), the number of subsets of {1, . . , n} with no consecutive integers. now, we will further refine this question: let ƒ(n, k) be the number of subsets of size k of {1, . . , n} with no consecutive integers.
find a formula for ƒ(n, k), then deduce an identify from the fact that ƒ(n) = ∑ₖƒ(n, k).

right

step-by-step explanation:

0.6

39mph

step-by-step explanation:

for this pair of functions g(x)=x-2 and f(x)=|x| is (g o f)(a)= |a| -2

step-by-step explanation:

g(x)=x-2

f(x)=|x|

(g o f)(a)=?

(g o f)(x)=g(f(x))

(g o f)(x)=g(|x|)

(g o f)(x)=|x|-2

(g o f)(a)=|a|-2

answer: 80,000

step-by-step explanation:

the population doubles every day.

10,000*2=20,000 day 4

20,000*2=40,000 day 5

40,000*2=80,000 day 6