Calculating, .
Alternatively, .
Answer: (D)
Simplifying, . When , this
expression equals .
Alternatively, when , we have
.
Answer: (C)
The volume of a cube is 1.
The volume of a
cube is 8.
Thus, of the smaller cubes are
needed to make the larger cube.
Answer: (E)
For there to be equal numbers of each colour of candy, there must
be at most red candies and at
most yellow candies, since there
are blue candies to start.
Thus, Shuxin ate at least red
candies and at least yellow
candies.
This means that Shuxin ate at least candies.
We note that if Shuxin eats red
candies, yellow candies, and
blue candies, there will indeed
be equal numbers of each colour.
Answer: (A)
Square is made up of
equal-sized small squares.
Of these, are fully shaded and
are half-shaded.
This shading is equivalent to fully shading of
the small squares.
Thus, square is shaded.
Answer: (E)
Using a calculator, and .
The integers between these real numbers are , , , , of which there are .
Alternatively, we could note that integers between and correspond to values of where is a perfect square and is between and . The perfect squares between and are , , , , of which there are .
Answer: (B)
Solution 1:
When a line is reflected in the -axis, its -intercept does not change (since it is
on the line of reflection) and its slope is multiplied by .
Therefore, the new line has slope and -intercept , which means that its equation is .
The -intercept of this new line is
found by setting and solving
for which gives or or .
Solution 2:
The -intercept of the original
line is found by setting in
the equation of the line and solving for , which gives or or .
When the line is reflected in the -axis, the -intercept of the new line is the
reflection of the original line in the -axis, and thus is .
Answer: (A)
Using exponent laws, and so .
Answer: (B)
Since is the centre of the
circle, then .
This means that and
are both isosceles
with .
Thus, .
Since is a straight
angle, then .
Answer: (D)
After David is seated, there are seats in which Pedro can be seated, of
which are next to David.
Thus, the probability that Pedro is next to David is or .
Answer: (C)
Each of the lines can
intersect each of the other lines
at most once.
This might appear to create points of intersection, but each point of intersection is
counted twice – one for each of the lines.
Thus, the maximum number of intersection points is .
The diagram below demonstrates that intersection points are indeed
possible:
Answer: (D)
When a list of 5 numbers ,
, , ,
has the property that , it is also true that .
With the given list of numbers, it is likely easier to find two pairs
with no overlap and with equal sum than to find two triples with one
overlap and equal sum.
After some trial and error, we can see that , and so the list , , , , has the given property, which means that is in the
middle.
(We note that these two pairs are the only such pairs, after allowing
for switching the numbers in each pair and/or switching the pairs.)
Answer: (A)
Expanding, .
The constant term of this quadratic expression is , and so .
Since and are integers, they are each divisors of
and thus of .
Of the given possibilities, only is not a divisor of , and so cannot equal .
We can check that each of the other four choices is a possible value of
.
Answer: (E)
We note first that has a right angle and a angle and so it is a -- triangle.
Since , then using the
known ratios of side lengths, we can see that and .
Next, we note that
has two angles and so is
an isosceles right-angled triangle.
This means that and
.
Also, .
Further, since is a
straight angle, then Since has a angle and a right-angle, it is
also a -- triangle.
Using the known ratios of sides, since , we have and
.
Therefore, the perimeter of is
Answer: (E)
We first note that .
This tells us that the time that is hours from now is days and hours.
Since Anila’s grandmother’s activities are the same every day, then in
hours and minutes she will be doing the same
thing as she is doing in hours
and minutes, at which point she
is doing yoga.
Answer: (C)
Of the row and column products, only and are divisible by . This means that must go in the square in the 2nd row,
3rd column.
Of the row and column products, only and are divisible by . This means that must go in the square in the 1st row,
1st column.
Of the row and column products, only and are divisible by . This means that must go in the square in the 2nd row,
2nd column.
So far, this gives the following grid:
In the 2nd row, the product is which means that the missing entry
is .
In the 1st column, the product is which means that the missing entry
is .
The 3rd row, whose product is ,
thus includes and two more
integers between and . The only divisor pair of with both divisors less than is .
Since is not a divisor of , then must be .
We can complete the square as follows:
Answer: (C)
Since , then
. This means that does not have the greatest value.
Since , then . This means that does not have the greatest value.
Since and each of , ,
is positive, then , which
means that does not have the
greatest value.
Consider the last equation along with the fact that .
From this, we see that .
Since , then is negative and so .
This means that has the greatest
value.
Answer: (C)
Since , then
or .
Since , then and so .
(With some additional work, we can find that the solutions to the system
of equations are and
.)
Answer: (A)
Suppose that when the three dice are rolled, the numbers rolled
are , and .
Since there are 6 possibilities for each of ,
and , there are possible
outcomes.
Also, the sum, , of the three
rolls is at least and
at most .
The outcome "" is the
complement of the outcome "".
Thus, the probability that
is minus the probability that
.
It is easier to compute the probability that directly by listing the rolls
that give this.
If , then and so .
If , then and so ,
and must be ,
and in some order. Thus, or or .
If , then and so ,
and must be ,
and , or ,
and in some order. There are
arrangements in each case and so
triples in total.
Therefore, there are
triples with , and so the
probability that is equal
to .
Of the given choices, this is closest to .
Answer: (B)
Suppose that the radius of the cylinder is and the height of the cylinder is .
This means that the volume of the cylinder is ; the volume of half of the
cylinder is .
Also, the radius of the cone is and the height of the cone
is .
This means that the volume of the cone is or .
When the cone is divided into two pieces by a horizontal plane at half
of its height, the top portion of the cone is a cone with the same
proportions, but with dimensions of those of the larger
cone.
This means that the volume of the top portion is
of that of the cone, which equals
or .
To see this in another way, we note that this top portion of the cone
has height and should
have radius (because the radius decreases proportionally to
the height). This means that the volume of this portion is which is again .
Using this information, the bottom portion of the cone has volume .
Now, when the cone is in the cylinder and the cylinder is filled with
water to half of its height, the volume of the bottom half of the
cylinder is filled with the bottom portion of the cone and with the
water.
Therefore, the volume of water is the difference between half of the
volume of the cylinder and the volume of the bottom portion of the cone,
or .
When the cone is removed, the water then occupies a cylinder with radius
and volume .
If the depth of the water in this configuration is , then and so , which means that the
depth of the water is
of the height of the cylinder.
Answer: (B)
Since the second column includes the number , then step (ii) was never used on the
second column, otherwise each entry would be at least .
To generate the , and in the second column, we thus need to
have used step (i) time on row
, times on row , and times on row .
This gives:
We cannot use step (i) any more times, otherwise the entries in
column will increase. Thus, .
To obtain the final grid from this current grid using only step (ii), we
must increase each entry in column by (which means using step (ii) times) and increase each entry in
column by (which means using step (ii) times). Thus, .
Therefore, .
Answer:
We note that Since each of , , ,
is taken from the set , then since the greatest possible
difference between two numbers in the set is .
Similarly, .
Now, if , we must have and .
In this case, and come from the set and so .
Therefore, if , we have
.
If , then either and , or and .
In both cases, we cannot have but we could have by taking the other of these two pairs with a difference of
.
Thus, if , we have .
Finally, if , the
original restriction
tells us that .
In summary, the greatest possible value for is 64 which occurs, for
example, when , , , and .
Answer:
Solution 1:
Suppose that and
.
Extend to point so that .
Since , then .
Also, is congruent to
by
side-angle-side.
Therefore, since and are parallel.
Next, is similar to
since both are
right-angled and they share an angle at .
Therefore, and so , which
gives , as required.
Solution 2:
Suppose that and
.
Since , then .
We note that is
similar to because
each is right-angled and their angles at are common.
Therefore, and so .
Manipulating, we obtain and so or .
Also, using the Pythagorean Theorem in gives .
Since and , then which gives and so or .
Therefore, .
Answer:
Throughout this solution, we use the fact that if is a positive integer with and has prime factorization for
some distinct prime numbers and positive integers , then the number of
positive divisors of including 1
and is equal to .
We are told that is a positive
multiple of 2024.
Now, .
This means that has at least
prime factors (namely , and ) and that at least one of these prime
factors has an exponent of at least .
Let be the number of positive
divisors that has. We are told
that .
Since and has at least
prime factors, then is a positive integer that can be
written as the product of at least positive integers each greater than
.
cannot equal , , , or , since each of these is prime (and so
cannot be written as the product of integers each at least ).
also cannot equal because (both and are prime), which means that cannot be written as the product of
three integers each greater than .
The possible values of that
remain are , , , .
We note that and
and and
.
Case 1:
Since the prime factors of
include at least , and , then the prime factorization of includes factors of , and for some positive integers ,
and with .
If a fourth prime power was
also a factor of , then would be divisible by . ( could have more factors if had more prime factors.)
Since
has only prime factors, it cannot
be written as the product of
integers each greater than .
Thus, cannot have a fourth prime
factor.
This means that ,
which gives .
This means that , and are equal to ,
and , in some order, and so ,
and are equal to ,
and , in some order.
For to be as small as possible,
the largest exponent goes with the smallest prime, the next largest
exponent with the next smallest prime, and so on. (Can you see why this
makes as small as
possible?)
Therefore, the smallest possible value of in this case is .
Case 2:
Using a similar argument, we can determine that with , and equal to ,
and in some order, meaning that
, and equal , ,
in some order.
Therefore, the minimum value of
is this case is .
Case 3:
Since has prime factors, then cannot have more than prime factors. (If had 5 or more prime factors, then the
product equal to would include at
least integers, each at least
.)
Therefore, and
, or for some prime
and .
This means that or .
In the case that has three prime
factors, we note that are the only two ways of writing as the product of integers each of which is at least
.
These give corresponding minimum values of of and .
In the case that has four prime
factors, then means that , ,
and are , , , in some order.
This in turn means that the corresponding smallest possible value of
is We note here
that the prime power has become
in order to minimize both (since ) and its exponent.
Case 4:
Since has
prime factors, then cannot have more than prime factors.
If has prime factors, then we need to use the
factorization .
This is not possible, however, because the power must have which would mean that one of the
five factors of would have to be
at least .
If has prime factors, then must be partitioned as or or . (Since two of
the prime factors have to be combined, either two s, two s, or a and a are combined.)
These give minimum values of and and .
If has prime factors, then we must use one of
the factorizations or or or
or .
These gives corresponding minimum values Combining Cases through , the minimum possible value of is .
The sum of the digits of
is .
Answer:
Suppose that, for some integer , we have and
.
The equation can be re-written as .
Since and , squaring both sides of the
equation gives an equivalent equation which is .
Manipulating algebraically, we obtain the following equivalent
equations: Therefore, the given
relationship is equivalent to or .
Returning to the sequence notation, we now know that it is the case that
(that is, ) or .
Putting this another way, each term in the sequence can be obtained from
the previous term either by multiplying by or by dividing by .
We are told that and . We note .
We can think of moving along the sequence from to by making "steps", each of which involves either
multiplying by or dividing by
.
If there are steps in which we
multiply by and steps in which we divide by , then which gives
or and so .
In other words, the sequence involves steps of multiplying by and steps of dividing by .
These steps completely define the sequence.
The number of possible sequences, , equals the number of ways of arranging
these steps, which equals .
(If combinatorial notation is unfamiliar, we could systematically count
the number of arrangements instead.)
Therefore, . The rightmost two
digits of are .
Answer: