Information
You have already completed the quiz before. Hence you can not start it again.
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Loading...
-
Question 1 of 3
Find the sequence given that:
U5+U13=126U5+U13=126
U9+U17=182U9+U17=182
Incorrect
Loaded: 0%
Progress: 0%
00:00
First, transform the 5th5th and 13th13th terms into general rule form
5th Term
UnUn |
== |
a+[(n−1)d]a+[(n−1)d] |
U5U5 |
== |
a+[(5−1)d]a+[(5−1)d] |
Substitute known values |
U5U5 |
== |
a+4da+4d |
Distribute |
13th Term
UnUn |
== |
a+[(n−1)d]a+[(n−1)d] |
U13U13 |
== |
a+[(13−1)d]a+[(13−1)d] |
Substitute known values |
U13U13 |
== |
a+12da+12d |
Distribute |
Next, add the first pair general forms
U5+U13U5+U13 |
== |
(a+4d)+(a+12d)(a+4d)+(a+12d) |
126126÷2÷2 |
== |
2a+16d2a+16d÷2÷2 |
Divide both sides by 22 |
6363 |
== |
a+8da+8d |
Next, transform the 9th9th and 17th17th terms into general rule form
9th Term
UnUn |
== |
a+[(n−1)d]a+[(n−1)d] |
U9U9 |
== |
a+[(9−1)d]a+[(9−1)d] |
Substitute known values |
U9U9 |
== |
a+8da+8d |
Distribute |
17th Term
UnUn |
== |
a+[(n−1)d]a+[(n−1)d] |
U17U17 |
== |
a+[(17−1)d]a+[(17−1)d] |
Substitute known values |
U17U17 |
== |
a+16da+16d |
Distribute |
Next, add the second pair general forms
U9+U17U9+U17 |
== |
(a+4d)+(a+12d)(a+4d)+(a+12d) |
182182÷2÷2 |
== |
2a+24d2a+24d÷2÷2 |
Divide both sides by 22 |
9191 |
== |
a+12da+12d |
Next, solve for the value of dd by subtracting the first combined general rule form from the second combined general rule form
9191-−6363 |
== |
((a+12da+12d)-()−(a+8da+8d)) |
2828÷4÷4 |
== |
4d4d÷4÷4 |
Divide both sides by 44 |
77 |
== |
dd |
dd |
== |
77 |
Next, substitute dd to one of the combined general rule forms to solve for aa
6363 |
== |
a+8a+8dd |
6363 |
== |
a+8(a+8(77)) |
Substitute d=7d=7 |
6363 -56−56 |
== |
a+56a+56 -56−56 |
Subtract 5656 from both sides |
77 |
== |
aa |
aa |
== |
77 |
Finally, start with a=7a=7 and keep adding d=7d=7 to its value to get the sequence
U1U1 |
== |
77 |
U2U2 |
== |
7+7+77 |
== |
1414 |
U3U3 |
== |
14+14+77 |
== |
2121 |
U4U4 |
== |
21+21+77 |
== |
2828 |
-
Question 2 of 3
The short end of a fence has a height of 140140 cm. After about 7171 pieces of timber, the height of the fence is 210210 cm. Find:
(i)(i) The difference in height between each fence
(ii)(ii) The total height of the fences in metres
Incorrect
Loaded: 0%
Progress: 0%
0:00
Sum of an Arithmetic Sequence
Sn=n2[2a+(n−1)d]Sn=n2[2a+(n−1)d]
General Rule of an Arithmetic Sequence
Un=a+[(n−1)d]Un=a+[(n−1)d]
(i)(i) Finding the difference in height between each fence (dd)
Substitute the known values to the general rule
Number of termsNumber of terms[n][n] |
== |
7171 |
First termFirst term[a][a] |
== |
140140 |
UnUn |
== |
a+[(n−1)d]a+[(n−1)d] |
U71U71 |
== |
140+[(71−1)d]140+[(71−1)d] |
Substitute known values |
210210 -140−140 |
== |
140+70d140+70d -140−140 |
Subtract 140140 from both sides |
7070÷70÷70 |
== |
70d70d÷70÷70 |
Divide both sides by 7070 |
11 |
== |
dd |
dd |
== |
1 cm1 cm |
(ii)(ii) Finding the total height of the fences in metres (SnSn)
Substitute the known values to the sum formula
Number of terms[n]Number of terms[n] |
== |
7171 |
First Term[a]First Term[a] |
== |
140140 |
Common Difference[d]Common Difference[d] |
== |
11 |
SnSn |
== |
n2[2a+(n−1)d]n2[2a+(n−1)d] |
|
S71S71 |
== |
712[2⋅140+(71−1)1]712[2⋅140+(71−1)1] |
Substitute known values |
|
|
== |
3512(280+70)3512(280+70) |
Evaluate |
|
|
== |
3512(350)3512(350) |
|
|
== |
12 425 cm12 425 cm |
Finally, convert the centimetres into metres
1 metre1 metre |
== |
100 centimetres100 centimetres |
12425×110012425×1100 |
== |
124.25 cm124.25 cm |
(i) d=1 cm(i) d=1 cm
(ii) Sn=124.25 m(ii) Sn=124.25 m
-
Question 3 of 3
A stack of cans has 11 can at the top and then each row has 22 more cans than the previous row. Find:
(i)(i) The number of cans in the 21st21st row
(ii)(ii) The row with 6161 cans
(iii)(iii) The number of rows if there are a total of 12961296 cans
Incorrect
Loaded: 0%
Progress: 0%
00:00
Sum of an Arithmetic Sequence
Sn=n2[2a+(n−1)d]Sn=n2[2a+(n−1)d]
General Rule of an Arithmetic Sequence
Un=a+[(n−1)d]Un=a+[(n−1)d]
(i)(i) Finding the number of cans in the 21st21st row (U21U21)
Substitute the known values to the general rule
Number of termsNumber of terms[n][n] |
== |
2121 |
First termFirst term[a][a] |
== |
11 |
Common DifferenceCommon Difference[d][d] |
== |
22 |
UnUn |
== |
a+[(n−1)d]a+[(n−1)d] |
U21U21 |
== |
1+[(21−1)2]1+[(21−1)2] |
Substitute known values |
|
== |
1+(20)21+(20)2 |
Evaluate |
|
== |
1+401+40 |
|
== |
4141 |
(ii)(ii) Finding the row with 6161 cans (nn)
Substitute the known values to the general rule and solve for nn
Nth termNth term[Un][Un] |
== |
6161 |
First termFirst term[a][a] |
== |
11 |
Common DifferenceCommon Difference[d][d] |
== |
22 |
UnUn |
== |
a+[(n−1)d]a+[(n−1)d] |
6161 |
== |
1+[(n−1)2]1+[(n−1)2] |
Substitute known values |
6161 |
== |
1+(2n-2)1+(2n−2) |
Distribute |
6161 +1+1 |
== |
-1+2n−1+2n +1+1 |
Add 11 to both sides |
6262÷2÷2 |
== |
2n2n÷2÷2 |
Divide both sides by 22 |
3131 |
== |
nn |
nn |
== |
3131 |
(iii)(iii) Finding the number of rows if Sn=1296Sn=1296 (nn)
Substitute the known values to the sum formula and solve for nn
Sum of termsSum of terms[Sn][Sn] |
== |
12961296 |
First Term[a]First Term[a] |
== |
11 |
Common Difference[d]Common Difference[d] |
== |
22 |
SnSn |
== |
n2[2a+(n−1)d]n2[2a+(n−1)d] |
|
12961296 |
== |
n2[2⋅1+(n−1)2]n2[2⋅1+(n−1)2] |
Substitute known values |
|
12961296 |
== |
n2(2+2n−2)n2(2+2n−2) |
Evaluate |
|
12961296×2×2 |
== |
[n2(2n)][n2(2n)]×2×2 |
Multiply both sides by 22 |
|
25922592 |
== |
n(2n)n(2n) |
22=122=1 |
|
25922592÷2÷2 |
== |
2n22n2÷2÷2 |
Divide both sides by 22 |
√1296√1296 |
== |
√n2√n2 |
Find the square root of both sides |
3636 |
= |
n |
n |
= |
36 |
(i) U21=41
(ii) n=31
(iii) n=36