Sipnayan 2019 Junior High School 1

Semifinal Round A
Easy Round: 2pts, 30s
2
SFA E-1 A positive divisor of 1010 is chosen at random. What is the probability that it is prime? [ ]
121
SOLUTION
= 2 ⋅ 5 . Then it has (10 + 1)(10 + 1) = 121 positive divisors, two of which
10 10 10
We have 10
2
are prime. Thus the probability is .
121
m + 2015 m+y
SFA E-2 For what real values of y will the equation = have no solution for m?
m + 2017 m + 2019
[2017, 2019]
SOLUTION
m + 2015
Note that m + y cannot be either of the two denominators. If y = 2019, then =
m + 2017
m + 2015
1; if y = 2017, then = 1. Both of these are impossible. For other y, we can solve
m + 2019
for m by cross-multiplying and solving the resulting linear equation.

SFA E-3 Woody and Bo Peep each secretly chose a random integer in the set {0, 1, 2, . . . , 100}, then multi-
7701
plied their chosen numbers together. What is the probability that the result is even? [ ]
10 201
SOLUTION
The product is odd if and only if both chosen numbers are odd. Among the numbers
{0, 1, 2, . . . , 100}, 50 are odd. Then the probability that the product is odd is equal to
2
50 2500
( ) = . Therefore, the probability of the complement, that the product is even,
101 10 201
2500 7701
is 1 − = .
10 201 10 201

SFA E-4 Let x = a + b, y = a − b, and z = ab, where a and b are real numbers. Find all pairs (a, b) that
satisfy x(y2 + z) + y(x 2 − z) = 250 000. [(50, b) where b ∈ R]
SOLUTION
Substituting x = a + b, y = a − b, z = ab, we get

x(y + z) + y(x − z) = (a + b)((a − b) + ab) + (a − b)((a + b) − ab)

2 2 2 2

= (a + b)(a − ab + b ) + (a − b)(a + ab + b )
2 2 2 2

= (a + b ) + (a − b ) = 2a .
3 3 3 3 3

3 √
3
In other words, 2a = 250 000 ⇒ a = 125 000 = 50. Note that the choice of b has no
2 2
effect on the expression x(y + z) + y(x − z).

SFA E-5 Let ABCD be a square, and let E be the midpoint of segment BC. Construct a circle centered at
A that passes through B and D, and a circle centered at E that passes through B and C. These two
circles intersect at two points; one of them is B, and name the other point of intersection as F.
Find the measure of ∠AFE. [90○ ]
SOLUTION
We draw segment AE as shown in the figure. (Only the parts of the circles that are inside
the square are drawn, to save space.)

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 2

A B

D F C
Since AB and AF are radii of the circle centered at A, and EB and EF are radii of the circle
centered at E, then we have AB = AF and EB = EF. Therefore, △ABE ≅ △AFE, as they
◦
have the same corresponding side lengths. That means that ∠AFE = ∠ABE = 90 .

Average Round: 3pts, 60s

SFA A-1 In a convex n-sided polygon, the measure of all but two of the interior angles of the polygon is
equal to 160○ . What is the sum of all possible values of n? [187]
SOLUTION
◦
The sum of the interior angles of an n-sided polygon is 180(n − 2) . Since the polygon is
◦
convex and all but two of the interior angles have measure 160 , the sum of the interior
angles has to be less than (160(n − 2) + 360) . Thus, we have
◦

180(n − 2) < 160(n − 2) + 360

20(n − 2) < 360
n < 20

(22)(17)
Therefore, n ∈ {3, 4, . . . , 19}; and the desired sum is 3 + 4 + ⋯ + 19 = = 187.
2

SFA A-2 Find the last three digits of 99811 . [952]

SOLUTION
Note that 998 = 1000 − 2, so we will apply the binomial formula. In the sum

(1000 − 2) = 1000 − 1000 ⋅ 2 ⋅ ( 11

1 ) + ⋯ + 1000 ⋅ 2 ⋅ ( 10 ) − 2 ,
11 11 10 1011 11

11
each term, except for −2 = −2048, is divisible by 1000. This means that the last three
11
digits of 998 are 1000 − 048 = 952.

SFA A-3 How many 1000-character strings are there that only consist of vowels (a, e, i, o, and u) and no
two adjacent letters in the string are the same? Express your answer as a product of prime powers.
[21998 × 5]
SOLUTION
For the first character, we have five vowels to choose from. For the second character, we
only have four vowels to choose from, since we cannot choose the first character. We
can continue this up to the 1000th character: each character after the first cannot be the
same as the one before it, so there are four vowels to choose from. By the multiplication
999 1998
principle, the total number of permissible strings is 5 ⋅ 4 = 5 ⋅ 2 .

SFA A-4 Suppose x integers are chosen without repetition from the set {1, 2, 3, . . . , 2019}. If the probabilty
that there are at least two elements from the chosen integers whose difference is 19 is 100%, what
is the least value of x? [1013]
SOLUTION
We first find the maximum number of elements such that it is possible to have no two
elements in the set with difference 19, then add one to that.

Note that 2019 = 106 ⋅ 19 + 5. We tabulate the number of integers from 1 to 2019 that
leave a remainder of n when divided by 19, for all possible remainders n.

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 3

n 0 1 to 5 6 to 18
Number 106 107 each 106 each

From each group of 106 or 107, we can get half of the numbers. For example, the
numbers that are divisible by 19 are {19, 38, 57, . . . , 2014}. We can choose either
{19, 57, 95, . . . , 1995} or {38, 76, 114, . . . , 2014} to be part of the x integers.

Then the maximum would be the choose 53 integers for those with 106 integers, and 54
for those with 107. This is equal to 53 ⋅ 14 + 54 ⋅ 5 = 1012. If we add one more number
n, say with remainder r when divided by 19, then we would have one too many integer
that leaves a remainder of r when divided by 19. In other words, either n + 19 or n − 19
is already in our set. Therefore, 1013 is the least value of x.

