Skip to main content

Problems done in August

 Welcome back! So today I will be sharing a few problems which I did last week and some ISLs. Easy ones I guess.

Happy September 2021! 



Problem[APMO 2018 P1]: Let $ABC$ be a triangle with orthocenter $H$ and let $M$ and $N$ denote the midpoints of ${AB}$ and ${AC}$. Assume $H$ lies inside quadrilateral $BMNC$, and the

circumcircles of $\triangle BMH$ and $\triangle CNH$ are tangent. The line through $H$ parallel to ${BC}$ intersects $(BMH)$ and $(CNH)$ again at $K$, $L$ respectively.

Let $F = {MK} \cap {NL}$, and let $J$ denote the incenter of $\triangle MHN$.

Prove that $FJ = FA$.

Proof: 

  • By angle chase, we get $\angle FKL=\angle FLK.$
  •    Hence $KL||MN\implies FM=FN.$
  •   And we get $\angle MFN=2A\implies F$ is circumcentre if $(AMN)\implies FA=FM=FN.$
  •   And we get $\angle MHN=180-2A$
  •    Hence $MFHN$ is cyclic.
  •    By fact 5, $ME=FJ=FN\implies FJ=FA.$

Problem[Shortlist 2007 G3]:

Let $ABCD$ be a trapezoid whose diagonals meet at $P$. Point $Q$ lies between parallel lines $BC$ and $AD$, and line $CD$ separates points $P$ and $Q$.

Given that $\angle AQD = \angle CQB$, prove that $\angle BQP = \angle DAQ$.

Proof:    (With Erijon)

  •  consider the homothety centered at $P$ which  takes $B$ to $D$ and $C$ to $A$

  •     Note that $BL||QD,$ $L$  is the image of $Q$ We also have $AL||CQ$
  •    And we get $$\angle DLA=\angle CLB=\angle CDB=\angle AQB$$
  •   Hence we get $QCBL,QADL$ cyclic.
  •   So we have $BQ||DL$ then we get

$$\angle BQL=\angle QLD =\angle QAD$$

and we are done.

Problem[EGMO 2013/1]:

The side $BC$ of the triangle $ABC$ is extended beyond $C$ to $D$ so that $CD = BC$. The side $CA$ is extended beyond $A$ to $E$ so that $AE = 2CA$. Prove that if $AD=BE$ then the triangle $ABC$ is right-angled.

Proof:

  •      So introduce the midpoint of $AE,AB$ as $M,J.$
  •      Note that $JC=\frac{1}{2}AD$
  •     And we have $JM=\frac{1}{2}AB$
  •     $AM=AC\implies JA\perp MC\implies BAC=90.$

Problem[APMO 2013 P5 ]:
 Let $ABCD$ be a quadrilateral inscribed in a circle $\omega$, and let $P$ be a point on the extension of $AC$ such that $PB$ and $PD$ are tangent to $\omega$. The tangent at $C$ intersects $PD$ at $Q$ and the line $AD$ at $R$. Let $E$ be the second point of intersection between $AQ$ and $\omega$. Prove that $B$, $E$, $R$ are collinear.

Proof: Note that $$-1=(A,E;C,D)=(A,RE\cap \omega; C,D)$$ But we know $$(A,C;B,D)=-1\implies RE\cap \omega=B$$

Problem[2008 G1]:
Let $ H$ be the orthocenter of an acute-angled triangle $ ABC$. The circle $ \Gamma_{A}$ centered at the midpoint of $ BC$ and passing through $ H$ intersects the sideline $ BC$ at points $ A_{1}$ and $ A_{2}$. Similarly, define the points $ B_{1}$, $ B_{2}$, $ C_{1}$ and $ C_{2}$.

Prove that the six points $ A_{1}$, $ A_{2}$, $ B_{1}$, $ B_{2}$, $ C_{1}$ and $ C_{2}$ are concyclic.

Proof: 
  •  Let $(M_c)\cap (M_B)=X,H.$
  •      Note that $XH$ is the radical axis, so we have $XH\perp M_CM_B.$ But we have $AH\perp BC||M_CM_B\implies A-X-H$
  •      So $A$ lies on the radical axis $\implies Ac_1\cdot AC_2=AB_2\cdot AB_1\implies (C_1B_2B_1C_2)$ is cyclic, similarly we get $C_1C_2B_1B_2$ cyclic, $B_1A_2A_1B_2$ is cyclic.
  •    Now note that the pairwise radical axis doesn't concur.

Problem 6: Find all integers $n$ for which both $4n + 1$ and $9n + 1$ are perfect squares

