In “counting subsets”, we saw that the total number of subsets of a set s containing n elements is equal to 2n. however, if we intend to count the total number of subsets of s having a fixed size k, then we use the combination statistic c(n, k), also written (nk). given: positive integers n and m with 0≤m≤n≤2000. return: the sum of combinations c(n, k) for all k satisfying m≤k≤n, modulo 1,000,000. in shorthand, ∑nk=m(nk).

sine

step-by-step explanation:

an

y = 6x -3y -12

y +3y +12 = 6x

=> . x = { 2y / 3 +2 } this is equation of line in terms of x

=> . if line meets the x-axis the co-ordinates of meeting point would be ( x , 0 )

=> . x = 2 ( 0 ) / 3 + 2

=> . x = 2

so, the point is ( 2 , 0 )

(a) {a₁, a₁r, a₁r², … a₁rⁿ⁻¹, …}

(b) $59 398

step-by-step explanation:

(a) the annual sequence of profits

aₙ = a₁rⁿ⁻¹

the model for the sequence of profits is {a₁, a₁r, a₁r², … a₁rⁿ⁻¹, …} .

(b) profit after 15 yr

  a₁ = $ 30 000

  r = 1.05

a₁₅ = 30 000 × 1.05¹⁴

a₁₅ = 30 000 × 1.979 93

a₁₅ = $59 398

the profit in year 15 will be $59 398.