SFA A-5 Let equilateral triangle XY Z with side length 9 be inscribed in a circle and let A be on minor
√ arc
XY such that AX × AY = 14. Find the length of AZ. [ 95]
SOLUTION
A X

Y Z

Since A, X, Y, and Z lie on the same circle, Ptolemy’s theorem states that AX ⋅Y Z +AY ⋅X Z =
AZ ⋅ X Y. Substituting X Y = X Z = Y Z = 9, we get AX + AY = AZ. Let’s try to find a relation
between AX ⋅ AY and AX + AY.
◦ ◦ ◦
As opposite angles of a cyclic quadrilateral add up to 180 , ∠X AY = 180 − ∠X ZY = 120 .
To get a relation relating sides AX and AY, and ∠X AY, we use the cosine law on △AX Y:
2 2 2
X Y = AY + AX − 2 ⋅ AX ⋅ AY ⋅ cos ∠X AY
2 2 2 ◦
9 = AY + AX − 2 ⋅ AX ⋅ AY ⋅ cos 120
−1
81 = (AY + 2AY ⋅ AX + AX ) − 2AX ⋅ AY − 2AX ⋅ AY ⋅
2 2
2
81 = (AY + AX) − AX ⋅ AY = (AY + AX) − 14
2 2

95 = (AY + AX)
2

√
95 = AY + AX = AZ

Difficult Round: 5pts, 90s

SFA D-1 Find the difference between the maximum and minimum values of f (x) = ∣x +3∣−∣2x −6∣+∣x −4∣.
[12]
SOLUTION
The critical points of f (x) are at −3, 3, and 4. The following table shows the values of
∣x + 3∣, ∣2x − 6∣, and ∣x − 4∣ when x is in the intervals (−∞, −3), (−3, 3), (3, 4), and (4, ∞).
x ⋯ −3 ⋯ 3 ⋯ 4 ⋯
∣x + 3∣ −x − 3 0 x +3
∣2x − 6∣ −2x + 6 0 2x − 6
∣x − 4∣ −x + 4 0 x −4
f (x) −5 ↗ 7 ↘ 5
Thus, when x ∈ (−∞, −3], f (x) = (−x − 3) − (−2x + 6) + (−x + 4) = −5.

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 4

When x ∈ (−3, 3], f (x) = (x + 3) − (−2x + 6) + (−x + 4) = 2x + 1.

When x ∈ (3, 4], f (x) = (x + 3) − (2x − 6) + (−x + 4) = −2x + 13.
When x ∈ (4, ∞), f (x) = (x + 3) − (2x − 6) + (x − 4) = 5.

Since f (x) is composed of linear functions, the only thing left to check is f (3), which is 7.
Thus, the minimum and maximum of f (x) are −5 and 7 respectively. The desired answer
is 7 − (−5) = 12.

SFA D-2 In the diagram below, BC is perpendicular to AC. D is a point on BC such that BC = 4BD. E
is a point on AC such that AC = 8CE. If AD = 41 cm and BE = 13 cm, determine the√length of
AB. [4 109 cm]

B
D

A E C
SOLUTION
Let EC = x and BD = y. Then AE = 7x and DC = 3y. We apply the Pythagorean theorem
on △BEC and △ADC:
2 2 2 2 2 2 2
13 = BE = BC + EC =4 y +x (1)
2 2 2 2 2 2 2 2
41 = AD = DC + AC = 3 y + 8 x (2)
2 2
Multiplying 41 to (1) and 13 to (2), and then subtracting, results in

(164 − 39 )y + (41 − 104 )x = 0

2 2 2 2 2 2

(164 + 39)(164 − 39)y = (104 + 41)(104 − 41)x

2 2

(203)(125)y = (145)(63)x
2 2

2 2
25y = 9x
2
Multiplying 3 to (1) gives

39 = 12 y + 3 x = (12 + 5 )y = 13 y ,
2 2 2 2 2 2 2 2 2 2

so y = 3 and x = 5. Finally, applying the Pythagorean theorem on △ABC, we obtain

2 2 2 2 2 √
AB = AC + BC = 64x + 16y = 16(4 ⋅ 25 + 9) ⇒ AB = 4 109.

SFA D-3 How many positive integers less than 2019 have a digit sum of 10? [120]
SOLUTION
We consider three cases.

Case 1. Two- or three-digit numbers. Consider the following diagram:

We have 10 lines, and we are to put two vertical bars in the 11 spaces (including
before the first and after the last line) to separate them. This represents our sum.
For example, 3 + 0 + 7 is represented by

∣ ∣
ÍÒÒ Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ñ Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ï ÍÒÒ Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ñ Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ò Ï
3 7

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 5

There are ( 12
2 ) − 3 = 63 ways to rearrange the ten and two ∣, removing the
cases 0 + 10 + 0, 10 + 0 + 0, and 0 + 0 + 10.
Case 2. Four-digit numbers with thousands digit 1. Then the last three digits add up to
9. We follow a similar argument as above; there are 55 ways for this case.
Case 3. Four-digit numbers with thousands digit 2. The only possible numbers in this
case are 2008 and 2017.

All in all, there are 63 + 55 + 2 = 120 numbers that satisfy the given conditions.

SFA D-4 Bo Peep, Billy, Goat, and Gruff are playing a dart game at the carnival. There is a square grid split
into 11 rows, each with 11 columns, totalling 121 cells. Each of them throws a dart which will
land in a random cell — assume that it is equally likely for each dart to end up in any of the cells,
each player’s dart is unaffected by the other darts, and it is possible for more than one dart to land
in the same cell. If their four darts land in four different cells, and the four cells that were hit form
the shape of an axis-aligned retctangle, they win! What is the probability that they win the game?
a 600
Express your answer in lowest terms and in the form n , where p is prime. [ 6]
p 11
SOLUTION
2
There are 11 squares for the dart to land, for each of the four people. Since throws are
8
independent, the number of configurations of squares the four darts will hit is 11 .

The desired configuration is of the following form:

