Scribd
Upload
168 views5 pages

MODSMO June 2023

The document provides instructions for a 14 question, 3 hour exam with short answer and proof questions. Short answer questions are worth 2 marks each and involve math problems with integer answers. The proof question is worth 7 marks and involves analyzing a game where a number is replaced with a "cuter" multiple each round until no cuter multiple remains. The top 30 scorers will advance to the next round.

Uploaded by

Gabriel Goh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
168 views5 pages

MODSMO June 2023

The document provides instructions for a 14 question, 3 hour exam with short answer and proof questions. Short answer questions are worth 2 marks each and involve math problems with integer answers. The proof question is worth 7 marks and involves analyzing a game where a number is replaced with a "cuter" multiple each round until no cuter multiple remains. The top 30 scorers will advance to the next round.

Uploaded by

Gabriel Goh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

MODSMO

Round One
3–4 June 2023

Version: 2023-06-03T01:11

Instructions:

• You will have 3 hours to answer 14 short-answer questions, each of which carries
2 marks, and 1 problem requiring proof, which carries 7 marks.

• The answer to every short-answer question is a non-negative integer.

• Rulers, compasses, protractors, and erasers may be used but will not be required.
All electronic devices, including calculators, are prohibited.

• All questions are listed roughly in order of difficulty, but the problem requiring
proof is intended to be roughly the same difficulty as an easier question.

• Submit your answers using the Google Form provided by the CMS bot.

• The top 30 contestants and some wildcards will qualify to Round Two.
Time allowed: 3 hours June 2023 MODSMO

Short-Answer Questions (2 marks each)


Question 1. What is the area of the region of points inside the shape closest to the
marked vertex compared to any other vertex?

24

24

48

Question 2. On an island live 2022 people who could be either a knight, who always
says the truth, or a clown, who always lies. They are all having lunch on a big circular
table when each person says: “among the two people next to me, exactly one of them is
a knight.” How many clowns are there? Give the sum of all possible values.

Question 3. Consider all polynomials of degree 10 whose coefficients are either 0 or


1. (In particular, note that the coefficient of x10 will always be 1.) How many of them
return odd outputs for all integer inputs?

Question 4. A circular mirror in the plane is defined by the equation x2 + y 2 = 1. A


light beam starts at the point (0, 1). When the light beam hits the mirror, it follows the
law of reflection. How many different directions can the light beam be shone (assuming
it must be shone into the unit circle) so that it first comes back to the point (0, 1) after
exactly 2023 reflections? (Note: when the light beam hits (0, 1), it doesn’t reflect again.)

Question 5. A funnynomial is an expression of the form

F (x) = a2023 x|x|2022 + a2022 x|x|2021 + · · · + a1 x|x|0 + a0 x|x|−1 ,

where a0 , . . . , a2023 are real numbers, not all 0. What’s the maximum possible number
of roots a funnynomial can have? (A root of a funnynomial F is a real number x ̸= 0
such that F (x) = 0.)

Question 6. Find the largest value of x over all positive integer solutions to

4y − 200 = x2 + x + 56.
Time allowed: 3 hours June 2023 MODSMO

Question 7. A cylinder with radius 24 and height 18 has points X and Y on its top
face so that minor arc XY subtends 120◦ . A plane slices the cylinder through X,
√ Y , and
the center of the cylinder. The area of the shape the plane cuts through is G B + F π
where G, B, and F are integers and B is not divisible by the square of any prime. Find
G + B + F.

Question 8. For each positive integer k, define Sk (n) to be the sum of the digits of
n when expressed in base-k. Let a0 , a1 , a2 . . . be a sequence defined by a0 = 102023 − 1
and an = S5 (an−1 ) for all integers n ≥ 1. Let D be the number of trailing zeroes in the
decimal representation of the following product:
420
Y
ai !
i=0

Compute S10 (D).

Question 9. Let M be the minimum real number for which the inequality

x2023
1 + x2023
2 + · · · + x2023 2022
n−1 + M ≥ x1 x2 + x2022
2 x3 + · · · + x2022
n−1 xn

holds  all positive integers n and all real numbers 0 ≤ x1 ≤ x2 ≤ · · · ≤ xn ≤ 1. Find


 6 for
10 M .

Question 10. A sequence of points A1 , A2 , A3 , . . . is called a circumsequence if no


three consecutive points are collinear, and for each positive integer j, the circumcenter of
Aj Aj+1 Aj+2 is Aj+3 . An integer x ∈ (0, 180) is coloured green if, for all circumsequences
with ∠A2 A1 A3 = x◦ , there exists a point P such that Ai P tends to 0. Find the sum of
all the green integers.

Question 11. A parallelogram ABCD is inscribed in a hyperbola H with foci P, Q.


It is given that AP = 5, P Q = 7, BD = 15 and AC = 17. Compute DP + DQ.

Question 12. A frog sits on the origin in the Cartesian plane. In a jump, the frog
may move from a lattice point (x, y) to another lattice point (x′ , y ′ ) such that

• x ≤ x′ and y ≤ y ′ , and

• the distance between (x′ , y ′ ) and (x, y) is exactly 5.

It chooses each possible point that it can jump to uniformly at random. After 42 jumps,
the frog is at a distance d from the origin. Find the expected value of d2 .
Time allowed: 3 hours June 2023 MODSMO

Question 13. Let S be the set {1, 2, 3, . . . , 286}. Find


X X
gcd(x, y) − gcd(x, y).
x,y∈S x,y∈S
x+y≥287 x+y≤287

Question 14. A positive integer n is called brainy if there exist coprime positive
integers a and b satisfying

n | ap(n) + bp(n) , but n ∤ a + b,

where p(n) denotes the largest prime divisor of n. Find the number of integers 1 ≤ m ≤
100 such that 2023m is brainy.
Time allowed: 3 hours June 2023 MODSMO

Proof Question (7 marks)


Given two positive integers A and B whose base 10 digits are a0 . . . au and b0 . . . bv
respectively, we say that A is cuter than B if there is some index j ≤ min{u, v} such
that ai = bi for all i = 0, . . . , j − 1 and aj < bj . For example, 123456 is cuter than 12355,
but neither 12345 nor 123456 is cuter than the other.
Niko now plays a game by picking a positive integer N and writing one of its multiples
M N on a blackboard. Every minute Niko tries to think of a cuter multiple of N than
the one written in the board, and if there is one they will erase the current number and
write the cuter one. For what choices of M and N can we be sure that the game will
eventually end?

You might also like