DSMC1_S2024_Draft
DSMC1_S2024_Draft
ROUND 1
August 2-5, 2024
§1 Problems
1. [1] Find the value of the digit x in which the number 345x is divisible by 12.
Find p + q.
5. [1] In the circuit below, the yellow circle represents a lightbulb, the rectangle
represents a battery, the other circles represent switches, and the line segments
represent connections between the objects. Each of the eight switches can only
turn two ways: the purple switch can turn left or upward, the blue switches can
turn right or upward, and the green switches can turn right or downward. Any two
adjacent switches cannot point to each other. The lightbulb will only light up if
there is a cycle that is formed with the connections that go through the lightbulb,
the battery, and some switches. An example where the lightbulb lights up is shown
in the diagram. How many configurations of the switches cause the lightbulb to
light up?
8. [2] Kaiser is giving an multiple choice correct type exam. He can attempt a problem
in three ways: fully confidently, half confidently or without knowing it at all.
2
The Olympiad Team (August 2-5, 2024) DSMC Summer 2024 Round 1
The probability that the answer is correct given he has answered fully confidently is
9
. The probability that the answer is correct given he has answered half confidently
10
2
is . The probability that the answer is correct given he has answered without
3
1
knowing it is .
5
3
The probability that Kaiser doesn’t know the answer of a question at all is . Given
20
that he attempts all the questions, and the probability of a question being answered
9
without knowing by Kaiser given that it is correct is . If the probability that
221
a
Kaiser answer a question fully confidently is for relatively prime positive integers
b
p, q, find 100p + q.
9. [2] Let {an }n≥0 ne a sequence with a0 = 27 and an+1 = 37a2n + 2an for nonnegative
integers n. Evaluate ⌊log a20 ⌋.
√
10. [2] △ABC has circumradius equal to 3 3. X, Y, Z are points on sides BC, AC, AB
respectively such that AX is median and BY is angular bisector of ∠ABC, √ and
AX, BY, CZ are concurrent line segments. The lengths of AB, AC are 3 3, 9
27 √
respectively. The inradius of △AZC is r. If can be written as a + b c + d f
p
r
where a, b, c, d, f are integers and c ̸= f . If c, f are square free then value of
a + b + c + d + f.
12. [3] The sum of digits of n is 2024. Find the sum of the possible values of the sum
of digits of 2n.
13. [3] △ABC has AB = 10, AC = 12. X is on BC such that AX bisects ∠BAC. D is
a point on ray AX such that CD = 18. If the maximum value of ∠CDA − ∠BDA
p
is θ, and sin2 θ = for relatively prime positive integers p, q, find p + q.
q
14. [3] Culver is walking around the plane. He starts from the origin, and makes 10
random moves, each 1 unit long, in one of the 4 principal directions. Given that he
returns to the origin in the end, the probability that he returns to the origin exactly
p
twice can be written as for relatively prime positive integers p, q. Find p + q.
q
15. [3] x, y, z are rational numbers such that
3 √ √ √
q
3 √
2−1= 3x+ 3y+ 3z
p
If xyz = where p, q are relatively prime integers with q > 0, find p + q.
q
3
The Olympiad Team (August 2-5, 2024) DSMC Summer 2024 Round 1
16. [4] For any positive integer n, let f (n) denote the maximum positive integer m
such that there exists constants ai,j where 1 ≤ i ≤ n and 1 ≤ j ≤ m with absolute
value 1 such that for any reals x1 , x2 , ..., xm , the following holds true:
2
n
X Xm m
X
ai,j xj = n x2j
i=1 j=1 j=1
Find
2024
X
f (n)
n=1
.
17. [4] △ABC has centroid G and incenter I. D is a point of side BC. Lines AD, IG
intersect at M . BM intersects side AC at E. If BD = 4, CD = 6, CE = 3, AB −
p
AC = 2, AE = where p, q are relatively prime positive integers, find 10p + q.
q
18. [4] A triple of integers (a, b, c) is called nice if
5 5 5 2a 2b 2c 27 2025
+ + − − − = − .
a b c bc ca ab 2(a + b + c) abc(a + b + c)
Let C be the number of nice triples, M, m be the maximum and minimum of a+b+c
over all nice triples. Find 1000000C + 1000M + m.
19. [4] Culver and Kaiser play a game. There are 2024 stacks of stones, arranged from
left to right, such that the number of stones in each stack is a positive divisor of
20241024 . Each turn, with Culver starting first, the person must choose one of the
stacks with more than one stone, and split it into multiple (more than one) stacks
with equal number of stones. The player who cannot move loses. Compute the
number of initial configurations such that Kaiser has a winning strategy, modulo
10000.
x3 + bx2 + cx + d = 0,
x3 − γx − 16 = 0
where γ is an integer. Both equations do not have integer solutions. Given that
there are exactly 6 possible values for γ, find the sum of these values.