Notice that the hit squares lie on two pairs of rows and columns of squares. Thus, to
get such a configuration, we simply need to choose a pair of distinct rows and a pair of
distinct columns, getting the four intersections that arise from them. There are ( 11
2 ) = 55
ways to choose a pair of rows, and 55 ways to choose a pair of rows.

Finally, we multiply by 4! = 24, to account for the order the darts are thrown. This is due
8
to our previous computation of 11 , which assumes that the darts are distinct. Thus, the
55 ⋅ 55 ⋅ 24 25 ⋅ 24 600
probability is = = 6.
118 116 11

SFA D-5 In triangle ABC, AB = x + 3y, BC = x + 2y, and CA = x + y, where x is a positive integer and
0 < y < 2. If the length of the altitude to side BC is equal to x, how many possible values of x are
there? [23]
SOLUTION
Since y ≠ 0, let k be a positive number such that x = k y. Thus, AB = (k + 3)y,
BC = (k + 2)y, C A = (k + 1)y, and the altitude to BC has length k y. Then the area of
2
k(k + 2)y
△ABC is .
2
We can also compute the area of the triangle using Heron’s formula. The semiperimeter
3y
of the triangle is s = (k + 2). Then
2
√
√ 3y(k + 2) y(k + 2) y(k + 4) yk
[△ABC] = s(s − a)(s − b)(s − c) = ⋅ ⋅ ⋅
2 2 2 2
y
2 √
= (k + 2) 3k(k + 4).
4

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 6

We equate the two expressions we got for the area to get:

√
2 2
2k = 3k(k + 4) ⇒ 4k = 3k + 12k ⇒ k = 0, 12

Since k > 0, we have k = 12. Thus, x = 12y. Since 0 < y < 2, then 0 < x < 24. Then there
are 23 possible values of x, which are 1, 2, ..., 23.

Tiebreaker: 5min
SFA TB-1 Find the second largest positive integer n such that (n − 1)3 is divisible by n + 8. [235]
SOLUTION
(n − 1)
3 3
−9
= (some integer)+ . For (n −1) to be divisible
3
By the remainder theorem,
n+8 n+8
by n + 8, the fraction must be an integer. In other words, n + 8 has to be a factor of
3 6 6 5
−9 = −3 . The second largest factor of −3 is 3 = 243; thus, n + 8 = 243 gives us
n = 235.

Semifinal Round B
Easy Round: 2pts, 30s
SFB E-1 In the dodecagon composed of 12 unit squares below, the line AB divides the figure into two
XB 1
regions with areas 4 and 8. Find the value of . [ ]
BZ 5
X
B

A Z
SOLUTION
From the figure above, we are to assume that B has to lie in the upper third of segment
X Z. We move the three squares to the right of X Z to the upper left area of the figure, as
shown:
X
B

A Z
Then the region below segment AB has area 8 − 3 = 5. Since AZ = 4, we have ZB = 2.5.
X B 0.5 1
Then = = .
BZ 2.5 5

SFB E-2 In a math competition called IPSNAYAN, the average of the participants is 14 years old, while the
average age of the coaches is 35 years old. Taken together, the average age of both groups is 18
years old. What is the ratio, in lowest terms, of number of participants to number of coaches?
[17 ∶ 4]
SOLUTION
If there are x participants and y coaches, then we have the average of both groups to be

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 7

14x + 35y
18 = x + y ⇒ 18x + 18y = 14x + 35y ⇒ 4x = 17y. Thus x ∶ y = 17 ∶ 4.

SFB E-3 Any of Duck and Bunny’s plans have a 75% chance to be absolutely horrible, and a 25% chance to
be somewhat okay. If they pitch 5 plans to Woody, what is the probability that at least one of them
781
isn’t absolutely horrible? [ ]
1024
SOLUTION
We compute first for the probability of the complement, which is the event that all of the
3
five plans are absolutely horrible. Each of the plans have a chance of being absolutely
4
horrible, and so by the multiplication principle, the probability that all five are absolutely
5
3 243
horrible is ( ) = . Therefore, the probability that at least one is not absolutely
4 1024
243 781
horrible is 1 − = .
1024 1024

SFB E-4 Let n be a three-digit number, and n′ be the number obtained by reversing the digits of n. Find
all n such that n + n′ = 524. [163, 262, 361, 460]
SOLUTION
From the condition, we can see that the sum of the first and last digits is 4 and that twice
the sum of the middle digit is 12. Thus, the possible three-digit numbers are 163, 262,
′
361, and 460, the latter included because n is not required to be a three-digit number.

SFB E-5 Let a, b, and c be positive real numbers such that a = 2b 2 = 5c 3 = abc. What is the value
√ of
abc? [ 5 200]
SOLUTION
We raise each of the following equations to some exponent:
6 6 6 6
a = abc ⇒ a = a b c
2 6 3 3 3
2b = abc ⇒ 8b = a b c
3 6 2 2 2
5c = abc ⇒ 25c = a b c

Multiplying the three equations together gives

6 6 6 11 11 11 5 5 5 √
5
200a b c = a b c ⇒ 200 = a b c ⇒ 200 = abc.

Average Round: 3pts, 60s

SFB A-1 Let N be the least common multiple of the first 15 positive integers. What are the last three digits
of N? [360]
SOLUTION
The least common multiple of the first 10 positive integers is 2520. The only numbers
from 11 to 15 that do not divide 2520 are 11 and 13. Thus, the least common multiple of
the first 15 positive integers is 2520 ⋅ 11 ⋅ 13. The last three digits of 2520 ⋅ 11 are 720, and
the last three digits of 720 ⋅ 13 are 360.

SFB A-2 Suppose a1 , a2 , a3 , . . . , a19 are the roots of the equation x 19 − 20x − 19 = 0. Find the exact value of
19
∑ a 19
i . [361]
i=1

SOLUTION
We rewrite the equation as x = 20x + 19. This is satisfied by all x ∈ {a1 , a2 , . . . , a19 }.
19

