Ben made up a recursive formula and used it to generate a sequence. he used b(n) to stand for the nth term of his
recursive sequence.
a. what does b(3) mean?
b. what does b(m) mean?
c. if b(n + 1) = 33 and b(n) = 28, write a possible recursive formula involving b(n + 1) and b(n) that would generate 28 and 33 in the sequence.
d. what does 2b(7) + 6 mean?
e. what does b(n) + b(m) mean?
f. would it necessarily be the same as b(n + m)?
g. what does b(17) − b(16) mean?

answer: the answer is one of

step-by-step explanation:   we are given to write a proper fraction where the whole is divided into an even number of equal parts less than ten, and an odd number of those parts exist.

an even number less than 10 may be one of 2, 4, 6 or 8. so, the whole may be one of these four evens.

now, an odd number of these parts must exist, so the numerator must be an odd number, one of 1, 3, 5 or 7. it cannot be 9 because then the fraction will become improper.

thus, our fraction may be one of the following

. + λrh() e 1 1 2 4 4 4 4 4 3 4 4 4 4 4 + th−1(− s(x)2 dx ω + λrh−1() e 2 1 2 4 4

step-by-step explanation:

explanation:

step-by-step explanation: