Answer:
Stohr sequence
Step-by-step explanation:
Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This defines the h-Stöhr sequence
Answer:
105 children
Step-by-step explanation:
35/100×300
105
Answer:
274
Step-by-step explanation:
(52 + 4) * 5 - 2 + (-4)
56 * 5 - 2 + (-4)
56 * 5 - 2 - 4
280 - 2 - 4
278 - 4
274
Answer: BC= AC•CE/ CD
Step-by-step explanation:
Took the test :)