Furthermore, from Vieta’s formulas, the sum of the roots is 0 (the negative of the quotient

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 8

18 19
when the coefficient of x is divided by the coefficient of x ). Therefore,
19 19 19 19
∑ a i = ∑(20x + 19) = 20 ∑ x + ∑ 19 = 0 + 19 = 361.
19 2

i=1 i=1 i=1 i=1

SFB A-3 There are 2017 men, numbered from 1 to 2017, and 2019 women, numbered from 1 to 2019. Man
i can only be paired with woman j if i ≤ j. If each woman can only be paired with at most one
man, in how many ways can each man be paired with exactly one woman? [32017 ]
SOLUTION
Man 2017 has three women that he can be paired with: woman 2017, woman 2018, and
woman 2019. After he chose his partner, man 2016 also has three women that he can be
paired with: the two remaining women from 2017 to 2019, and woman 2016. This goes
on and on until the last man (man 1). Each man will have 3 woman that he can be paired
2017
with. Thus, there are 3 ways to pair the men and women.

1 97
SFB A-4 Given that sin 2θ = − , find sin6 θ + cos6 θ. Express the answer in lowest terms. [ ]
5 100
SOLUTION
1 1
From the double-angle identity, we have 2 sin θ cos θ = − ⇒ sin θ cos θ = − . The
5 10
2 2
Pythagorean identity states that sin θ + cos θ = 1. Squaring both sides, we obtain

4 2 2 4 4 4 2 49
1 = sin θ + 2 sin θ cos θ + cos θ ⇒ sin θ + cos θ = 1 − = .
100 50
6 6
Finally, we factor sin θ + cos θ as a sum of two cubes:
49 1 97
sin θ + cos θ = (sin θ + cos θ)(sin θ − sin θ cos θ + cos θ) =
6 6 2 2 4 2 2 4
− = .
50 100 100

SFB A-5 A cone may be created from a semicircular sheet of paper by joining the ends together. What
√ is
125 3π
the volume of the cone formed if the sheet of paper has radius 10? [ ]
3
SOLUTION
To get the volume of a cone, we need the height and the radius of the cone. To get the
radius of the cone, we first calculate the perimeter of the base, which is the length of the
semicircular arc, which is 10π. This means that the radius of the cone is 5.

Note that the radius of the sheet of paper is the slant height of the cone. (This can be
seen when you join the ends together. The “end” is a radius of the semicircle and is now
a slant√height of the cone.) By the Pythagorean theorem, we get the height of the cone
√
to be 102 − 52 = 5 3.
2
√ √
πr h π(25)(5 3) 125 3π
Therefore, the volume of the cone is = = .
3 3 3

Difficult Round: 5pts, 90s

SFB D-1 Find all possible ordered pairs (X, Y) such that the number 7 2X3 640 548 981 270 644 Y72 is di-
visible by 99. [(4, 6)]
SOLUTION
We color the digits red and blue as shown:
7 2X3 640 548 981 270 644 Y72
The sum of the red digits is 51 + X and the sum of the blue digits is 38 + Y.

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 9

From the divisibility rule for 9, (51 + X) + (38 + Y) = 89 + X + Y must be divisible by 9.

Since 0 ≤ X + Y ≤ 18, then 89 + X + Y is either 90 or 99, or X + Y is either 1 or 10.

From the divisibility rule for 11, (51 + X) − (38 + Y) = 13 + X − Y must be divisible by 11.
Since −9 ≤ X − Y ≤ 9, then 13 + X − Y is either 11 or 22, or X − Y is either −2 or 9.

Since X and Y are nonnegative integers, X + Y and X − Y must be both odd or both even,
and X + Y should be greater than or equal to X − Y. From the possible values of X + Y
and X − Y, we can only have X + Y = 10 and X − Y = −2, which has a solution X = 4,
Y = 6.

SFB D-2 In a circle, there are three parallel chords of length 16, a, and b, respectively, where a, b < 16. The
distance between the two chords of length 16 and a is 2 units while the distance between √ the two
chords of length 16 and b is 22 units. If a = b, what is the value of a? [4 5 units]
SOLUTION
In the figure below, AB and CD are two congruent chords, and GH = 16. We draw diam-
eter EF, parallel to the other three chords.
A B
X

E F
O
G H
Y
C D
Furthermore, we construct right triangles BOX and YOG. Note that since the distance
between AB and CD is 24 units, the distance between AB and EF is half the amount. That
is, XO = 12 and OY = 10. We apply the Pythagorean theorem on △GOY:
2 2 2
GO = GY + OY = 64 + 100 = 164

However, GO = BO as both are radii of the circle. Applying the Pythagorean theorem on
△BOX, we have
2 2 2 2 2
164 = GO = BO = BX + XO = BX + 144
√ √ √
or BX = 20 = 2 5. But BX is half of AB, so a = AB = 4 5.

SFB D-3 Define ⌊x⌋ to be the greatest integer less than or equal to x. Find the number of positive integers
n < 2525 such that n = x⌊x⌋. [1250]
SOLUTION
Let k be a positive integer. We first consider all real numbers x such that ⌊x⌋ = k. In
2
other words, k ≤ x < k + 1. Then k ⋅ k ≤ x⌊x⌋ < k(k + 1) = k + k. Since we want x⌊x⌋ to
be an integer, k ≤ x⌊x⌋ ≤ k + k − 1. In other words, when ⌊x⌋ = k, x⌊x⌋ can take on k
2 2

different integer values. Furthermore, there is no overlap of ranges for different k, since
the upper limit k +k−1 is less than the lower limit for the next range, (k+1) = k +2k+1.
2 2 2

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 ⋯
k=1 k=2 k=3 k=4

2 2 2
Next, we find k such that k ≤ 2525 ≤ k + k − 1 (if it exists). Note that 50 = 2500 is
2 2
very close to 2525, and indeed, 50 = 2500 ≤ 2525 ≤ 2549 = 50 + 50 − 1, so k = 50.
Then if k = ⌊x⌋ < 50, x⌊x⌋ < 2525 already. From k = 1 to k = 49, we already have
2
1 + 2 + ⋯ + 49 = 25(49) = 35 = 1225 different values of n. For k = 50, we have the

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 10

