Skip to main content

Problems I did this week #1[Jan1-Jan8]

 Random thoughts but I think these days I am more into Rock? Like not metal rock but pop/indie rock. Those guitars, drums, vocals everything just attracts me. 

The Rose, TXT, N.Flying, The western ghats, Seventeen, Enhypen and Woosung are my favourites currently. 

My current fav songs are:



Oki a few problems I did this week!

Tuymaada 2018 Junior League/Problem 2


A circle touches the side $AB$ of the triangle $ABC$ at $A$, touches the side $BC$ at $P$ and intersects the side $AC$ at $Q$. The line symmetrical to $PQ$ with respect to $AC$ meets the line $AP$ at $X$. Prove that $PC=CX$.

Proof: Note that $$\angle CPX=\angle APB=\angle AQP=\angle XQC\implies PQCX\text{ is cyclic}.$$ So $$\angle XPC=\angle AQP=\angle CXP.$$ We are done.

EGMO 2020 P1


The positive integers $a_0, a_1, a_2, \ldots, a_{3030}$ satisfy$$2a_{n + 2} = a_{n + 1} + 4a_n \text{ for } n = 0, 1, 2, \ldots, 3028.$$
Prove that at least one of the numbers $a_0, a_1, a_2, \ldots, a_{3030}$ is divisible by $2^{2020}$.

Proof: Well, note that $$2|a_1,\dots,a_{3029}\implies 4|a_2,\dots,a_{3028} \dots \implies 2^{2020}|a_{1010}.$$

TSTST 2021/P1 

Let $ABCD$ be a quadrilateral inscribed in a circle with center $O$. Points $X$ and $Y$ lie on sides $AB$ and $CD$, respectively. Suppose the circumcircles of $ADX$ and $BCY$ meet line $XY$ again at $P$ and $Q$, respectively. Show that $OP=OQ$.

Proof: Let $BQ \cap (ABCD)=M$, $DP\cap  (ABCD)=N$, $BQ\cap DP=Z$. 
Note that $$\angle BQY=\angle BAD=\angle BXD\implies QP||MD.$$ Similarly, we have $$BN||QP\implies BM=DN.$$

We also have $$\angle BQY=180-\angle XPD\implies LQ=LP\implies L\in \text{ perpendicular bisector of } QP.$$

So we have $L\in \text{ perpendicular bisector of } MD,BN.$ But $O\in \text{ perpendicular bisector of } MD,BN.$

So $OL$ is perpendicular bisector of $QP$.

Iran TST 2007 Day 2


Let $\omega$ be incircle of $ABC$. $P$ and $Q$ are on $AB$ and $AC$, such that $PQ$ is parallel to $BC$ and is tangent to $\omega$. $AB,AC$ touch $\omega$ at $F,E$. Prove that if $M$ is midpoint of $PQ$, and $T$ is intersection point of $EF$ and $BC$, then $TM$ is tangent to $\omega$

Proof: Define $X$ as the tangency point from $T$ to $\omega$. Note that $(X,D;F,E)=-1\implies A-X-D$.  Define $D'$ as the antipode of $D$. So we have $\angle D'XD=90$. Define $Y'=AX\cap PQ$. We will show that $MD'=MX=MY$. Note that $\omega$ is the excircle of $\Delta APQ$, so $D'$ is the extouch point. And by homothety, $Y$ is the in-touch point. Hence $YM=MD'\implies MX=MD'$.


USAMO 2007 P1


Let $n$ be a positive integer. Define a sequence by setting $a_{1}= n$ and, for each $k > 1$, letting $a_{k}$ be the unique integer in the range $0\leq a_{k}\leq k-1$ for which $a_{1}+a_{2}+...+a_{k}$ is divisible by $k$. For instance, when $n = 9$ the obtained sequence is $9,1,2,0,3,3,3,...$. Prove that for any $n$ the sequence $a_{1},a_{2},...$ eventually becomes constant.

Proof: Define $a_1+a_2+\dots+a_k=k\times b_k$.

Claim: $b_i\ge b_{i+1}$
Proof: $$(i+1)b_{i+1}-ib_i\le i\implies (i+1)b_{i+1}\le i(b_i+1)\implies b_{i}+1>b_{i+1}.$$

Note that $\exists k$ such that $a_1+a_2+\dots+a_k=mk$ where $m\le k$ then $m=a_{k+1}=a_{k+2}=\dots$

Now the sequence $<b_i>$ is non decreasing and sequence $<i>$ is increasing. So $\exists l$ such that $b_i\le l$ and we are done. 


USAMO 2001 P4


Let $P$ be a point in the plane of triangle $ABC$ such that the segments $PA$, $PB$, and $PC$ are the sides of an obtuse triangle. Assume that in this triangle the obtuse angle opposes the side congruent to $PA$. Prove that $\angle BAC$ is acute.

Proof: Note that by Ptolemy, we have $$(AB\cdot PC)+(PB\cdot AC)\ge AP\cdot BC\implies (AB\cdot PC+PB\cdot AC)^2\ge AP^2\cdot BC^2.$$

By CS inequality, we have $$(AC^2+AB^2)(PB^2+PC^2)\ge  (AB\cdot PC+PB\cdot AC)^2.$$
Since obtuse angle, we have $$PB^2+PC^2<AP^2\implies AC^2+AB^2>BC^2$$
which shows $\angle BAC$ is acute.


USAMO 2001 P5


Let $S$ be a set of integers (not necessarily positive) such that

(a) there exist $a,b \in S$ with $\gcd(a,b)=\gcd(a-2,b-2)=1$;
(b) if $x$ and $y$ are elements of $S$ (possibly equal), then $x^2-y$ also belongs to $S$.

Prove that $S$ is the set of all integers.

Proof: We begin with the following claim.

Claim: $((a^2-a)^2-a^2,(b^2-b)^2-b^2,a^2-b^2)=1$
Proof: If $$p|(a^4-2a^3,b^4-2b^3,a^2-b^2\implies p|a^3(a-2),p|b^3(b-2),p|(a+b)(a-b).$$
Note that $p\ne 2$ as $(a,b)=1$. So if $p|a^3(a-2)\implies$ $p|a$ or $p|a-2$. WLOG $p|a\implies p|b-2$. So $p|a-b+2,p|a+b-2$. But $p|a+b$ or $p|a-b$. This forces $p=2$.

Claim: if $m,n,c\in S$ then $k(m^2-n^2)+c\in S\forall k\in \Bbb{Z}$.
Proof: $$m^2-c\in S, n^2-c\in S\implies m^2-[n^2-c]\in S$$
And we can go on.

By bezouts $\exists$ $I_1,I_2,I_3\in \Bbb{Z}$ such that $$I_1((a^2-a)^2-a^2)+I_2((b^2-b)^2-b^2)+I_3(a^2-b^2)=\pm 1$$

Since $c\in S$ we get $I_1((a^2-a)^2-a^2)+I_2((b^2-b)^2-b^2)+I_3(a^2-b^2)\in S$. This will cover all integers.  

Generalised USAMO 2000 P4


Find the smallest positive integer $m$ such that if $n$ squares of a $n \times n$ chessboard are colored, then there will exist three colored squares whose centers form a right triangle with sides parallel to the edges of the board.

Proof: The answer is $2(n-1)+1$.
The construction for $2(n-1)$ is easy. 

Suppose not. Then $\exists 2(n-1)+1$ cells, which when coloured, we do not get a right triangle. Now, we count the number of pairs of cells $[(x_1,y_1),(x_2,y_2)]$ such that $x_1\ne x_2$ and $y_1\ne y_2$. Call such pairs "good pairs".

Note that if $(x_1,y_1),(x_2,y_2)$ are coloured then we cannot have $(x_1,y_2),(x_2,y_1)$ coloured. 

Note the number of non-coloured cells $\ge \text{ the number of good pairs }+1$ because any good pair will give rise to at least one new cell which is not coloured. 

Note that for any cell in the $2(n-1)+1$ cells will form a good pair with at least $n-1$ other cells [because in worst case max $n-1$ cells share same row/colum, we can't more else we will get a right triangle]

So $$\text{ the number of good pairs }\ge \frac{(2n-1)(n-1)}{2}.$$

Note that $$n^2=\text{ no of non-coloured }+ \text{ coloured cells }$$

So $$n^2\ge \frac{(2n-1)(n-1)}{2}+1+2n-1>(n-1)^2+1+2n-1=n^2+1$$

Not possible.

Comments

Popular posts from this blog

My experiences at EGMO, IMOTC and PROMYS experience

Yes, I know. This post should have been posted like 2 months ago. Okay okay, sorry. But yeah, I was just waiting for everything to be over and I was lazy. ( sorry ) You know, the transitioning period from high school to college is very weird. I will join CMI( Chennai Mathematical  Institue) for bsc maths and cs degree. And I am very scared. Like very very scared. No, not about making new friends and all. I don't care about that part because I know a decent amount of CMI people already.  What I am scared of is whether I will be able to handle the coursework and get good grades T_T Anyways, here's my EGMO PDC, EGMO, IMOTC and PROMYS experience. Yes, a lot of stuff. My EGMO experience is a lot and I wrote a lot of details, IMOTC and PROMYS is just a few paras. Oh to those, who don't know me or are reading for the first time. I am Sunaina Pati. I was IND2 at EGMO 2023 which was held in Slovenia. I was also invited to the IMOTC or International Mathematical Olympiad Training Cam...

Orders and Primitive roots

 Theory  We know what Fermat's little theorem states. If $p$ is a prime number, then for any integer $a$, the number $a^p − a$ is an integer multiple of $p$. In the notation of modular arithmetic, this is expressed as \[a^{p}\equiv a{\pmod {p}}.\] So, essentially, for every $(a,m)=1$, ${a}^{\phi (m)}\equiv 1 \pmod {m}$. But $\phi (m)$ isn't necessarily the smallest exponent. For example, we know $4^{12}\equiv 1\mod 13$ but so is $4^6$. So, we care about the "smallest" exponent $d$ such that $a^d\equiv 1\mod m$ given $(a,m)=1$.  Orders Given a prime $p$, the order of an integer $a$ modulo $p$, $p\nmid a$, is the smallest positive integer $d$, such that $a^d \equiv 1 \pmod p$. This is denoted $\text{ord}_p(a) = d$. If $p$ is a primes and $p\nmid a$, let $d$ be order of $a$ mod $p$. Then $a^n\equiv 1\pmod p\implies d|n$. Let $n=pd+r, r\ll d$. Which implies $a^r\equiv 1\pmod p.$ But $d$ is the smallest natural number. So $r=0$. So $d|n$. Show that $n$ divid...

IMO Shortlist 2022 C1

  Today we shall try IMO Shortlist $2022$ C1. A $\pm 1$-sequence is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and$$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$ We claim that the answer is $\boxed{506}$. $506$ is the upper bound. Just consider the sequence $$+1,-1,-1,+1,+1,-1,-1,+1\dots,-1,-1,+1,+1,-1.$$ Here $1, -1, -1, 1$ is repeated $505$ times and $1,-1$ is concatted to it. Now,our sequence would be $a_1,a_3,a_4,a_5,a_7,\dots$ which on summing would give $506$. And clearly, this would give the upper bound. Now, we show that $506$ is attainable by every sequence. WLOG there are at least $1011$ positive numbers in the sequence. Then we choose $+1$ whenever we can. Let the sequence be $c_1,b_1,\dots, c_n,b_n$ where $c_i$ are ...

IMO Shortlist 2021 C1

 I am planning to do at least one ISL every day so that I do not lose my Olympiad touch (and also they are fun to think about!). Today, I tried the 2021 IMO shortlist C1.  (2021 ISL C1) Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$. Suppose not. Then any $3$ elements $x,y,z\in S$ will be $(x,y)=(y,z)=(x,z)$ or $(x,y)\ne (y,z)\ne (x,z)$. There exists an infinite set $T$ such that $\forall x,y\in T,(x,y)=d,$ where $d$ is constant. Fix a random element $a$. Note that $(x,a)|a$. So $(x,a)\le a$.Since there are infinite elements and finite many possibilities for the gcd (atmost $a$). So $\exists$ set $T$ which is infinite such that $\forall b_1,b_2\in T$ $$(a,b_1)=(a,b_2)=d.$$ Note that if $(b_1,b_2)\ne d$ then we get a contradiction as we get a set satisfying the proble...

Geometry ( Finally!!!)

 This is just such an unfair blog.  Like if one goes through this blog, one can notice how dominated  Algebra is!! Like 6 out of 9 blog post is Algebra dominated -_- Where as I am not a fan of Algebra, compared to other genres of Olympiad Math(as of now). And this was just injustice for Synthetic Geo. So this time , go geo!!!!!!!!!!!  These problems are randomly from A Beautiful Journey through Olympiad Geometry.  Also perhaps I will post geo after March, because I am studying combi.  Problem:  Let $ABC$ be an acute triangle where $\angle BAC = 60^{\circ}$. Prove that if the Euler’s line of $\triangle ABC$ intersects $AB$ and $AC$ at $D$ and $E$, respectively, then $\triangle ADE$ is equilateral. Solution:  Since $\angle A=60^{\circ}$ , we get $AH=2R\cos A=R=AO$. So $\angle EHA=\angle DOA.$ Also it's well known that $H$ and $O $ isogonal conjugates.$\angle OAD =\angle EAH.$ By $ASA$ congruence, we get $AE=AD.$ Hence $\triangle ADE$ is equilateral....

Symmetric Polynomials #week 6

Well... I haven't seen much symmetric polynomials in Olympiads, but still I am learning, because I found them cute. And I am basically using this blog as my notes :P What are symmetric polynomials?  One can understand this with  examples. If we are considering over 3 variables, $x_1,x_2,x_3$ then  $$\sum_{sym}x_1^2\cdot x_2^3\cdot x_3=x_1^2\cdot x_2^3\cdot x_3+x_1^2\cdot x_3^3\cdot x_2+x_2^2\cdot x_1^3\cdot x_3+x_2^2\cdot x_3^3\cdot x_1+x_3^2\cdot x_1^3\cdot x_2.$$ See? $3!$ terms! Let's take one more example with again over 3 variables, $x_1,x_2,x_3$ then $$\sum_{sym}x_1^2\cdot x_2^2= x_1^2\cdot x_2^2+x_1^2\cdot x_3^2+x_2^2\cdot x_1^2+x_2^2\cdot x_3^2+x_3^2\cdot x_1^2+x_3^2\cdot x_2^2$$ Wait.. why 2 times ? So basically what happens in symmetrictric sums, is we go through all $n!$ possible permutations. So, here we have $a^2\cdot b^2\cdot c^0$ as like the "general" form type, right? Now, list down all the $3!=6$ permutations of $x_1,x_2,x_3$, and put them in the gene...

Number Theory Revise part 1

I thought to revise David Burton and try out some problems which I didn't do. It's been almost 2 years since I touched that book so let's see! Also, this set of problems/notes is quite weird since it's actually a memory lane. You will get to know on your own! I started with proving a problem, remembered another problem and then another and so on! It was quite fun cause all these questions were the ones I really wanted to solve! And this is part1 or else the post would be too long. Problem1: Prove that for $n\ge 1$  $$\binom{n}{r}<\binom{n}{r+1}$$ iff $0\le r\le \frac{n-1}{2}$ Proof: We show that $\binom{n}{r}<\binom{n}{r+1}$ for $0\le r\le \frac{n-1}{2}$ and use the fact that $$\binom{n}{n-r}=\binom{n}{r}$$ Note that $\binom{n}{r}= \frac{n!}{r!(n-r)!}, \binom{n}{r+1}=\frac{n!}{(r+1)!(n-r-1)!}$  Comparing, it's enough to show that $$\frac{1}{n-r}<\frac{1}{r+1}\text{ or show } n-r>r+1$$ which is true as $0\le r\le \frac{n-1}{2}$ Problem2: Show that the exp...

IMO 2023 P2

IMO 2023 P2 Well, IMO 2023 Day 1 problems are out and I thought of trying the geometry problem which was P2.  Problem: Let $ABC$ be an acute-angled triangle with $AB < AC$. Let $\Omega$ be the circumcircle of $ABC$. Let $S$ be the midpoint of the arc $CB$ of $\Omega$ containing $A$. The perpendicular from $A$ to $BC$ meets $BS$ at $D$ and meets $\Omega$ again at $E \neq A$. The line through $D$ parallel to $BC$ meets line $BE$ at $L$. Denote the circumcircle of triangle $BDL$ by $\omega$. Let $\omega$ meet $\Omega$ again at $P \neq B$. Prove that the line tangent to $\omega$ at $P$ meets line $BS$ on the internal angle bisector of $\angle BAC$. Well, here's my proof, but I would rather call this my rough work tbh. There are comments in the end! Proof Define $A'$ as the antipode of $A$. And redefine $P=A'D\cap (ABC)$. Define $L=SP\cap (PDB)$.  Claim1: $L-B-E$ collinear Proof: Note that $$\angle SCA=\angle SCB-\angle ACB=90-A/2-C.$$ So $$\angle SPA=90-A/2-C\implies \ang...

Reflecting on past

INMO Scores are out!! I am now a two times INMO awardee :) I got 16|0|1, so 17 in total! Yes, 16 in P1 T_T. I was thinking I would lose marks because of the way I wrote.  Lemme tell ya'll what happened that day but first I should share a few thoughts I had before the exam. My thoughts Honestly, my preparation for INMO was bad. In fact, I should say I didn't work hard at all. As I have said earlier, I had lost all my hopes for INMO and Olympiads as a whole after EGMO TSTs happened.  Art by Jelena Janic EGMO TSTs i.e European Girl's Mathematical Olympiad Team selection Tests 2022.  Literally my thoughts after EGMO TSTs I feel very ashamed to share but I got 1 mark in my EGMO TSTs. Tests in which I literally gave my whole life. I did so many ISLs ( like SO MANY), I mocked EGMO 2021 TST where my score was 28/42 and I perfected Day 2. 1 mark in the TST just showed my true potential. There are way better people than me in olys. A friend even said to me, "If I wouldn't...

INMO Scores and Results

Heya! INMO Results are out! Well, I am now a 3 times IMOTCer :D. Very excited to meet every one of you! My INMO score was exactly 26 with a distribution of 17|0|0|0|0|9, which was a fair grading cause after problem 1, I tried problem 6 next. I was hoping for some partials in problem 4 but didn't get any.  I am so so so excited to meet everyone! Can't believe my olympiad journey is going to end soon..  I thought to continue the improvement table I made last year! ( I would still have to add my EGMO performance and also IMO TST performance too) 2018-2019[ grade 8]:  Cleared PRMO, Cleared RMO[ State rank 4], Wrote INMO 2019-2020[ grade 9]:  Cleared PRMO, Cleared RMO[ State topper], Wrote INMO ( but flopped it) 2020-2021[grade 10]:  Cleared IOQM, Cleared INMO [ Through Girl's Quota] 2021-2022[grade 11]:  Wrote EGMO 2022 TST[ Rank 8], Qualified for IOQM part B directly, Cleared IOQM-B ( i.e INMO) [Through general quota],  2022-2023 [grade 12]:  Wrote E...