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

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

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

Introduction

  Hey Everyone!! This is my first Blog post. So let me give a brief introduction about myself. I am Sunaina Pati. I love solving Olympiad math problems,  learning crazy astronomical facts , playing hanabi and anti-chess, listening to Kpop , love making diagrams in Geogebra and  teaching other people maths 😊 . I love geometry , number theory and Combinatorics . I am starting this blog to keep myself a bit motivated in doing studies 😎 . Right now, I am planning to write walkthroughs on some of the best problems I tried over the week which can refer for hints 'cause solutions contain some major spoilers and one learns a lot while solving the problem on his own rather than seeing solutions . Also, there will be some reviews about Kpop songs, study techniques, my day to day lifestyles,exam reviews and ofc some non-sense surprises 😂.  I am planning to  try  posting every week on Sundays or Saturdays ( most probably) ! Though there is no guarantee about when I ...

Problems I did this week [Jan8-Jan14]

Yeyy!! I am being so consistent with my posts~~ Here are a few problems I did the past week and yeah INMO going to happen soon :) All the best to everyone who is writing!  I wont be trying any new problems and will simply revise stuffs :) Some problems here are hard. Try them yourself and yeah~~Solutions (with sources) are given at the end! Problems discussed in the blog post Problem1: Let $ABC$ be a triangle whose incircle $\omega$ touches sides $BC, CA, AB$ at $D,E,F$ respectively. Let $H$ be the orthocenter of $DEF$ and let altitude $DH$ intersect $\omega$ again at $P$ and $EF$ intersect $BC$ at $L$. Let the circumcircle of $BPC$ intersect $\omega$ again at $X$. Prove that points $L,D,H,X$ are concyclic. Problem 2: Let $ ABCD$ be a convex quadrangle, $ P$ the intersection of lines $ AB$ and $ CD$, $ Q$ the intersection of lines $ AD$ and $ BC$ and $ O$ the intersection of diagonals $ AC$ and $ BD$. Show that if $ \angle POQ= 90^\circ$ then $ PO$ is the bisector of $ \angle AOD$ ...

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

Some problems in Olympiad Graph theory!

Hello there! It has been a long time since I uploaded a post here. I recently took a class at the European Girls' Mathematical Olympiad Training Camp 2024, held at CMI. Here are a few problems that I discussed! My main references were Po-Shen Loh's Graph theory Problem set (2008), Adrian tang's Graph theory problem set (2012) and Warut Suksompong's Graph Cycles and Olympiad Problems Handout and AoPS. I also referred to Evan Chen's Graph theory Otis Problem set for nice problems! Text Book Problems which are decent A connected graph $G$ is said to be $k$-vertex-connected (or $k$-connected) if it has more than $k$ vertices and remains connected whenever fewer than $k$ vertices are removed. Show that every $k$-connected graph of order atleast $2k$ contains a cycle of length at least $2k$. We begin with a lemma. Prove that a graph $G$ of order $n \geq 2k$ is $k$ connected then every 2 disjoint set $V_1$ and $V_2$ of $k$ distinct vertices each, there exist $k$...

Solving Random ISLs And Sharygin Solutions! And INMO happened!!

Some of the ISLs I did before INMO :P  [2005 G3]:  Let $ABCD$ be a parallelogram. A variable line $g$ through the vertex $A$ intersects the rays $BC$ and $DC$ at the points $X$ and $Y$, respectively. Let $K$ and $L$ be the $A$-excenters of the triangles $ABX$ and $ADY$. Show that the angle $\measuredangle KCL$ is independent of the line $g$ Solution: Note that $$\Delta LDK \sim \Delta XBK$$ and $$\Delta ADY\sim \Delta XCY.$$ So we have $$\frac{BK}{DY}=\frac{XK}{LY}$$ and $$\frac{DY}{CY}=\frac{AD}{XC}=\frac{AY}{XY}.$$ Hence $$\frac{BK}{CY}=\frac{AD}{XC}\times \frac{XK}{LY}\implies \frac{BK}{BC}=\frac{CY}{XC}\times \frac{XK}{LY}=\frac{AB}{BC}\times \frac{XK}{LY} $$ $$\frac{AB}{LY}\times \frac{XK}{BK}=\frac{AB}{LY}\times \frac{LY}{DY}=\frac{AB}{DL}$$ $$\implies \Delta CBK\sim \Delta LDK$$ And we are done. We get that $$\angle KCL=360-(\angle ACB+\angle DKC+\angle BCK)=\angle DAB/2 +180-\angle DAB=180-\angle DAB/2$$ Motivation: I took a hint on this. I had other angles but I did...

Let's complex bash Part 1

I have to learn complex bash. And almost everyone knows that I am notes taking girl so thought why not make a post on complex bash ( so that I don't get emotionally demotivated lol).😇 There wasn't any need for learning complex bash, but it was in my dream checklist i.e " To learn a bash." And since I am not loaded with exams, I think it's high time to learn Bash and new topics.  Also if anyone from the "anti-bash" community is reading, sorry in advance and R.I.P.  Notes:- 1. Complex numbers are of the form $z=a+ib,$ where $a$ and $b$ are real numbers and $i^2=-1.$ 2. In polar form, $z=r(\cos \theta+~~i\sin\theta)=~~re^{i\theta},$ where $r=~~|z|=~~\sqrt{a^2+b^2},$ which is called the magnitude. 3. Here we used euler's formula i.e $\cos \theta+~~i\sin\theta=~~e^{i\theta}.$ 4. The $\theta $ is called the argument of $z,$ denored $\arg z.$ ( $\theta$ can be considered in $\mod 360$ and it is  measured anti-clockwise). 5. The complex conjugate of $z$ is ...

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

How to prepare for INMO

Since INMO is coming up, it would be nice to write a post about it! A lot of people have been asking me for tips. To people who are visiting this site for the first time, hi! I am Sunaina Pati, an undergrad student at Chennai Mathematical Institute. I was an INMO awardee in 2021,2022,2023. I am also very grateful to be part of the India EGMO 2023 delegation. Thanks to them I got a silver medal!  I think the title of the post might be clickbait for some. What I want to convey is how I would have prepared for INMO if I were to give it again. Anyway, so here are a few tips for people! Practice, practice, practice!! I can not emphasize how important this is. This is the only way you can realise which areas ( that is combinatorics, geometry, number theory, algebra) are your strength and where you need to work on. Try the problems as much as you want, and make sure you use all the ideas you can possibly think of before looking at a hint. So rather than fixing time as a measure to dec...