Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
77 views2 pages

MODSMO October 2023

The document describes the problems for the October 2023 MODSMO competition. It provides 6 proof-based problems of varying difficulty to be answered in 4.5 hours. Electronic devices are prohibited. The problems cover topics like sequences, inequalities, geometry, arrangements of intervals, similarity of polygons, and properties of prime numbers.

Uploaded by

Prabha kumari
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
77 views2 pages

MODSMO October 2023

The document describes the problems for the October 2023 MODSMO competition. It provides 6 proof-based problems of varying difficulty to be answered in 4.5 hours. Electronic devices are prohibited. The problems cover topics like sequences, inequalities, geometry, arrangements of intervals, similarity of polygons, and properties of prime numbers.

Uploaded by

Prabha kumari
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/ 2

MODSMO

Round Two
October 2023

Version: 2023-10-14T05:50

Instructions:

• You will have 4.5 hours to answer 6 problems requiring proof, each of which carries
7 marks.

• 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

• Submit your answers using the Google Form provided by the CMS bot.
Time allowed: 4.5 hours September 2023 MODSMO

Question 1. Let n be a positive integer. A sequence a1 , a2 , . . . , an is called good if the


following conditions hold:

• For each i ∈ {1, 2, . . . , n}, 1 ≤ ai ≤ n

• For all positive integers i, j with 1 ≤ i ≤ j ≤ n, the expression

ai + ai+1 + · · · + aj

is not divisible by n + 1.

Find the number of good sequences (in terms of n).

Question 2. Let a, b, c, d be positive reals with a − c = b − d > 0. Show that


√ √ !4
ab a+ b
≥ √ √ .
cd c+ d

Question 3. Let △ABC be a triangle with orthocenter H, and let M, N be the


midpoints of BC and AH respectively. Suppose Q is a point on (ABC) such that
∠AQH = 90◦ . Show that M N , the circumcircle of QN H, and the A-symmedian concur.
Note: the A-symmedian is the reflection of line AM in the bisector of angle ∠BAC.

Question 4. Let k be a positive integer. An arrangement of finitely many open


intervals in R is called good if for any of the intervals the number of other intervals
which intersect with it is a nonzero multiple of k. Find the maximum positive integer n
(as a function of k) for which there is no good arrangement with n intervals.

Question 5. Let n ≥ 3 be a positive integer. Consider two convex polygons with n


vertices: A = A1 A2 . . . An and B = B1 B2 . . . Bn . A triple (i, j, k) of pairwise distinct
integers with 1 ≤ i, j, k ≤ n and i < k is said to be common if ∠Ai Aj Ak = ∠Bi Bj Bk .
A and B are said to be similar if all triples (i, j, k) of pairwise distinct integers with
1 ≤ i, j, k ≤ n and i < k are common.
Determine in terms of n the least positive integer m such that, if there exist at least m
pairwise-distinct common triplets (i, j, k), then A and B are necessarily similar.

Question 6. Let p be a prime such that p−1 2 is also prime. A pair of integers (x, y)
with 1 ≤ x, y ≤ p − 1 is called a commuter if at least one of xy − y x or xy + y x is divisible
√
by p. Show that the number of commuters is at most 4.2p p.

You might also like