The term "autonomous" refers to an ordinary differential equation that relates the derivatives of the dependent variable as a function *only* of the dependent variable. In other words, the ODE doesn't explicitly depend on the independent variable.
Examples:

is autonomous

is *not* autonomous
4, 7 and 9 are mutually coprime, so you can use the Chinese remainder theorem.
Start with

Taken mod 4, the last two terms vanish and we're left with

We have
, so we can multiply the first term by 3 to guarantee that we end up with 1 mod 4.

Taken mod 7, the first and last terms vanish and we're left with

which is what we want, so no adjustments needed here.

Taken mod 9, the first two terms vanish and we're left with

so we don't need to make any adjustments here, and we end up with
.
By the Chinese remainder theorem, we find that any
such that

is a solution to this system, i.e.
for any integer
, the smallest and positive of which is 149.
<h3>
Answer: (n-1)^2</h3>
This is because we have a list of perfect squares 0,1,4,9,...
We use n-1 in place of n because we're shifting things one spot to the left, since we start at 0 instead of 1.
In other words, if the answer was n^2, then the first term would be 1^2 = 1, the second term would be 2^2 = 4, and so on. But again, we started with 0^2 = 0, so that's why we need the n-1 shift.
You can confirm this is the case by plugging n = 1 into (n-1)^2 and you should find the result is 0^2 = 0. Similarly, if you tried n = 2, you should get 1^2 = 1, and so on. It appears you already wrote the answer when you wrote "Mark Scheme".
All of this only applies to sequence A.
side note: n is some positive whole number.
Answer:
7/8
Step-by-step explanation:
because 1 - ⅛ = 7/8. which would mean the answer is 7/8