There are days in a week,
so days after May
is also Thursday. Since , May is a Thursday.
Thus, May is a Friday, May is a Saturday, May is a Sunday, May is a Monday, and May is a Tuesday.
Answer: Tuesday
Observe that , so , which implies that .
Similarly, , so .
From the calculations above, an integer is between and exactly when . There are such integers.
Answer:
Since , , and lie on a line, , and so .
Suppose . Then
because is . Hence, we conclude that .
Solving this equation for gives
, so .
The diagonals of a rectangle have equal length and bisect each other, so
.
Therefore, is
isosceles with .
If , then since
, we have
.
The angles in have a
sum of , so or .
Answer:
If the common ratio is ,
then , , , and .
Rearranging , we get
.
Taking square roots, , but is a real number, so , which means .
Using that we get .
Although it was not needed to answer the question, there are two
possible values of and they are
and .
Answer:
Since and are both from to inclusive, the possible values for
and are , , , , , and .
In the table below, the possible sums of and are summarized. In particular, the
integer in the row for and the
column for is .
|
0 |
1 |
4 |
9 |
16 |
25 |
0 |
0 |
1 |
4 |
9 |
16 |
25 |
1 |
1 |
2 |
5 |
10 |
17 |
26 |
4 |
4 |
5 |
8 |
13 |
20 |
29 |
9 |
9 |
10 |
13 |
18 |
25 |
34 |
16 |
16 |
17 |
20 |
25 |
32 |
41 |
25 |
25 |
26 |
29 |
34 |
41 |
50 |
If a sum in the table above is of the form where neither nor is zero, then there are four pairs
leading to that sum.
For example, the integer coming
from and is achieved by equal to each of , , , and .
If a sum in the table is of the form where exactly one of and is , then there are two pairs leading to that sum.
For example, the sum of coming
from and comes from and .
There are sums in the table
above that are from through .
Of these, come from adding two
non-zero squares, and come from
adding to a nonzero
square.
From the reasoning above, there are pairs with the given properties.
Answer:
Solution 1
Let be on so that is perpendicular to , as shown below.
Since is a square, , which means .
Since is right-angled
at , we have .
From , we can deduce that .
As well, , so we conclude that and are similar.
Since is a square, , and since is the midpoint of , we have .
Applying the Pythagorean theorem to gives .
By the similarity of
and , we have that
or . is the midpoint of , so , hence .
The lines and are parallel, so the diameter of the
circle is the perpendicular distance between these two lines, which is
the length of .
Therefore, the radius of the circle is and its
area is .
Solution 2
We will coordinatize to get , , , and , from which it follows that is at since it is the midpoint of . Similarly, is at .
Line segment has slope and line
segment has slope .
Therefore, and are parallel. By symmetry and because
these lines are parallel, the centre of the circle must be on the line
of slope that is half
way between and .
This line must pass through the midpoint of , which is so the centre
of the circle lies somewhere on the line with equation .
Therefore, for some , the centre
of the circle is at .
The circle has equation
where is the radius of the
circle.
The line through and has equation .
Line segment is tangent to the
circle, so it intersects the circle exactly once.
Substituting
into the equation of the circle gives the following equivalent
equations: The
-values that satisfy this equation
represent the points of intersection of the circle with . There is only one such point, so the
quadratic above must have only one root.
A quadratic with only one root has a discriminant equal to , so we get the equivalent equations
Solving for gives , so the area of the
circle is .
Answer:
The amount of money, in cents, that Rolo has is .
The amount of money, in cents, that Pat has is .
The amount of money, in cents, that Sarki has is .
Therefore, the total amount of money that they have together is They have cents in total, which leads to the
equation .
Dividing both sides by , we get
.
Since Pat has nickels, dimes, and quarters, she has coins in total.
Answer:
There are five odd digits: , , , , and .
We will count how many integers less than with only odd digits have as a units digit.
The integer is one of these
integers, and the integers ,
, , , and are the two-digit integers with as their units digit.
There are three-digit
integers with only odd digits and
as their units digit. This is because there are choices for the hundreds digit and
choices for the tens digit, and
these choices are independent.
Thus, integers less than
with only odd digits have a
units digit of .
By nearly identical reasoning, for each possible odd digit, there are
integers less than with only odd digits and that units
digit.
When we add all integers less than that have only odd digits, the units
digits contribute Doing similar
analysis on the tens digits, we find that for any given odd digit, there
are exactly two-digit integers
with only odd digits and that tens digit, and there are three-digit integers with
that given tens digit. There are no one-digit integers with an odd tens
digit.
Therefore, for each odd digit, there are integers less than with only odd digits and that given
tens digit.
When we add all integers less than that have only odd digits, the tens
digits contribute Similarly, there
are three-digit
integers with only odd digits for each possible odd hundreds digit. (An
integer with an odd hundreds digit has at least three digits.)
When we add all integers less than that have only odd digits, the
hundreds digits contribute
Therefore, the sum of all integers less than that have only odd digits is
Answer:
Suppose the radius of the sphere is and let be any point on the circumference of
the circular cross section in the hemisphere containing .
Then has and . As well, since , so .
By the Pythagorean theorem, so .
The cone with in its base has
base radius and height , so its volume is
Let be any point on the
circumference of the circular cross section containing .
Similar to the situation above, we have that has , , and .
By the Pythagorean theorem, we get .
The cone with in its base has
base radius and height , so its volume is Therefore, the ratio we seek is which simplifies to .
Answer:
Label the vertices of the cube by , , , , , , , and . The vertices of the cube and the edges
connected them can be represented by the following diagram:
Throughout this solution, we will refer to ants by the vertex from
which they originate. For example, Ant is the ant that is originally at vertex
.
Each ant has three choices of which vertex it can walk to. These choices
are summarized in the table below.
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
Since each ant has three choices and their choices are independent,
there are possible ways that
the ants can choose vertices. We
will count the number of ways that avoid a collision and get the answer
by dividing this total by .
By symmetry, if we assume that Ant chooses , we will count exactly one third of the
possibilities. In this case, Ant
cannot choose without colliding
with Ant , so Ant must choose or . By symmetry, there are an equal number
of choices for each case.
Therefore, we will assume that Ant chooses and that Ant chooses . This will count exactly one sixth of
the choices that avoid a collision.
Ant cannot choose , so it must choose either or . For now, suppose Ant chooses .
The choices for Ant are , , and , but and were chosen by other ants, so Ant must choose .
The choices for Ant are , , and , but and were chosen by other ants, so Ant must choose .
To summarize the choices so far, the table below is the same as the
table above, but with choices crossed out if either the Ant did not
choose that vertex or cannot choose that vertex because another ant has
already chosen it.
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
The remaining choices for Ant
are and , but Ant cannot choose without colliding with Ant on an edge.
Therefore, Ant must choose , and we can update the table as
follows, eliminating as a choice
for Ant .
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
Since Ant chose , Ant cannot choose since they would collide on an edge.
Therefore, the remaining choices are that Ant must choose and Ant must choose . One can verify that the choices have
the property that every vertex is chosen by exactly one ant, and no two
ants choose each other’s original vertex, so there is no
collision.
We have now deduced that if Ant
chooses , then there is only one
way for the rest of the ants to choose vertices so that no collision
happens.
From now on, we will assume that Ant chooses . With Ant choosing , and choosing , and Ant choosing , the choices for the ants are
restricted as shown in the table below. Choices have been eliminated if
the vertex was chosen by another ant, or if choosing that vertex would
cause two ants to "swap" vertices and collide on an edge.
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
We will now consider the two remaining possibilities for the choice
of Ant .
If Ant chooses , then the same sort of reasoning that
was used earlier leads to the table below, showing that there is only
one possibility if Ant chooses
.
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
Now we assume that Ant chooses
and reduce the possibilities as
follows.
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
There are two choices for , and
each of them leads to a unique way of the rest of the ants choosing
vertices. If Ant chooses , we get Option 1 in the table below,
and if Ant chooses , we get Option 2 in the table below.
Option 1 |
Option 2 |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
|
,
, |
To summarize, if we assume that chooses and chooses , then we will count one sixth of the
possibilities.
Considering cases, if Ant chooses
, then there is exactly one choice
for the rest of the ants that will avoid collisions.
If Ant chooses , then there is one possibility if Ant
chooses , and two possibilities if Ant chooses .
This means is one sixth of
the total number of possibilities, so the answer is
Answer: ()
Since an hour consists of minutes, the cyclist will travel km in hour.
Therefore, the cyclist will travel km in two hours.
Answer:
Squaring both sides, we get , which can be rearranged to get .
Answer:
The units digit of is the same as the units digit of , so .
Therefore, , so
, so .
The sum of and is .
Answer:
In order to save money,
individual rides needs to cost more than .
This means the answer to the question is the smallest integer for which .
If , then .
The smallest integer such that
is .
Answer:
In this solution, we will refer to the squares by their
label.
From the diagram, we can see that E is the only
completely visible square, so it must have been the last to be placed on
the table.
Some of G is covering some of F, so
G must have been placed later than
F.
Some of F is covering some of D, so
F must have been placed later than
D.
By similar reasoning, D must have been placed later
than B, which must have been placed later than both
A and C.
Finally, A is partially covering C, so
A was placed after C.
Putting this all together, the papers were placed in the following
order, given by their labels: C, A,
B, D, F,
G, E.
Answer: CABDFGE
The equation of the first line can be rearranged to get or , so the slope of the
first line is .
If , then the other line is
vertical and is not perpendicular to a line with slope .
Therefore, the equation of the second line can be rearranged to .
The slopes of perpendicular lines have a product of (unless they are vertical and
horizontal), so or , so .
The lines intersect on the -axis,
which means the two lines intersect when .
Substituting and into the two equations, we get and .
The equation can be solved
to get . Substituting into gives or .
Answer:
Suppose , meaning that
the tens digit of is and the units digit of is so that .
Then and we have .
Dividing both sides by gives
.
We cannot have because would not be a two-digit integer.
Therefore, the smallest that can
be is , which means .
The integer is a digit, so , which implies or .
Therefore, can take on the values
, , , , , , and , for a total of possible values of , and hence, possible values of .
Answer:
Let be on so that is perpendicular to .
Then and have the same altitude,
.
Since they have equal areas and altitudes, they must also have equal
bases, so . In other words,
is the midpoint of .
By a fact about right-triangles that we will prove below, the midpoint
of the hypotenuse is equidistant from the three vertices of the
triangle, so we conclude that , but , so .
We now prove that if
has a right angle at , then the
midpoint of is equidistant from
, , and .
Suppose is the midpoint of and let and be on and , respectively, so that is perpendicular to and is perpendicular to .
Since has three right
angles, it must have four right angles and be a rectangle, which implies
.
Since and are parallel, we get that .
Since and are parallel, we get that .
By construction, is the midpoint
of , so we also have that .
Therefore, and are congruent by
angle-side-angle congruence.
From this congruence, we get that , but , so we have .
Consider and .
These triangles share side and
we have just shown that .
We also have that is
perpendicular to , so .
Therefore, and are congruent by
side-angle-side congruence.
From this congruence, we conclude that , but since is the
midpoint of , we also have , so .
Answer:
Let be the number rolled
on the -sided die and be the number rolled on the -sided die.
We will count ordered pairs
with the property that is a
multiple of and divide this total
by , the number of
possible rolls, to get the probability.
Suppose . Then for to be a multiple of , we must have that is a multiple of .
The only multiple of between
and inclusive is , so if , we must have .
Therefore, we get the ordered pair .
If or , then we also must have , so we get the pairs and .
If , then must be a multiple of , so , , or . We get pairs in this case: , , and .
By similar reasoning, there are three pairs for each of and .
If , then must be even, so , , , or , for a total of possibilities.
If , then is always a multiple of , so there are possibilities.
The table below summarizes the work above.
The sum of the numbers in the right column of the table is , so the probability is .
Answer:
The divisors of are
of which there are .
If is any of the positive divisors of , then is also positive and
.
Therefore, for each of the
positive divisors of , there is exactly one pair that
satisfies the given conditions.
By similar reasoning, if is
negative, then so is . Therefore,
if either or is any of , , , , or , then will be less than .
As well, in any divisor pair of , one of the two divisors is at least
in absolute value.
Therefore, one of and must be , , or .
If , then and , so we get the pair
.
If , then , so which is not greater than .
If , then , so which is not greater than .
Similarly, if then and we get the pair , and if or , then is not greater than .
From earlier, there are pairs
where and are both positive. We found two
additional pairs when and are both negative, and there are no
other pairs, so the answer is .
Answer:
A parabola with equation with has its maximum -value at .
For the given parabola, the maximum value occurs at .
The maximum -value is given to be
, so we must have
which can be rearranged to get .
Dividing through by gives , which can be factored to get
.
Therefore, the possible values of
are and .
When , the parabola has equation
. This parabola has a
maximum value at and a maximum value of .
When , the parabola has
equation . This
parabola has a maximum value at
and a maximum value of .
Therefore, the only possible values of are and , which have a sum of .
Answer:
We want to find , so
we first set .
The given information leads to the following three equations: Adding these equations gives Using ,
we get .
Rearranging this equation, we get , or .
Multiplying both sides by gives .
Answer:
Cubing both sides of the given equation, we get .
Clearing the denominator gives , and rearranging gives .
Factoring out of the right side
of the equation above gives . After dividing by , we get , and so .
Answer:
We begin by computing a few terms of the sequence to look for a
pattern.
When , and , so is even. Therefore, .
When , is odd, so .
When , is odd, so .
When , is even, so .
When , is odd, so .
When , is odd, so .
Since each term in the sequence depends only on the previous two terms,
the fact that we have a following
a again means that the sequence
is periodic. Specifically, the sequence is given by the six terms , , , , , repeating in that order.
Since , the first
terms in the sequence are
copies of the terms , , , , , and , followed by an additional and an additional .
Therefore, the sum of the first terms is
Answer:
For now, consider only the first five letters.
There are two possibilities for the second letter. There are also two
possibilities for the fourth letter since C and E are the only two
letters that can be followed by D.
Therefore, if a sequence of five letters starts with A and ends with D,
then it must be configured in one of the following four ways:
The first configuration above is impossible because there is no
letter with the property that it can both follow B and be followed by C.
The third and fourth configurations are impossible by similar
reasoning.
Looking at the second configuration, the only letter that can follow B
and be followed by E is C, and so we conclude that A, B, C, E, D is the
only sequence of five letters starting with A and ending with D.
Therefore, the first five letters must be A, B, C, E, and D in that
order.
Using similar reasoning, since the fifth letter is D and the ninth
letter is A, there are four possible configurations of the fifth through
ninth letters:
We will examine these four configurations separately.
For the first configuration, C is the only letter that can follow A and
be followed by D, so one possible sequence is D, A, C, D, A.
For the second configuration, both B and C can follow A and be followed
by E, so we get D, A, B, E, A and D, A, C, E, A as possible
sequences.
For the third configuration, both C and E can follow B and be followed
by D, so we get D, B, C, D, A and D, B, E, D, A as possible
sequences.
For the fourth configuration, C is the only letter that can follow B and
be followed by E , so the only possible sequence is D, B, C, E, A in
this case.
There are six possibilities for the last five letters and only one for
the first five, so there are six possible sequence in total.
Answer:
If Ferd removes Tile , then
the board will be configured as shown below, and it can be checked that
every available move with this configuration will cause his opponent to
lose. Therefore, Ferd will win if he removes Tile .
We will now show that every other move will give his opponent the
ability to guarantee that they win.
Currently, Tiles , , , , and share an edge with an empty square. If
Ferd removes a tile that shares an edge with any of these six tiles,
then he will lose the game.
Therefore, if Ferd removes Tile ,
Tile , Tile , or Tile , he will lose.
Consider the three configurations below. In the first, Tiles and have been removed, in the second, Tiles
and have been removed, and in the third,
Tiles and have been removed.
Notice that in each of the three configurations above, no remaining
tile shares an edge with with at least two empty squares.
As well, it can be verified that removing any tile from any of these
configurations will cause at least one tile to share an edge with at
least two empty squares.
Therefore, if a player is faced with the board in any of the three
configurations above, they will lose the game.
If Ferd removes any of Tiles ,
, , , or , his opponent can guarantee a
win.
To see why, consider the possibility that Ferd removes Tile . Then his opponent can remove Tile
to leave him in with the first
configuration above.
His opponent will have a similar move if Ferd removes any of Tiles , , , or , according to one of the three
configurations.
We now have that Ferd will lose (provided his opponent makes the correct
next move) if he removes Tile ,
Tile , Tile , Tile , Tile , Tile , Tile , Tile , or Tile . This means he must remove Tile to have any chance of winning.
Answer: Tile
Using exponent rules, and so .
As well, ,
so we have which implies .
Using that , we
have from which it
follows that ,
and so
or .
The values of with for which
are
, , , and .
Every value of with is equal to
one of these four values plus a multiple of .
Since is larger than but
is less than , we can
add to the four
angles for , , , , and and get a value of in the range .
This gives -values.
We also get and in the desired range, but
is too large, so is
the largest possible value.
This gives a total of
possible values of in the given
range.
Answer:
In the diagram below, is
on so that is perpendicular to .
Since is the midpoint of , we have .
The height of with
base is equal in length to .
Since the ratio of the area of to the area of is
, we have From , we get
.
Since , we get
.
The line segments and are parallel, so .
As well, , so we get that and are similar by angle-angle
similarity.
Thus, we have , but
and , so or .
If we let , then we have , and so .
Therefore, is , which can be
simplified to .
Answer:
Solution 1
Let and observe
that
So we have that ,
provided is a real number of the
form .
Setting and
rearranging gives , which
has two real roots since the discriminant of the quadratic is .
Therefore, is of the given
form, so .
Solution 2
We will first find a value of
for which .
Rearranging this equation, we get . By the quadratic formula,
If , then
by construction,
and we have A similar
calculation shows that if , then as well. Therefore
.
Answer:
We will begin by counting the total number of s that are printed when the integers
from through are printed.
The integers less than that
have at least one are and a total of of the digits written above are .
When printing the integers from
through , there will be 1s coming from the hundreds digit of
each of these integers, plus an additional s coming from the tens and units digits,
as counted above.
When printing the integers from
to , the digit will be printed times.
Since the s digit is not again from to , the digit will be printed exactly times from to , to , and so on up to to .
Therefore, the number of times the digit is printed when the integers from through are printed is When printing the
integers from to , the digit will be printed once as the thousands
digit for each integer, and an additional times for units and tens digits, for a
total of times. Adding to the
previous total, in printing the first positive integers, the computer
prints the digit a total of times.
When the computer prints the integers from to , there will be two s for each integer coming from the
thousands and hundreds digits, plus an additional s, for a total of s. The computer will have printed s when it has printed the first positive integers.
The number of s from to is , and the number of s from through is also , so after the first positive integers have been printed,
s have been printed.
There are exactly s from to , for a total of by the time is printed.
Since the integer has one of
its digits equal to , the th is printed when the integer is printed.
Answer:
In this solution, logarithms are base unless their base is explicitly
given.
We can rewrite as . Using this,
exponent rules, and the change of base formula for logarithms, we get
Therefore, we
get or .
Noting that , we
conclude that .
Therefore, or
.
Answer:
The unit circle’s position is completely determined by the
location of its centre. Let be
the region inside the square with the property that if the centre of the
circle is inside , then the
circle will be completely inside the square. Similarly, let be the region inside the square with
the property that if the centre of the circle is inside , then the circle will intersect
exactly two of the line segments. The probability is the area of divided by the area of .
In the diagram below, a square of side length is centred inside so that there is a "strip" of
uniform width between the
squares.
Notice that every point inside the smaller square is at least unit away from the boundary of , and every point inside the "strip"
is less than unit away from the
boundary of . Therefore, a
circle of radius will be
completely inside exactly when
its centre is inside the smaller square.
This means the smaller square is , so the area of is .
In the diagram below, a circle of radius and a square of side-length are centred at . The vertices of the square are
labelled , , , and .
Suppose the centre of the circle is outside the square of side-length
.
If the centre is somewhere above , then every point on , , and is more than one unit away from the
centre of the unit circle, so it is impossible for the unit circle to
intersect any of these line segments.
Therefore, all points above are
outside of .
Similarly, all points below , to
the left of , and to the right of
are outside of .
These four regions combine to form the entire region outside , so we conclude that is contained in .
If the centre of the unit circle is inside the circle centred at , then is inside the unit circle (since both
circles have radius ). In this
situation, all four of , , , and intersect the unit circle.
Therefore, the region inside the circle centred at is not in .
Finally, we suppose the centre of the unit circle is in one of the four
regions inside but outside the
circle centred at .
For example, suppose the centre of the unit circle is in the top-left of
these four regions, with as a
vertex.
Then the centre of the circle is within unit of and , so it must intersect both of them.
However, every point on the interior and is more than unit away from the centre of the unit
circle (since all such points are at least as far away as ).
We have now shown that if the centre of the unit circle is in this small
region, then the unit circle will intersect the interior of and , but not or .
By similar reasoning, the entire region inside and outside the circle centred at
is inside . We have also shown that these are
the only possible points in , so
the area of is the difference
between the area of and a
circle of radius , or .
The probability is .
Answer:
The number of ways to place zero heads in a row is . This can only be done by placing six
tails in the row.
The number of ways to place two heads in a row is .
The number of ways to place four heads in a row is .
The number of ways to place six heads in a row is .
Thus, the number of ways to place an even number of heads in a row is
.
Suppose the first five rows have been arranged to have an even number of
heads in each row. This can be done in ways.
In order to have an even number of heads in a given column, there is
only one possibility for the coin in the bottom row in that column: if
the first five rows have an even number of heads in that column, then
the sixth must be a tail, and if the first five rows have an odd number
of heads in that column, then the sixth must be a head.
By the previous paragraph, there is exactly one way to assign coins to
the bottom row so that the columns all have an even number of
heads.
Once the coins in the bottom row are arranged, there are an even number
of heads in each column, so the total number of heads in the grid must
be even.
Since the number of heads in the first five rows is even and the total
in all six rows is even, the number of heads in the last row must also
be even.
In other words, if the first five rows are arranged to have an even
number of heads in each row, then there is exactly one way to arrange
the coins in the sixth row so that all conditions are satisfied.
Therefore, the number of ways that the coins can be arranged is .
Answer:
The radius of a circle is equal to its circumference divided by
. Therefore, the radius of the
base is , and the
radius of the horizontal cross-section through is .
We will first determine the distance from point to directly along the surface. This is
equal to the length along the slant height from the base to the
cross-section.
We will draw a perpendicular line from to the base of the cone, intersecting
the base at .
The diagram below is a vertical cross-section of the bottom of the
cone.
The length of is given to be
and the length of is equal to the difference of the
radii of the base and the cross-section, which is .
By the Pythagorean theorem, .
If we let be the centre of the
base of the cone, then is similar to .
Since is a radius of the base,
we have . We saw
earlier that , so .
Since is similar to
, ,
so .
We will now imagine cutting the top of the cone along line segment . This will give a sector of a circle
with the circumference of the base forming the outer arc, and the
circumference of the cross-section through forming a smaller sector with the same
angle and centre as the larger sector.
The radius of the larger sector is , and the length of the arc at the
bottom is equal to the circumference of the base of the cone, which is
.
The circumference of a circle with radius is , and since , the
angle of the sector is
of the angle in a full circle, or .
The length of is , and the shortest path around the
surface of the cone is the line segment connecting to in the sector.
In from the diagram
above, we have , , and .
Using the Cosine law, we have
Answer:
The polynomial factors as To find this
factorization, you might first guess that the quartic factors as the
product of two quadratics. The leading coefficient is and the constant term factors as . Looking at other
coefficients, the factorization can be discovered by trial and
error.
The roots of are
The roots of are
A quadratic always has either ,
, or real roots. Since the given quartic is
the product of two quadratics, a root of the quartic must be a root of
one or both of the quadratics.
For the quartic to have exactly
real roots, either one quadratic has distinct real roots and the other has
no real roots, or each quadratic has real root, and those roots are different.
Suppose both quadratics have exactly real root. This implies both quadratics
have their discriminant equal to .
Therefore, and . The first equation is
equivalent to and the
second is equivalent to .
Therefore, the first quadratic has exactly real root when or , and the second has exactly real root when or .
Therefore, there is no real number for which both quadratics have exactly
real root.
We have now shown that the only way for the quartic to have exactly
real roots is for one of the
quadratics to have real roots and
the other to have no real roots.
Examining discriminants again, we require either and or and .
Suppose and .
The second of these two inequalities is equivalent to , which is equivalent to
or .
The first is equivalent to , which is equivalent to
or . These inequalities can be
rearranged to get or .
We now conclude that the quartic will have exactly real roots if and either or .
The inequality is
incompatible with the condition , so we must have and .
Putting these together, we get that .
Now suppose and
. By similar
reasoning to the previous case, the first of these inequalities implies
and the second
implies either or .
This leads to , but we
only want positive values, so the
answer is that the quartic has exactly roots when .
Answer:
(Note: Where possible, the solutions to parts (b) and (c) of each
Relay are written as if the value of is not initially known, and then is substituted at the end.)