Answer:
sir please give the exact question
Step-by-step explanation:
That what we have to do with these three lines..
First get the factors of 24: 2*2*2*3Then the factors of 9: 3*3 Comparing the factors, the GCF is 3 Then you can rewrite the expression: 3*8 + 3*3 At this point, I'm not sure whether what you mean is really distributive property or not since this case is more of a factoring. 3*(8+3)
There are

total possible ways to pick any three integers from the set.
Of the total, there are 18 consisting of consecutive triplets

.
Now, of the total, suppose you fix two integers to be consecutive. There would be 19 possible pairs

, and for each pair 18 possible choices for the third integer (for instance,

can be taken with 3, 4, ..., 20), to a total of

. To avoid double-counting (e.g.

can't go with 3;

can't go with 1 or 4), we subtract 1 from the extreme pairs

and

(twice), and 2 from the rest (17 times).
So, the number of triplets that don't consist of pairwise consecutive integers is

I don't know how useful this would be to you, but I've verified the count in Mathematica:
In[8]:= DeleteCases[Subsets[Range[1, 20], {3}], x_ /; x[[2]] == x[[1]] + 1 || x[[3]] == x[[2]] + 1] // Length
Out[8]= 816
Answer:
60:150
Step-by-step explanation:
So first you can divide 210 by 7 since it will be spilt into seven parts.
210/7 = 30
So in order to get them into the ratios:
30 x 2 = 60
30 x 5 = 150
So 210 in the ratio of 2:5 would be 60:150
You can check your work by adding 60 + 150 together.
26,39,52,65,78,91,104,117,130,143,156,169,182,195,208,221,234,247,260,273,286,299,312,325,338,351,364,377,390,403,416,429,442,455,468,481,494,507,520,<span>533,546,559,572,585,598,611,624,637</span>