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

How to prepare for RMO?

"Let's wait for this exam to get over".. *Proceeds to wait for 2 whole fricking years!  I always wanted to write a book recommendation list, because I have been asked so many times! But then I was always like "Let's wait for this exam to get over" and so on. Why? You see it's pretty embarrassing to write a "How to prepare for RMO/INMO" post and then proceed to "fail" i.e not qualifying.  Okay okay, you might be thinking, "Sunaina you qualified like in 10th grade itself, you will obviously qualify in 11th and 12th grade." No. It's not that easy. Plus you are talking to a very underconfident girl. I have always underestimated myself. And I think that's the worst thing one can do itself. Am I confident about myself now? Definitely not but I am learning not to self-depreciate myself little by little. Okay, I shall write more about it in the next post describing my experience in 3 different camps and 1 program.  So, I got...

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

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

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

TOP 10 problems of Week#3

 This week was full algebra biased!! 😄  This is my first time trying inequalities, so this pure beginners level.   Do try all the problems first!! And if you guys get any nice solutions , do post in the comments section!  These problem uses only  Power mean Inequality   and  Titu's lemma . The First few problems happen to be  not problems, but tricks(?) which are extensively used..  Here are the walkthroughs of this week's top 10 Inequality problems! 10th position:  Prove that for any real $a>0$ , $a+\frac{1}{a}\ge 2$ Walkthrough: a.  only AM-GM 9th position: Prove that for any real  $a>0$ , $\frac{a}{1+a^2}\le \frac {a}{2a}$. Walkthrough: a. Only AM-GM  b. Use AM-GM to show that   $1+a^2\ge 2a $  8th position:  Prove that for any real $x,y>0$ ,$\frac{1}{x+y}\le \frac{1}{4x}+\frac{1}{4y}$ Walkthrough: a. AM-HM inequality (cute 💖)  7th position :  Prove that for any real positiv...

TOP 10 problems of Week#1

This week was full Geo and NT 😊 . Do try all problems first!! And if you guys get any nice solutions , do post in the comments section! Here are the walkthroughs of this week's top 5 geo problems! 5th position (PUMac 2009 G8) : Consider $\Delta ABC$ and a point $M$ in its interior so that $\angle MAB = 10^{\circ}, \angle MBA = 20^{\circ}, \angle MCA =30^{\circ}$ and $\angle MAC = 40^{\circ}$. What is $\angle MBC$?  Walkthrough: a. Take $D$ as a point on $CM$ such that $\angle DAC=30^{\circ}$, and define $BD\cap AC=E$ . So $\Delta DAC$ is isosceles . b. Show M is the incentre of $\Delta ABD$ c. Show $\angle EDC=60^{\circ}$ d. Show $\Delta BAC$ is isosceles . e. So $\boxed{\angle MBC=60^{\circ}}$ 4th position (IMO SL 2000 G4):  Let $ A_1A_2 \ldots A_n$ be a convex polygon, $ n \geq 4.$ Prove that $ A_1A_2 \ldots A_n$ is cyclic if and only if to each vertex $ A_j$ one can assign a pair $ (b_j, c_j)$ of real numbers, $ j = 1, 2, \ldots, n,$ so that $ A_iA_j = b_jc_i - b_ic_j$ fo...

Some NMTC sub-junior level Problems

Well.. Many people don't know but I was a part of STEM's Horizon ( Now, I have left them due to boards etc.) BTW STEM's Horizons is really great! And anyone interested in Olympiad math should join it! More info about it in below (make sure to check it out!). So here are some problems I sent to them. They are fairly easy, and most of them are repetitive ideas. But they are my first sets of problems ( I know UMO was there but still..) The solutions will be posted in another blog posts. You guys can type out sols in the comments sections too :) Problems:- 1. What is maximum possible number dividing  $x^2+x+1$ and $x^5 +x^4 +x^3 + 3x^2 +2 x +4$ for all $x\in \Bbb{N}$ 2. Let $P$ be the sum of all $x$ and $y$ satisfying $45^x-2^x=2021^y.$ What is the last two digits of $p^2+p+1.$ 3. What is the greatest value of $r$ such that $3^r$ is factor of $10^{2022}-8^{674}$. 4. Find all possible tuples $ (x,y,l)$ such that $\frac{x}{100}=\frac{20}{y}=\frac{5}{l}.$ 5. Consider the following...

INMO problems + Summary of 2021

Welcome back! I tried the previous year INMO problems. And yes, I did a lot of them, here are a few! Here are the problems! ( they are kept in random order) [2008 P2]:  Find all triples $ \left(p,x,y\right)$ such that $ p^x=y^4+4$, where $ p$ is a prime and $ x$ and $ y$ are natural numbers. [some INMO]: Find all $m,n\in\mathbb N$ and primes $p\geq 5$ satisfying $$m(4m^2+m+12)=3(p^n-1).$$ [2015 P3]  Find all real functions $f: \mathbb{R} \to \mathbb{R}$ such that $f(x^2+yf(x))=xf(x+y)$. [2005 P6]:  Find all functions $f : \mathbb{R} \longrightarrow \mathbb{R}$ such that\[ f(x^2 + yf(z)) = xf(x) + zf(y) , \]for all $x, y, z \in \mathbb{R}$. [2012 P6] Let $f : \mathbb{Z} \to \mathbb{Z}$ be a function satisfying $f(0) \ne 0$, $f(1) = 0$ and $(i) f(xy) + f(x)f(y) = f(x) + f(y)$ $(ii)\left(f(x-y) - f(0)\right ) f(x)f(y) = 0 $ for all $x,y \in \mathbb{Z}$, simultaneously. $(a)$ Find the set of all possible values of the function $f$. $(b)$ If $f(10) \ne 0$ and $f(2) = 0$, find ...