numbers n = 2500, 2501, . . . , 2524. There are 25 numbers in the last list. Therefore, the
total number of positive integers that satisfy is 1225 + 25 = 1250.

SFB D-4 Woody, Buzz Lightyear, Mr. Potato Head, Rex, and six identical Aliens are to be seated around a
circular table. Given that each Alien must be seated next to at least one other Alien, how many
ways can they be seated around the table?* [156]
SOLUTION
We seat Woody in any of the seats and “unroll” the circular configuration so that the toys
are now seated on a line, with Woody on the first seat:

9 Wood
✁ y
8 1

Woody
7 2 ⇒
1 2 3 4 5 6 7 8 9

6 3
5 4

From any circular arrangement, we can “cut” the space between Woody and the one
sitting on his right to form the linear arrangement. From any linear arrangement with
Woody sitting on the leftmost spot, we can “glue” the ends together to recover the
circular arrangement.

In other words, the number of ways we can seat them around the table, subject to the
restrictions, is equal to the number of ways we can seat them along a line, with Woody
sitting on the leftmost spot, and subject to the same restrictions. So from this point
onward, we will only consider seating the other nine toys along a line.

We consider three cases. First, we have two groups of three aliens each together;
second, we have three groups of two aliens each together; and third, we have all six
aliens together.

In the first case, we have: Buzz, Potato, Rex, [group of 3 aliens], [group of 3 aliens]. Thus,
5!
there are = 60 ways to seat them into the remaining nine seats.
2!
In the second case, we have: Buzz, Potato, Rex, [group of 2 aliens], [group of 2 aliens],
6!
[group of two aliens]. Thus, there are = 120 ways to seat them into the remaining
3!
nine seats.

In the third case, we have: Buzz, Potato, Rex, [group of 6 aliens]. Thus, there are 4! = 24
ways to seat them into the remaining nine seats.

Now note that the third case is completely covered in both the first and second cases,
when the 2 groups of 3 aliens or 3 groups of 2 aliens are placed next to each other.
Thus, when we add the number of ways for the first and second ways, the arrangements
where all 6 aliens are together are counted twice. To fix this, we subtract the number of
ways (which is the third case).

In other words, the total number of ways is 60 + 120 − 24 = 156.

SFB D-5 In the figure below, Circles X and Y with centers A and C have radii 6 and 10 respectively. E is
* Official answer was 264.

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 11

a point outside the two circles such that triangle EAC is equilateral. EH is drawn such that it is
tangent to circle Y and EH = 17. AE intersects circle X at F, CE intersects circle Y at G, and line
AC intersects circle X at B. Find the value of 8EB2 − 5EH 2 − 3FG 2 . [560]
E

H
F G

A B C

SOLUTION
We need three pieces of information: the lengths of EB, EH, and FG. We already know
that EH = 17. We first calculate the side length of the triangle EAC. Note that △EHC is a
right triangle, with EC as its hypotenuse:
E
17

H
10

C
√ √ √
From the Pythagorean theorem, EC = EH2 + HC 2 = 289 + 100 = 389. We can now
compute for EB and FG:

E E
√ 389 −
−6

◦
60
9
√ 389

10
38
√

G
F
◦
60
B √ C
389 − 6

From cosine law, we have:

2 2 2 2 2
EB = EC + BC − 2EC ⋅ BC cos C = EC + BC − EC ⋅ BC
√ √
= 389 + ( 389 − 6)(−6) = 425 − 6 389
2 2 2 2 2
FG = FE + EG − 2FE ⋅ EG cos E = FE + EG − FE ⋅ EG
√ √ √
= (389 − 12 389 + 36) + ( 389 − 10)(−4) = 465 − 16 389

Therefore,
2 2 2 √ √
8EB − 5EH − 3FG = 8(425 − 6 389) − 5(289) − 3(465 − 16 389)
= 8(425) − 5(289) − 3(465) = 5(425) − 5(289) − 3(40)
= 5(136) − 120 = 680 − 120 = 560.

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 12

Final Round
Easy Questions: 2pts, 30s
6
1
F E-Woody If x = (4 + √ √ √ ) , find the value of x. [4225]
652 + 3 4160 + 84
3 3

SOLUTION
2 2 √3
√3
The denominator of the fraction is of the form x + x y + y , where x = 65 and y = 64.
This means we can rationalize the fraction in the following way:
√ √ √
65 − 4 √
3 3 3
1 65 − 64 3
√ √ √ ⋅ √ √ = = 65 − 4
3 2 3
65 + 4160 + 8
3 4 3 3
65 − 64 65 − 64
√
Therefore, x = ( 65) = 65 = 4225.
3 6 2

F E-Buzz An equilateral triangle has side length x and height y. Find x 2 ∶ y 2 . [4 ∶ 3]

SOLUTION
2 √ 2
ab x ◦ 3x
An equilateral triangle with side length x has area sin C = sin 60 = . But this
2 2 4√
3x
is equal to half the product of the base x and the height, so the height is y = . Hence
2
2
2 2 2 3x
x ∶y =x ∶ = 4 ∶ 3.
4

F E-Hamm It is known that the equation x 2 − ax + 107b = 0 has distinct, positive, integral roots. Given that
a and b are prime numbers, what is the value of a + b? [111]
SOLUTION
By Vieta’s formulas, the sum of the roots is a and the product is 107b. Since 107 is prime,
and the roots are positive integers, the two roots are either {b, 107} or {107b, 1}.

In the former case, we have b + 107 = a. But a and b are both prime. Since one of a and
b has to be even, the only possible solution is b = 2, a = 109, giving a + b = 111.

In the latter case, we have 107b + 1 = a. Again, one of 107b and a has to be even, so
b has to be 2. But then a = 215 is not prime. Thus this case is impossible, and the only
value of a + b is 111.

