Scribd
Upload
101 views2 pages

Cheenta Rmo Mock: Anushka Aggarwal 12 April 2020

1. The document contains 6 math problems involving geometry, combinatorics, and set theory. 2. Problem 1 involves an isosceles triangle inscribed in a circle and proves that as a variable point varies, the circumcircle of another triangle passes through a fixed point. 3. Problem 2 asks to find the least integer N such that removing 2020 elements from 1,2,...,N allows finding 2020 distinct numbers with sum N among the remaining elements.

Uploaded by

Ritoprovo Roy
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
101 views2 pages

Cheenta Rmo Mock: Anushka Aggarwal 12 April 2020

1. The document contains 6 math problems involving geometry, combinatorics, and set theory. 2. Problem 1 involves an isosceles triangle inscribed in a circle and proves that as a variable point varies, the circumcircle of another triangle passes through a fixed point. 3. Problem 2 asks to find the least integer N such that removing 2020 elements from 1,2,...,N allows finding 2020 distinct numbers with sum N among the remaining elements.

Uploaded by

Ritoprovo Roy
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

Cheenta Rmo Mock

Anushka Aggarwal
12 April 2020

Problem 1:The isosceles triangle 4ABC, with AB = AC, is inscribed in


_
the circle ω. Let P be a variable point on the arc BC that does not contain
A, and let IB and IC denote the incenters of triangles 4ABP and 4ACP ,
respectively.
Prove that as P varies, the circumcircle of triangle 4P IB IC passes through
a fixed point.

Problem 2:Find, with proof, the least integer N such that if any 2020 el-
ements are removed from the set 1, 2, ..., N , one can still find 2020 distinct
numbers among the remaining elements with sum N .

Problem 3:Solve in integers the equation


 3
2 2 x+y
x + xy + y = +1 .
3

Problem 4:Steve is piling m ≥ 1 indistinguishable stones on the squares of


an n × n grid. Each square can have an arbitrarily high pile of stones. Af-
ter he finished piling his stones in some manner, he can then perform stone
moves, defined as follows. Consider any four grid squares, which are corners of
a rectangle, i.e. in positions (i, k), (i, l), (j, k), (j, l) for some 1 ≤ i, j, k, l ≤ n,
such that i < j and k < l. A stone move consists of either removing one stone
from each of (i, k) and (j, l) and moving them to (i, l) and (j, k) respectively,j
or removing one stone from each of (i, l) and (j, k) and moving them to (i, k)
and (j, l) respectively.
Two ways of piling the stones are equivalent if they can be obtained from
one another by a sequence of stone moves.
How many different non-equivalent ways can Steve pile the stones on the
grid?

Prroblem 5:Quadrilateral AP BQ is inscribed in circle ω with 6 P = 6 Q = 90◦


and AP = AQ < BP . Let X be a variable point on segment P Q. Line AX
meets ω again at S (other than A). Point T lies on arc AQB of ω such that
XT is perpendicular to AX. Let M denote the midpoint of chord ST . As X

1
varies on segment P Q, show that M moves along a circle.

Problem 6:Let S be a set with 2020 elements, and let N be an integer with
0 ≤ N ≤ 22020 . Prove that it is possible to color every subset of S either black
or white so that the following conditions hold:
(a) the union of any two white subsets is white; (b) the union of any two
black subsets is black; (c) there are exactly N white subsets.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy