Skip to main content

Weird Theorems

Welcome back to this blog.

 Oki it's a new day and I decided to prove some weird theorems/lemmas with weird names. So, you can try proving it too! 

In my list we have, 

  • Sawayama theorem
  • Butterfly Theorem
  • Iran lemma
  • Simon's Trick
  • Chicken McNugget Theorem
  • Pick's theorem
  • Fermat's Christmas Theorem
Sawayama Thebault Theorem: Let $ABC$ be a triangle with circumcircle $\Gamma$ and incenter I. Let $D \in BC.$ Let $\Omega_1$ be the circle tangent to the line segments $DA$ and $DB$ and to the circle $\Gamma$, and let $\Omega_2$ be the circle tangent to the line segments $DA$ and $DC$ and to the circle $\Gamma$. If $O_1$ and $O_2$ are the centres of  $\Omega_1$ and $\Omega_2$, respectively, prove that $O_1 -I -O_2$ are collinear.

Walkthrough: 

  • Note $I\in EF,~~I\in GH$
  • Prove $O_1DO_2=90$
  • $DO_1|| GH$ and $DO_2 || EF.$
  • Since we want to prove that $I \in O_1 O_2 $, let $EF \cap O_1 O_2 = I '$ and let $GH \cap O_1 O_2 = I".$ 
  • $$\frac {O_1I'}{I'O_2}=\frac{O_1X}{DX}, \frac {O_1I''}{O_2I"}=\frac{DY}{O_2Y}$$
  • Note that $$\frac{O_1X}{DX}=\frac{DY}{O_2Y}$$

Butterfly's theorem: Let $M$ be the midpoint of a chord $PQ$ of a circle $\omega,$ through which two other chords $AB$ and $CD$ are drawn. Let $AD \cap PQ = X$ and $BC \cap PQ = Y.$ Prove that $M $ is also the midpoint of $XY.$

Walkthrough: Introduce the midpoint and then drop perps.
Introduce the midpoints of $AD$ and $CB.$
  • Note that $$\frac{AD}{AM}=\frac{CB}{CM}$$
  • So $$\frac{AR}{AM}=\frac{CS}{CM}$$
  • So we have $AMR$ similar to $CMS.$
  • So by cycilcity stuff $\angle MOX=\angle MOY.$
Incenter perpendicularity: The incircle of $\Delta ABC$ is tangent to $BC, CA, AB$ at $D, E, F$ respectively. Let $M_{BC}$ and $M_{AC}$ be the midpoints of $BC$ and $AC.$ If $K$ is the intersection of lines $BI$ and $EF, $ then $BK \perp KC.$ In addition, $K$ lies on line $MN.$




Walkthrough: 
  • Define $K$ as a point on $BI$ such that $BI\cap CK.$ So $I, D, E,K, C$ is cyclic. Now, note that $M_{BC}$ is the centre of the right angle triangle $BKC.$ So $$\angle KM_{BC}C=2\angle IBC=\angle B\implies M_{BC}-M_{AC}-K$$
  • Note that $$\angle EKI=\angle ECI=C/2=\angle (FE,BI)\implies F-E-K$$
Simon's trick: It's pretty famous and the origin of the name is discussed here. Also, Simon is Akshay Venkatesh's student :O

$$ mn+m+n+1= (m+1)(n+1)$$

Yeah, that's it.

The Chicken McNugget Theorem: For any two relatively prime positive integers $m,n$, the greatest integer that cannot be written in the form $am + bn$ for nonnegative integers $a, b$ is $mn-m-n$.

Moreover, exactly $\frac{(m - 1)(n - 1)}{2}$ positive integers which cannot be expressed in the form $am + bn$.

Walkthrough: 

I think the picture is enough :P




Pick's theorem: The area of a lattice  polygon is

$$A = I + \frac{1}{2}B - 1$$

where $I$ is the number of lattice points in the interior and $B$ is the number of lattice points on the boundary.

Proof: Define nice triangles as triangles with no interior points. Clearly nice triangles satisfy the theorem.


 Now, for any arbitrary triangle, we kinda use induction. And consider a point inside the arbitrary triangle ( there exist, else the triangle is a nice triangle). And then find the area of new triangles ( where we can again divide and so on, till we get nice triangles).



Now $$[ABC]=[AOC]+[BOC]+[AOB]$$ 
$$ [AOB]=I_1+\frac{B_1+B_2+B_4}{2}$$
$$ [AOC]=I_2+\frac{B_1+B_3+B_5}{2}$$
$$ [OBC]=I_3+\frac{B_3+B_2+B_6}{2}$$

Now, the boundary points $B_1,B_2,B_3$ are actually the interior point of $ABC.$
So $$[AOC]+[BOC]+[AOB]= I_1+\frac{B_1+B_2+B_4}{2}+I_2+\frac{B_1+B_3+B_5}{2} +I_3+\frac{B_3+B_2+B_6}{2}$$ 
$$= [I_1+I_2+I_3+ B_1+B_2+B_3]+\frac{B_4+B_5+B_6}{2}$$

And then we can divide the polygon into triangles and proceed the same.

Fermat's Christmas Theorem: An odd prime can be written as the sum of two squares iff the prime is $1 \pmod 4.$


Direction1: If the odd prime is $3\pmod 4$ then it can not be written as a sum of two squares.

Proof: Consider $\mod 4,$ an odd square is always $0,1,\mod 4.$

The other direction uses Gaussian integers and more fancy stuff..so I will probably dedicate a whole blogpost on it :P

Moreover, we also have, 

Corollary: If $p$ is an odd prime $p\equiv 3  $ mod $4$ and $p|(x^2+y^2)$ then prove that $p|x$ and $p|y$

Proof: Let $p=4k+3,$ and $p\not\mid x, p\not\mid y,$
$$x^2\equiv -y^2\mod p $$
$$(x^2)^{2k+1}\equiv (-y^2)^{2k+1}\mod p $$
$$(x^2)^{p-1}\equiv -(y^2)^{p-1}\mod p $$
By FLT, we get a contradiction. 


So yeee! That's it for today's blog post! I think the names are very funny :P and proving them was equally fun! Summary of 2021 blog post coming soon :P

See ya soon! ( thanks to Anand, now I too say "ya" instead of "you")
Sunaina💜

Comments

  1. Bandwala pagol chhagolJanuary 2, 2022 at 10:48 PM

    I am.the same commenter from the previous blog post!

    Also Fermats last theorem,Zsigmondy's theorem belong to this category.

    And the most weird one is pascal's theorem other than anything else 😡

    ReplyDelete
  2. IshanviJanuary 9, 2022 at 2:54 PM

    this blog is kinda cute

    ReplyDelete

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...
11 comments
Read more

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 ...
1 comment
Read more

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...
1 comment
Read more

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....
3 comments
Read more

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...
2 comments
Read more

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...
7 comments
Read more

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...
3 comments
Read more

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...
8 comments
Read more

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...
7 comments
Read more

Some Geometry Problems for everyone to try!

 These problems are INMO~ish level. So trying this would be a good practice for INMO!  Let $ABCD$ be a quadrilateral. Let $M,N,P,Q$ be the midpoints of sides $AB,BC,CD,DA$. Prove that $MNPQ$ is a parallelogram. Consider $\Delta ABD$ and $\Delta BDC$ .Note that $NP||BD||MQ$. Similarly, $NM||AC||PQ$. Hence the parallelogram. In $\Delta ABC$, $\angle A$ be right. Let $D$ be the foot of the altitude from $A$ onto $BC$. Prove that $AD^2=BD\cdot CD$. Note that $\Delta ADB\sim \Delta CDA$. So by similarity, we have $$\frac{AD}{BD}=\frac{CD}{AD}.$$ In $\Delta ABC$, $\angle A$ be right. Let $D$ be the foot of the altitude from $A$ onto $BC$. Prove that $AD^2=BD\cdot CD$. Let $D\in CA$, such that $AD = AB$.Note that $BD||AS$. So by the Thales’ Proportionality Theorem, we are done! Given $\Delta ABC$, construct equilateral triangles $\Delta BCD,\Delta CAE,\Delta ABF$ outside of $\Delta ABC$. Prove that $AD=BE=CF$. This is just congruence. N...
3 comments
Read more