-
The sum of the first 2005 terms of the sequence 1, 2, 3, 4, 1, 2, 3, 4, $\ldots$ is
- $5011$
- $5110$
- $5020$
- $5010$
- $501$
|
-
Singers in a singing competition are rated by an applause metre. In the diagram, the arrow for one of the contestants is pointing to a rating that is closest to
- $9.4$
- $9.3$
- $9.7$
- $9.9$
- $9.5$
|
-
If $\sqrt{5+n}=7$, the value of $n$ is
- $4$
- $9$
- $24$
- $44$
- $74$
|
-
A piece of string fits exactly once around the perimeter of a square whose area is 144. Rounded to the nearest whole number, the area of the largest circle that can be formed from the piece of string is
- $144$
- $733$
- $113$
- $452$
- $183$
|
-
Suppose that $k>0$ and that the line with equation $y = 3kx + 4k^2$ intersects the parabola with equation $y = x^2$ at points $P$ and $Q$, as shown. If $O$ is the origin and the area of $\triangle OPQ$ is 80, then the slope of the line is
- $4$
- $3$
- $\frac{15}{4}$
- $6$
- $\frac{21}{4}$
|
-
There are six identical red balls and three identical green balls in a pail. Four of these balls are selected at random and then these four balls are arranged in a line in some order. How many different-looking arrangements are possible?
- 15
- 16
- 10
- 11
- 12
|
-
Shuxin begins with \(10\) red candies, \(7\) yellow candies, and \(3\) blue candies. After eating some of the candies, there are equal numbers of red, yellow, and blue candies remaining. What is the smallest possible number of candies that Shuxin ate?
- \(17\)
- \(7\)
- \(11\)
- \(20\)
- \(14\)
|
-
A circular spinner is divided into three sections. An arrow is attached to the centre of the spinner. The arrow is spun once. The probability that the arrow stops on the largest section is \(50\%\). The probability it stops on the next largest section is 1 in 3. The probability it stops on the smallest section is
- \(\frac14\)
- \(\frac25\)
- \(\frac16\)
- \(\frac27\)
- \(\frac{3}{10}\)
|
-
There are \(T\) tokens arranged in a circle for some positive integer \(T\). Moving clockwise around the circle, the tokens are labelled, in order, with the integers from 1 to \(T\). Starting from the token labelled 1, Évariste:
-
Removes the token at the current position.
-
Moves clockwise to the next remaining token.
-
Moves clockwise again to the next remaining token.
-
Repeats steps (i) to (iii) until only one token remains.
When \(T=337\), the number on the last remaining token is \(L\). There are other integers \(T\) for which the number on the last remaining token is also \(L\). What are the rightmost two digits of the smallest possible value of \(T\)?
|
-
In the diagram, each letter from \(A\) to \(H\) is equal to a different integer from \(1\) to \(8\).

Also,
-
\(H\) is a perfect square and is \(1\) more than \(D\)
-
\(5\) and \(8\) are in the same row
-
\(C\) is a multiple of both \(G\) and \(D\)
-
\(B\) is the largest prime number in the set
-
The value of \(B+G\) is even
What is the value of \(F\)?
- \(2\)
- \(6\)
- \(1\)
- \(7\)
- \(8\)
|