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).

he will have 300 because he is really broke and 300 is in his imangine

step-by-step explanation: he ehe heh step by the thy

geometry: triangles

solvers

lessons

answers archive

call the larger triangle abc

then the smaller triangle cde is similar to abc (all angles are equal, aaa).  

ab is the side that is 36, and we wish to find de, the side corresponding to ab

area_cde = area_abc - area_cde --> area_abc / area_cde = 2

let x=length of de

ratio of areas = (ratio of sides)^2

+2+=+%2836%2fx%29%5e2+

+2+=+1296%2fx%5e2+

++x%5e2+=+1296%2f2+=+648+

25.45584

ratio is 2 : 9

the answer is three

13.5 : 3