F E-Potato Duke Caboom claims that if he flips a fair coin n times and rolls a fair six-sided die 5 times, it is
more likely for his die to land on a number greater than 2 five times in a row than it is for his coin
to land on heads for all n times. Find the minimum value of n for which his claim is true. [3]
SOLUTION
5
2
The probability for his die to land on a number greater than 2 five times in a row is ( ) ,
3
n
1
while the probability for his coin to land on heads all n times is ( ) . Therefore, we have
2
5
2 1
5
> n
3 2
5+n 5
2 > 3 = 243
7 8
Since 2 = 128 < 243 < 256 = 2 , then 5 + n = 8 ⇒ n = 3.

ab 1 1 1 1 1 1 1 1
F E-Forky If a ♡ b = √ , what is (( √ ♡ √ ) ♡ ( √ ♡ √ )) ♡ (( √ ♡ √ ) ♡ ( √ ♡ √ ))?
a2 + b2 1 7 3 5 2 8 4 6

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 13

1
[ ]
6
SOLUTION
In general, √ √
1 1 1/ x y 1/ x y 1
√ ♡√ =√ =√ =√ .
x y (1/x + 1/y) (x + y)/x y x+y
Thus,

1 1 1 1 1 1 1 1
(( √ ♡ √ ) ♡ ( √ ♡ √ )) ♡ (( √ ♡ √ ) ♡ ( √ ♡ √ ))
1 7 3 5 2 8 4 6
1 1 1 1 1 1 1 1
= (√ ♡ √ ) ♡ (√ ♡ √ ) = √ ♡ √ = √ = .
8 8 10 10 16 20 36 6

Average Questions: 3pts, 60s

F A-Woody Consider the set of all ordered quintuples of integers (a1 , a2 , a3 , a4 , a5 ), where each element sat-
isfies 1 ≤ a i ≤ 7. How many such quintuples satisfy a1 < a2 < a3 and a3 > a4 > a5 ? [371]
SOLUTION
Clearly, 3 ≤ a3 ≤ 7. When a3 = k ∈ {3, 4, 5, 6, 7}, then there are ( k−1
choices for the pair 2 )
(a1 , a2 ), and also for the pair (a4 , a5 ). (Choose two numbers from 1 to k − 1, then let a1
be the smaller and a2 be the greater; respectively, a5 and a4 .)

Therefore the total number of quintuples is

( 22 ) + ( 32 ) + ( 42 ) + ( 52 ) + ( 62 ) = 1 + 3 + 6 + 10 + 15 = 371.
2 2 2 2 2 2 2 2 2 2

1009
F A-Buzz Let θ be an angle such that sec4 θ − tan4 θ = 2019. What is the value of sin2 θ? [ ]
1010
SOLUTION
2 2
From the Pythagorean identities, we know that sec θ − tan θ = 1 for all θ. So

2019 = sec θ − tan θ = (sec θ − tan θ)(sec θ + tan θ)

4 4 2 2 2 2

2
2 1 + sin θ
2
= sec θ + tan θ =
cos2 θ
2 2
⇒ 2019 cos θ = 1 + sin θ
2 2
⇒ 2019(1 − sin θ) = 1 + sin θ
2 2019 − 1 1009
⇒ sin θ = = .
2019 + 1 1010

F A-Hamm How many integers k ≤ 2019 are there such that 3a + 3b + 3c = k, where a, b, and c are integers?†
[84]
SOLUTION
a b c
Clearly, from 3 + 3 + 3 = k, the integer k must be positive. We consider the base-3
representations of these integers. In particular, we have 2019 = 2 202 2103 . We have
three cases.

Case 1. a = b = c. Then the base-3 representation of k has exactly one non-zero digit,
which is a 1. Since 2019 in base 3 has seven digits, there are seven possible
−1 −1 −1
values of k. (In particular, 1 = 3 + 3 + 3 .)
Case 2. a = b ≠ c. Then the base-3 representation of k has exactly two non-zero digits,
one 1 and one 2. Therefore, there are 7 ⋅ 6 = 42 possible values of k, since

†
Official answer was 63.

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 14

2019 = 2 202 2103 > 2 100 0003 .

Case 3. a ≠ b ≠ c ≠ a. Then the base-3 representation of k has exactly three non-zero
digits, which are all 1’s. As the leading digit of 2019 in base 3 is a 2, there
( 73 ) = 35 possible values of k.

Thus, in total, 7 + 42 + 35 = 84 different values of k satisfy the given condition.

F A-Potato Let x and y be real numbers such that x 2 − 6x − 15 = 0 and y 2 − 6y − 15 = 0. Find all possible
√
values of x 3 − y3 . [0, ±204 6]
SOLUTION
3 3
If x = y, then x − y = 0. Suppose x ≠ y. Then by Vieta’s equations, x + y = 6 and
3 3
x y = −15. We express x − y in terms of x + y and x y:
√
x − y = (x − y)(x + x y + y ) = ± x 2 − 2x y + y 2 ((x + 2x y + y ) − x y)
3 3 2 2 2 2

√ √
= ± (x 2 + 2x y + y 2 ) − 4x y((x + y) − x y) = ± (x + y)2 − 4x y((x + y) − x y)
2 2

√ √ √
= ± 36 + 60(36 + 15) = ± 96(51) = ±204 6
3 3 √
Thus, the possible values of x − y are precisely 0 and ±204 6.

F A-Forky Gabby Gabby has 20 identical coins that she will give to 6 of her best friends, Benson, Banson,
Binson, Bonson, Bunson, and Forky. If each of her friends must receive at least one coin and one
of her friends should receive at least 10 coins, how many ways can she distribute the coins among
her friends? [1512]
SOLUTION
Since there are 20 coins to give, one friend will have at least 10 coins, and every one else
has at least one, there cannot be another friend with at least 10 coins. We first set aside
10 + 1 + 1 + 1 + 1 + 1 = 15 coins from the 20 coins. The remaining 5 coins, we can freely
give to any of her friends in any combination.

