<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:
Step-by-step explanation:
(-3/4)x + 9 = (-1/2)x + 8
9 - 8 = (-1/2)x + (3/4)x
1 = (1/4)x
x = 4
y = (-3/4)4 + 9
y = -3 + 9
y = 6
Answer:
Y=168
Step-by-step explanation:
Y varies directly as X
Y=kx
K is a constant
28=k2
K=28/2 =14
Y=14x
Y=14×12
Y=168
Answer:
The total number of ways are 168.
Step-by-step explanation:
Consider the provided information.
There are 7 junior and 3 senior coders in her group.
The first project can be written by any of the coders. The second project must be written by a senior person and the third project must be written by a junior person.
For second project we have 3 choices and for third project we have 7 choices.
Now there are 2 possible case:
Case I: If first and second coder is senior, then the total number of ways are:
Case II: If first and third coder is junior, then the total number of ways are:
Hence, the total number of ways are: 42+126=168
