Skip to main content

Let's complex bash Part 2:P

 Okie so continuing from the previous post ( sorry for huge time gap, got stuck in Allen stuff)

A warning though if anyone from the "anti-bash" community is reading, sorry in advance and R.I.P. 


Notes:-

1. We have $z_1=r_1e^{i\theta_1}$ and $z_2=r_2e^{i\theta_2}$ then we have $z_1z_2=r_1r_2e^{i(\theta_1+\theta_2)}$ and we get $|z_1z_2|=|z_1||z_2|$ and $\arg z_1z_2=\arg z_1+\arg z_2 .$

SPIRAL SIMILARITIES and TRANSFORMATIONS:-

2. How to rotate a point about origin by 90.

  • If $90^{\circ}$ anti-clockwise then multiply the number by $i$ 
  • If $90^{\circ}$ clockwise then multiply by $-i.$
Proof:- Note that $i= 0+1\cdot i.$ So $|i|= \sqrt{0^2+1^2}=1.$ And when we locate $i$ in complex plane, clearly $\arg i=\pi/2.$

Similarly for the second, but note that $\arg -i=-\pi /2.$ (Since angles are measured anti-clockwise)

Example:- Here we have $z=1+2i$ then when we multiply $i$ we get $zi=i-2.$

Now, what about we want to dialate a point from one to another and scale it? (Note that that is spiral similarity only :P)



Like say we want to rotate point $z=4+5i$ about point $x=2+2i$ with dilation of $\pi/2.$

In this case what we do is we shift the whole diagram such that $x$ to $(0,0).$ Here we have $(2,2)\rightarrow (0,0),$ so $z$ goes to $z=(4,5)\rightarrow z'=(4-2,5-2)=(2,3)= 2+3i.$