Using a similar argument as the one in SFA D-3, we find that there are ( 105 ) = 252 ways
to do this. Now among the six friends we choose one to give ten coins to (and the rest
will get one each). Therefore, the total number of ways is 252 ⋅ 6 = 1512.

Difficult Questions: 5pts, 90s

100
F D-Woody For how many integer values of a does the equation y = ∏ (x 2 − bx + a) intersect the x-axis
exactly 50 times? b=1
[37]
SOLUTION
2 2
The discriminant of x − bx + a is b − 4a. We want this to be strictly greater than zero for
25 values of b (so there will be two roots for each of these b), and negative for the other
75 values of b. In other words, we have
2 2 2 2
75 − 4a < 0 < 76 − 4a ⇒ 5625 = 75 < 4a < 76 = 5776.

Then the possible values for a are 1407, 1408, . . . , 1443, so there are 37 possible values
for a.

F D-Buzz Call a finite sequence of integers a mountain permutation if there exists some positive integer n
such that the sequence is a permutation of the first n natural numbers, and for some positive
integer k, the first k terms are increasing and the last n − k + 1 terms are decreasing. For example,
1, 3, 4, 2 and 5, 4, 3, 2, 1 are mountain permutations while 1, 4, 6, 3, 5, 2 and 4, 3, 2, 1, 5 are not.
How many mountain permutations of length 2019 are there? [22018 ]

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 15

SOLUTION
We show by induction that the number of mountain permutations of length n, where
n−1
n is a positive integer, is 2 . This is clearly true for n = 1 and n = 2, as the mountain
permutations of length 1 and 2 are (1), (1, 2), and (2, 1).

Suppose the statement is true for n = k. Then from any mountain permutation of length
k, we can form two of length k + 1 by placing k + 1 either to the left or the right of
k−1 k (k+1)−1
k. Thus there are 2⋅2 = 2 = 2 mountain permutations of length k +1, as desired.
2019−1 2018
Therefore, there are 2 =2 mountain permutations of length 2019.

x y2 z3
F D-Hamm Given that x, y, and z are non-negative real numbers and + 3 = 2019, minimize the √
value
3
of x + y + z. [6 6 56]
SOLUTION
Since x, y, z > 0, we can use the AM-GM inequality, in which we are taking the means of
y y z z z
x, , , , , and :
2 2 3 3 3
y y z z z √ √
x+y+z x + + + + + y 2
z 3
2 3
6 xy z
2 2 3 3 3
≥ x( ) ( ) =
6
=
6 6 2 3 108
2 3
However, from the given, x y z = 3(2019 − 3) = 3(2016) = 3(32)(63). Then
√
6 3(32)(63) √
6
x+y+z≥6 = 6 56.
108

F D-Potato What is the smallest five-digit positive integer whose digits are distinct and that is divisible by
each of its digits? [12 384]
SOLUTION
To minimize this number, we first consider five-digit numbers starting with 123.

If the tens digit is 4, then the units digit must be 8. But 12 348 is not divisible by 8.

If the tens digit is 5, then the units digit must be 5. But 12 355 has repeated digits.

If the tens digit is 6, then the units digit must be 6. But 12 366 has repeated digits.

If the tens digit is 7, then for the number to be divisible by 7, the number must be 12 376.
However, this number is not divisible by 3.

If the tens digit is 8, then the units digit must be 8. As 12 384 is divisible by 4, then it is
the smallest that satisfies the conditions.

F D-Forky Find the product of the minimum and maximum values of a + b + c, where a, b, and c satisfy
a3 + b3 + c 3 + 3b 2 c + 3bc 2 + 9ab + 9ac = 27. [−18]
SOLUTION
3 3 3 2 2
We factor the expression a + b + c + 3b c + 3bc + 9ab + 9ac − 27, using the fact that
x + y + z − 3x yz factors as (x + y + z)(x + y + z − x y − x z − yz).
3 3 3 2 2 2

3 3 3 2 2
a + b + c + 3b c + 3bc + 9ab + 9ac − 27
= a + (b + c) + 9a(b + c) − 27
3 3

= (a + (b + c) − 3)(a + (b + c) + 9 − a(b + c) + 3a + 3(b + c))

2 2

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 16

1
= (a + b + c − 3)((a + 3) + (b + c + 3) + (a − b − c) )
2 2 2
2
So if this expression is 0, then either a + b + c = 3; or a + 3 = 0, b + c + 3 = 0, and
a − b − c = 0. In the second case, we have a = −3 and b + c = −3, so a + b + c = −6. As
the only possible values of a + b + c are 3 and −6, the product of the maximum and the
minimum is 3(−6) = −18.

Very Difficult Questions: 8pts, 120s

F VD-Woody Woody and his GANG GANG are on an adventure to save their friend Buzz Lightyear. However,
they would need access to Buzz’s computer which sould give out the exact location to Buzz’s Space
Ranger Armor. They need to enter his password and his computer shows the following text: “The
password is ‘BU ZZBU ZZ’ which is an 8-digit number. B, U, and Z are distinct digits. This
number also has exactly 4 distinct prime divisors. Lastly, this 8-digit number is the second such
number when all possible passwords are arranged from least to greatest.” What is the password?
[10 551 055]
SOLUTION
Note that BUZ ZBUZ Z = BUZ Z ⋅ 10 001 = BUZ Z ⋅ 73 ⋅ 137. We consider the smallest
possible values of BUZ Z.

BUZ Z = 1022: 1022 = 2 ⋅ 7 ⋅ 73, so 10 221 022 has 4 distinct prime factors, and this is the
smallest one.

BUZ Z = 1033: 1033 is prime, so 10 331 033 has 3 distinct prime factors.
2 2
BUZ Z = 1044: 1044 = 2 ⋅ 3 ⋅ 29, so 10 441 044 has 5 distinct prime factors.

