Answer:
10(x + 2) here you go! hope this helps
Answer: There are 495 possible different sets of answers the could contain exactly 8 correct answers of false.
Basically, we are looking for the number of different ways of selecting 8 objects out of a set of 12 objects. Our objects are answers of false and the set is the test.
This is a combination problem. The formula would be:
12! / (8! x 4!) = 495
3:80
4:20 those are the answers
( x + 1 )/ 3 = x + 2
Multiply 3 on both sides
x + 1 = 3x + 6
Subtract 6 on both sides
x - 5 = 3x
Subtract x from both sides
-5 = 2x
Divide 2 from both sides
x = -2.5
There really is no single "obvious" choice here...
Possibly the sequence is periodic, with seven copies of -1 followed by six copies of 0, or perhaps seven -1s and seven 0s. Or maybe seven -1s, followed by six 0s, then five 1s, and so on, but after a certain point it would seem we have to have negative copies of a number, which is meaningless.
Or maybe it's not periodic, and every seventh value in the sequence is incremented by 1? Who knows?
I'll go ahead and assume the latter case, that the sequence is not periodic, since that's technically somewhat easier to manage. We can assign the following rule to the
-th term in the sequence:
for
.
So the generating function for this sequence might be
As to what is meant by "closed form", I'm not sure. Would this answer be acceptable? Or do you need to find a possibly more tractable form for the coefficient not in terms of the floor function?