Now we perform the same thing, so we will multiply $i$ and we get $z''=i-3=(-3,2).$
Then we transform it back, so we get $z''=(-3,2)\rightarrow z'''=(-3+2,2+2)=(-1,4).$



So in summary, what we are doing is shifting the $x$ to $O$ i.e in all the coordinates we subtracting $x$'s coordinates.. and then we get the new image of $z,$ we multiply $i,$ get new image, of $(z-x)$ then add the coordinates back .

So we get $\boxed{z\rightarrow i(z-x)+x.}$

Here $i$'s modulus is one, so there hasn't been a scaling thingy but we can do that too. 

$$z\rightarrow \alpha(z-w)+w$$ 

This is a spiral similarity centrerd at $w$ dilating $z$ which rotates by $\alpha $ and dilates by $|\alpha |.$

COMPLEX REFLECTION:- 

Let $W$ be the reflection of $Z$ over a given $AB.$ Then

$$w=\frac{  (a-b)\overline{z} + \overline{a}b - a\overline{b}}{(\overline{a} - \overline{b})}$$

Proof:- It's in egmo:P.

We first transform $z$ to $z-a$ ( We have the motive to turn $\overline{AB}$ in to the segment between $0$ and $1$ on the real axis, so that we can then apply complex conjugate thing that we have on reflection about real axis)

Then we down everything by $b-a.$

So we get $$\left(\frac{w-a}{b-a}\right) = \overline{\left(\frac{z-a}{b-a}\right)}$$

Using the basic conjugate properties, we get,

$$ \overline{\left(\frac{z-a}{b-a}\right)}=\left(\frac{\bar{z}-\bar {a}}{\bar{b}-\bar{a}}\right)$$

Then calcs done, we get $$w=\frac{  (a-b)\overline{z} + \overline{a}b - a\overline{b}}{(\overline{a} - \overline{b})}$$

Then we get this problem from egmo :P

Problem:- Show that the foot of the altitude from $Z$ to $\overline{AB}$ is given by

$$ \frac{(\overline{a} - \overline{b})z + (a-b)\overline{z} + \overline{a}b - a\overline{b}}{2(\overline{a} - \overline{b})} $$

Proof:-Consider the reflection of $z$ say $w.$ Then we know that the foot ( say $x$) will be the midpoint of $z$ and $w$ i.e $x=\frac{z+w}{2}.$

Now, using the reflection lemma, we get $$w+z=\frac{ (a-b)\overline{z} + \overline{a}b - a\overline{b}}{(\overline{a} - \overline{b})}+ z=\frac{(\overline{a} - \overline{b})z + (a-b)\overline{z} + \overline{a}b - a\overline{b}}{(\overline{a} - \overline{b})} $$

So $$\frac{w+z}{2}=  \frac{(\overline{a} - \overline{b})z + (a-b)\overline{z} + \overline{a}b - a\overline{b}}{2(\overline{a} - \overline{b})}$$

Properties:-
  • $z=\bar{z}$ iff $z$ is real
  • $z+\bar{z}=0 $ iff $z$ is pure imaginary  
perpendicular criterion:- The compleplex numbers $a,b,c,d$ have the property $AB\perp CD$ if and only if
$$\frac{d-c}{b-a} + \overline{\left(\frac{d-c}{b-a}\right)}=0$$

Proof:- We transform $d\rightarrow d-c, c \rightarrow 0.$ Now, this transformation takes line $CD$ to a line parallel to it, passing through origin.

Similarly, we transform $d\rightarrow d-c, c \rightarrow 0.$ Now, this transformation takes line $CD$ to a line parallel to it, passing through origin.

Now, remember in the previous spiral similarity transformation, we noticed that multiplying the complex number with $xi$ transforms line to a perpendicular line. So if $d-c$ and $b-a$ are perpendicular then  $\frac{d-c}{b-a}$ must be pure imaginary.

Using the properties, we get that  $$\frac{d-c}{b-a} + \overline{\left(\frac{d-c}{b-a}\right)}=0.$$

Collinearity Lemma:- Prove that complex numbers $z$, $a$ and $b$ are collinear iff

$$ \frac{z-a}{z-b} = \overline{\left(\frac{z-a}{z-b}\right)} $$

Proof:- We consider the transformation $z-a$ and $z-b.$ These vectors have tails in $O$ and heads as $z-a, z-b$ respectively. Now note that if $z,a,b$ are collinear then these two vectors ( because the transformation is mapping into parallel line through $O$) 
So we have the angles between these two vectors as $0, \pi.$

Hence the two vectors' quotient must be a real number. Using Proposition 6.4, we get that 

$$\frac{z-a}{z-b} + \overline{\left(\frac{z-a}{z-b}\right)}=0.$$

Complex shoelace Formula:- If $a,b,c$ are complex numbers, then the signed area of triangle $ABC$ is given by 





THE UNIT CIRCLE:-

The unit circle is the set of complex numbers $z$ with $|z|=1,$ which is centred at $0$ with radius $1.$

We have for any $z$ on the unit circle, $\boxed{\bar {z}=\frac{1}{z}}.$
This is because $z\cdot \bar{z}=|z|^2.$

----

Yeah now lemme do polynomials :P  

See ya next time! Also do check my other blog (if you get free time tmrw, new post coming there )

Sunaina 💜

Comments

  1. Where actually is the bash you just posted the thm's right?

    ReplyDelete
    Replies
    1. No bashing is the best,also even bashes are beautiful sometimes for eg check Mr Oreo Juice/nathantareep's (shameless advertising)/jj_ca888 solution to Romania TST 2007 Day 6 P2(by Cosmin Pohoata)

      Delete
    2. lol!! Now I know who you are :sunglasses:.. I tbh cant bash in an exam condition, so i felt it's not that useful to learn plus I dont even have specific interest! Also Oreo doing bash :O dang he must be high!

      Delete
    3. @bove lol tru :rotfl:!I ve never literally talked to him(maybe bcoz I don't use discord) but I have seen him write that in his posts :P.Yah I am not that good too in bashes.Just learning.

      Also complex bash is tough :(

      Delete

Post a Comment

Popular posts from this blog

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

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

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

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

Just spam combo problems cause why not

This post is mainly for Rohan Bhaiya. He gave me/EGMO contestants a lot and lots of problems. Here are solutions to a very few of them.  To Rohan Bhaiya: I just wrote the sketch/proofs here cause why not :P. I did a few more extra problems so yeah.  I sort of sorted the problems into different sub-areas, but it's just better to try all of them! I did try some more combo problems outside this but I tried them in my tablet and worked there itself. So latexing was tough. Algorithms  "Just find the algorithm" they said and they died.  References:  Algorithms Pset by Abhay Bestrapalli Algorithms by Cody Johnson Problem1: Suppose the positive integer $n$ is odd. First Al writes the numbers $1, 2,\dots, 2n$ on the blackboard. Then he picks any two numbers $a, b$ erases them, and writes, instead, $|a - b|$. Prove that an odd number will remain at the end.  Proof: Well, we go $\mod 2$. Note that $$|a-b|\equiv a+b\mod 2\implies \text{ the final number is }1+2+\dots ...

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

Problems with meeting people!

Yeah, I did some problems and here are a few of them! I hope you guys try them! Putnam, 2018 B3 Find all positive integers $n < 10^{100}$ for which simultaneously $n$ divides $2^n$, $n-1$ divides $2^n - 1$, and $n-2$ divides $2^n - 2$. Proof We have $$n|2^n\implies n=2^a\implies 2^a-1|2^n-1\implies a|n\implies a=2^b$$ $$\implies 2^{2^b}-2|2^{2^a}-2\implies 2^b-1|2^a-1\implies b|a\implies b=2^c.$$ Then simply bounding. USAMO 1987 Determine all solutions in non-zero integers $a$ and $b$ of the equation $$(a^2+b)(a+b^2) = (a-b)^3.$$ Proof We get $$ 2b^2+(a^2-3a)b+(a+3a^2)=0\implies b = \frac{3a-a^2\pm\sqrt{a^4-6a^3-15a^2-8a}}{4}$$ $$\implies a^4-6a^3-15a^2-8a=a(a-8)(a+1)^2\text{ a perfect square}$$ $$\implies a(a-8)=k^2\implies a^2-8a-k^2=0\implies \implies a=\frac{8\pm\sqrt{64+4k^2}}{2}=4\pm\sqrt{16+k^2}. $$ $$ 16+k^2=m^2\implies (m-k)(m+k)=16.$$ Now just bash. USAMO 1988 Suppose that the set $\{1,2,\cdots, 1998\}$ has been partitioned into disjoint pairs $\{a_i,b_i\}$ ($1...

Birthday Functional Equations problems

Heyoo!!! Birthday FEs!!!!!! $11$ FEs!! Also I would be posting solutions to RG's FE handout, I am done with 10 prs :P!! Problem: Find all functions $f :\Bbb R \rightarrow \Bbb R$ such that $$2f (x) - 5f (y) = 8, \forall x, y \in \Bbb R$$ Solution: $$2f(x)-5f(y)=8$$ $$\implies 2f(x)-5f(x)=8$$ $$\implies f(x)=\frac{-8}{3}, \text{ a constant function }$$ We did this in Rohan Bhaiya's FE class..Oh btw the EGMO camp is sooo niceee! I am loving it!! It's such a big deal to be able to train and attend the camp with EGMO team members! Problem: Find all functions $f :\Bbb R \rightarrow \Bbb R$ such that $$f (x) + xf (1 -x) = x, \forall x\in \Bbb R.$$ Solution: $$f(x)+xf(1-x)=x$$ $$f(1-x)+(1-x)f(x)=1-x$$ This is actually in the linear equations in two variable form! $$x+ay=a$$ $$y+bx=b$$ Anyways,  $$f(x)+xf(1-x)=x$$ $$xf(1-x)+f(x)(1-x)x=(1-x)x$$ $$ \implies f(x)(x-x^2)-f(x)=-x^2\implies f(x)=\frac{-x^2}{x-x^2-1}=\frac{x^2}{x^2-x+1}$$ But verifying, this doesn't work. Problem: ...