BUZ Z = 1055: 1055 = 5 ⋅ 211, so 10 551 055 has 4 distinct prime factors, and this is the
second smallest one.

F VD-Buzz Buzz, Woody, and Lotso are shooting free throws. They take turns with Buzz shooting free throws
first, followed by Woody, and then, by Lotso. A player’s turn ends when he fails to shoot the free
throw. Buzz has a 50% chance of successfully shooting a free throw, Woody has a 40% probability
of successfully shooting a free throw, while Lotso only has a 25% probability of successfully shoot-
ing a free throw. The game ends when someone successfully shoots the free throw two consecutive
256
times. What is the probability Woody wins the game?‡ [ ]
655
SOLUTION
Let b be the probability that Woody wins given Buzz shoots first, w Woody first, and ℓ
Lotso first, still following the given rotation of players. Then we have the following sys-
tem:

b = (0.5)(1 + 0.5)w
w = (0.6)(1 + 0.4)ℓ + (0.4)
2

ℓ = (0.75)(1 + 0.25)b

Solving for w, we have

3 7 3 5 1 3 4 189 4
⋅ ⋅ ⋅ ⋅ ⋅ w+
w= = w+
5 5 4 4 2 2 25 320 25
131 4 256
⇒ w= ⇒w= .
320 25 655

F VD-Hamm Suppose two cubic polynomials f (x) and g(x) satisfy the following: f (2) = g(4); f (4) = g(8);
‡ 256
Official answer was .
655

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 17

f (8) = g(16); f (16) = g(32) + 64. What is the value of g(128) − f (64)? [−9920]
SOLUTION
Consider the polynomial h(x) = g(2x) − f (x), which has degree at most 3. Since h(x)
has at least three zeros (2, 4, and 8 are zeros) and h(16) ≠ 0, the degree of h(x) is ex-
actly 3, and is of the form h(x) = (k)(x − 2)(x − 4)(x − 8), where k is a nonzero real number.

From f (16) = g(32) + 64 we obtain h(16) = g(32) − f (16) = −64. Substituting x = 16 into
−1
h(x) = (k)(x − 2)(x − 4)(x − 8), we have −64 = h(16) = (k)(14)(12)(8) ⇒ k = . Then
21
1
g(128) − f (64) = h(64) = − (62)(60)(56) = −9920.
21

F VD-Potato Mr. Potato Head has an unlimited number of green coins worth 1 peso each, red coins worth
2 pesos each, blue coins worth 3 pesos each, and gold coins also worth 3 pesos each. Suppose
Mr. Potato Head wants to buy a drink worth 10 pesos in a vending machine. In how many ways
can Mr. Potato Head place his coins into the vending machine if a different ordering of colors is
considered a distinct way? [585]
SOLUTION
Let f (n) be the number of ways this can be done to buy an item worth n pesos. In other
words, we are finding f (10). Now, clearly, f (1) = 1, f (2) = 2, and f (3) = 5.

Now to get a configuration worth n pesos, we can start with a configuration worth n − 1
pesos and adding a green coin to the right, a configuration worth n −2 pesos and adding
a red coin to the right, or a configuration worth n − 3 pesos and adding a blue or gold
coin to the right. Therefore we have f (n) = f (n − 1) + f (n − 2) + 2f (n − 3). Then

f (4) = f (3) + f (2) + 2f (1) = 5 + 2 + 2 = 9

f (5) = f (4) + f (3) + 2f (2) = 9 + 5 + 4 = 18
f (6) = f (5) + f (4) + 2f (3) = 18 + 9 + 10 = 37
f (7) = f (6) + f (5) + 2f (4) = 37 + 18 + 18 = 73
f (8) = f (7) + f (6) + 2f (5) = 73 + 37 + 36 = 146
f (9) = f (8) + f (7) + 2f (6) = 146 + 73 + 74 = 293
f (10) = f (9) + f (8) + 2f (7) = 293 + 146 + 146 = 585.

Alternatively, solving for the recurrence results in

n+2 √
2 2 2nπ 3
f (n) = + √ cos ( − arctan )
7 21 3 9
√
4096 2 − 21 4095
⇒ f (10) = +√ ⋅ = = 585.
7 21 14 7
√
F VD-Forky Let x1 , x2 , x3 be the real roots of the equation 2019x 3 − 6058x 2 + 3 = 0 where x1 < x2 < x3 . Find
the exact value of 2019x2 (x1 + x3 ). [6057]
SOLUTION
Since the roots are all non-zero (the constant term is nonzero), we can take their recipro-
1 1 1
cals. Let α1 = x , α2 = x , and α3 = x . Then the cubic equation that has α1 , α2 , and α3
1 2 3
as roots is √
3
3x − 6058x + 2019 = 0.
√ √ √ √
Note that 2019 is√actually a root of this equation: 6057 2019 − 6058 2019 + 2019 = 0.
We factor out x − 2019 using synthetic division to get
√ √ √
3x − 6058x + 2019 = (3x + 3 2019x − 1)(x − 2019).
3 2

Sipnayan 2019: 2ınfinity & Beyond

 Sipnayan 2019 Junior High School 18

1
The product of the other two roots is − , so one of the other two roots is positive and
√ 3
the other is negative. We substitute 2019 into the quadratic factor:

3(2019) + 3(2019) − 1 = 6(2019) − 1 > 0

√
Then 2019 is the largest among α1 , α2 , α3 . Since there are two positive and one
1 √
negative roots, it follows that √ = x2 , so α2 = 2019.
2019
2019 1 1 2019(α1 + α3 )
We change 2019x2 (x1 + x3 ) into the new variables: α ( α + α ) = α1 α2 α3 .
√ 2
√ 1 3
2019 3 2019 √
From Vieta’s formulas, α1 α2 α3 = and α1 + α3 = − = 2019. Then
3 3
2019(α1 + α3 ) √ 3
2019x2 (x1 + x3 ) = α1 α2 α3 = 2019 2019 ⋅ √ = 6057.
2019

Sipnayan 2019: 2ınfinity & Beyond