Solution: I am not gonna lie this question felt really hard to me :( 
The idea took time, but it's simple.

So let $4n+1=a^2$ then note $b^2=9n+1= 2\cdot (4n+1)+n-1= 2\cdot a^2+ \frac{a^2-1}{4} -1= \frac{9a^2-5}{4}\implies 9a^2-5\text{~~is a square}$

So both $a^2,9a^2-5$ is a square. Let $9a^2-5=k^2, 9a^2=l^2\implies l^2-k^2= (l+k)(l-k)=5\implies l=2,k=\implies a^2=1=4n+1\implies n=0. $

Problem 7: Find all $ n \in \mathbb{N} $ for which $ \exists $ $ x,y,k \in \mathbb{N}$ such that $ (x,y)=1 $ , $ k>1 $ and $ 3^{n}=x^k+y^k $

Solution: The second form of Zigmondy Theorem states that : there’s a prime dividing $a^k + b^k$ and not $a^l + b^l$ for $l < k$ ( The exception is $(a,b,k)=(2,1,3)$).

So now if $(a,b,k)\ne(2,1,3)$ then it is not possible since we will have two distinct primes dividing $x^k+y^k=3^n.$ Not possible.

If we have $(a,b,k)=(2,1,3)$ we get $3^n=2^k+1.$ Using Mihăilescu theorem ( which states that the only consecutive perfect powers are
$8$ and $9$) 

Hence $\boxed{n=2, k=3, x=2, y=1}$ is the only solution.

Problem 8: Let $P (x)$ be a polynomial with integer coefficients and $P (n) =m$ for some integers $n, m$ ($m \ne 10$). Prove that $P (n + km)$ is divisible by $m$ for any integer $k$.

Proof:
 We know that $$a-b|P(a)-P(b)\implies km|P(n+km)-P(n)\implies m|P(n+km)-P(n)\implies m|P(n+km).$$

Problem 9: The sequence of integers $ a_n$ is given by $ a_0 = 0, a_n= p(a_{n-1})$, where $ p(x)$ is a polynomial whose coefficients are all positive integers. Show that for any two positive integers $ m, k$ with greatest common divisor $ d$, the greatest common divisor of $ a_m$ and $ a_k$ is $ a_d$.

Proof : We assume $m\le k.$
Note that $a_{m-1}-a_{k-1}|P(a_{m-1})-P(a_{k-1})$
Similarly we get $a_{m-2}-a_{k-2}|P(a_{m-2})-P(a_{k-2})$
And we continue we get $ a_0-a_{k-m}| P(a_{m-1})-P(a_{k-1}).$
So we get $gcd(a_m,a_k)=gcd(a_{k-m},a_k).$ And this continues.
By the euclidean algorithm, we are done.


Problem 10:Given a polynomial $P(x)$ with  natural coefficients;
Let us denote with $a_n$ the sum of the digits of $P(n)$ value.
Prove that there is a number encountered in the sequence $a_1, a_2, ... , a_n, ...$ infinite times.

Proof : Let $(b_n,b_{n-1},\dots, b_0) $ be the coefficients of the polynomial $P(x)=b_n\cdot x^n+\dots+x_0.$
Then surely there exist a natural number $k$ such that $P(10^k)$ is of the form $\overline{b_n0\dots 0b_{n-1}0\dots 0 b_0}.$
Then consider $10^k,10^{k+1},\dots .$

Yep, this is it for this week's blog! Autumn is about to come! I didn't even realise it but 2021 is about to end in 4 months!



Also, I have exported a few contacts from Feedburner to Mailchimp and I am in the process of removing FeedBurner completely from this blog. And people will be getting mails once a week only!

P.S. Do comment on how you liked the problems, which one was easy and what was your favourite!

P.P.S. Since IOQM is close, would you all like it if I post 10 IOQM problems each week? That would be great I think? It would probably be a series of collaborative posts.

See you soon 
Sunaina 💜

Comments

  1. Love this blog a lot. Hopefully it never dies :D

    ReplyDelete
  2. Beautiful problems! 2008 G1 was very nice. Yeah, IOQM is close. So posting IOQM problems would be great.

    ReplyDelete
    Replies
    1. Glad you liked it :). And yeah, would be sending those problems in every wed/thursday.

      Delete
  3. Woahh nice type ups, I like when u give concise and nice solutions to past international contest problems :p.
    Looking forward to future posts 😁😁😁

    ReplyDelete
  4. Also, 7000 views coming soon 🤩

    ReplyDelete
    Replies
    1. Oh no, nothing special for this :P ( maybe Isl n1s? IDK :P)

      Delete
    2. Pranav pro gawd solves N5s now :orz: big phan pranav sar

      Delete
    3. Bro what ? I solved only 1 N5, that too not completely on my own, I needed a hint, so I in some sense can't classify as a solve completely, but yeah I did learn but didn't solve myself -__-

      Delete
    4. lol pranav. How many people did you tell that u solved N5 :joy:?

      Delete
    5. I didn't tell anyone else except you and anand ;-;.
      I was actually solving the problem in LT, like writing my progress there in a thread and asked bora for hint meanwhile. And when I was done I wrote "yay! Finally I am done."

      And then prabh -_____-

      Delete
    6. As his Pf name states, a problem :rotfl:

      Delete
  5. Noice. Do try USA TSTST 2012 P7. My proudest solve ever (coz most solutions use something except basic angle chase (like projective inversion miquel points et al) which idk)

    ReplyDelete
  6. For your problem on 3^n=x^k+y^k, Zsigmondy is overkill. We can see that if k is not a power of 2, using the lifting the exponent lemma + size is an easier finish. If k is a power of 2, we win by taking mod 3 to find 3|x, 3|y and then we can consider a solution (x/3,y/3) and win with infinite descent.

    I recommend using basic tools to solve easy problems because it allows you to be able to recognize patterns and is generally more flexible.

    ReplyDelete
    Replies
    1. HOLYY.. Hiii. I am happyy that you commented! Also yep, LTE and Infinite descent would be better! Although Zsig is really nice. I was like
      " Oh it's doable by zsig" and once I think a problem is solved.. why find the long route :P JK. But yes, nice solution. Will try to cut down the use!

      Delete

Post a Comment

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...

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 ...

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 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...