Skip to main content

Non geos are cool part 2 and Mailchimp!

Welcome back! I have now a Mailchimp email subscriber widget! That is, people can now subscribe to this blog again and get email updates when I post a blog post! 

To subscribe, just go to the right side of the blog (it should be visible, if not click those three bars thing)



A few things to note is that

  • If you have already subscribed to this blog through Feedburner, then there is no need to subscribe again, until you want two email notifs about my blog.
  • Also, the "following" option doesn't give you updates, it's more like supporting the blogger and inform the reader about how many people love the blog!
  • One can always unsubscribe to this blog. So do subscribe, it's free. 
  • Well, I practically don't get anything from this blog :P. But it's fun sharing about your day to day life and seeing a lot of people coming to this blog!
And I am back with 5 more cute Non-geos!  So here are some 5 Non-geos that were cool! 😎 I think I should say them as NTs.

Problem: Determine all integers solutions of the equation $x + x^3 = 5y^2$.

Proof: Answer: $(x,y)=(0,0)$


We use infinite descent.

 

Let $(a,b)$ be the least solution, hence $\gcd (a,b)=1.$

So $a+a^3=a(a^2+1)=5b^2\implies a\equiv 0,2,3\mod 5.$


Taking $\mod 4$ gives us $$a(a^2+1)\equiv b^2\mod 4\implies a(a^2+1)\equiv 0,1\mod 4.$$

Clearly $$2|a(a^2+1)\implies a(a^2+1)\equiv 0\mod 4\implies 2|a.$$

So we get $$2|a+a^3=b\implies 2|\gcd(a,b)\implies \gcd(a,b)\ne 1.$$ 

Contradiction. And we are done by infinite descent.


So the only sol is $(0,0).$

Problem: Let $p> 3$ be a prime number and let $q = \frac{4^p-1}{3}$. Show that $q$ is a composite integer as well is a divisor of $2^{q-1}- 1$.

Proof: The first part was easy. We know that $4^p-1=(2^p-1)(2^p+1).$ We know that $3|2^p+1$ and $\frac{2^p+1}{3}>1.$ Hence $$q = \frac{4^p-1}{3}=(2^p-1)\cdot \frac{2^p+1}{3}.$$ So $q$ is composite.

Now for the second part. Well, we have $q-1=\frac{4^p-4}{3}=4\cdot \frac{4^{p-1}-1}{3}.$ By Fermat's little theorem, we have $p|4^{p-1}-1\implies p|q-1.$ So let $q-1=p\cdot l.$ Clearly $q-1>p\implies l>1.$

So, we have $$2^{q-1}-1=2^{p\cdot l}-1=(2^p)^l-1^l\implies \boxed{2^p-1|2^{q-1}-1}.$$

Now clearly since $q-1$ is even, $p$ is odd, hence $l$ is even $l=2m.$

Now, we want $$ \frac{2^p+1}{3}|2^{q-1}-1=4^{pm}-1=(2^{pm}-1)\cdot (2^{pm}+1).$$

Clearly $$\boxed{2^p+1|2^{q-1}-1}. $$

Since $\gcd(2^p-1,2^p+1)=1.$

We get that $$ q|2^p-1\cdot 2^p+1| 2^{q-1}-1.$$ We are done.



Problem: Show that there are infinitely many pairs $(m, n)$ of natural numbers $m, n \ge 2$, for $m^m- 1$  is divisible by $n$ and $n^n- 1$ is divisible by $m$.[

Proof: Aa easy and cute! I hope the construction is correct.

Let $n=m+1, m$ is even. So $$n \equiv 1 \mod m \implies n^n\equiv 1\mod m \implies n^n-1\equiv 0\mod m.$$

Since $m$ is even, $$n|m^2-1|m^m-1$$

For example, take any even $m,$ say $6,$ so $n=7.$

We have $$ 7|6^2-1|6^6-1,~~6|7^7-1=24|5.$$


Problem: Solve the equation $5^x7^y+4=3^z$ in nonnegative integers.

Proof:  No solution 

We have $$5^x7^y+4=3^z.$$

By $\mod 3,$ we get that $x$ is odd. 

By $\mod 4,$ we get that $y,z$ are of the same parity.

By $\mod 7,$ we get that $z$ is even and so is $y.$ Let $z=2k.$

Hence, $$5^x\cdot 7^y= (3^k-2)(3^k+2).$$

Since $$\gcd(3^k-2),(3^k+2)=1\implies 3^k-2=5^x \text{or} 3^k+2=5^x$$


Case 1:  $$ 3^k-2=5^x$$

Clearly $k>1,$ taking $\mod 9$ and using the fact that $x$ is odd, so $5^x\equiv 5,8,2 \mod 9.$

Not possible ( except $k=1,x=0$ which eventually doesn't work when we try it in $3^k+2=7^y.$ )

(another way is just $\mod 3$)


Case 2: $$3^k+2=5^x, 3^k-2=7^y$$

Clearly in $3^k+2=5^x,$ we get by $\mod 8 \implies k$ is odd.

But $\mod 7$ in $3^k-2=7^y$ gives $k$ is even.

Not possible.



Problem: Let $n$ be an integer. Show that a natural number $k$ can be found for which, the following applies with a suitable choice  of signs: $$n = \pm 1^2 \pm 2^2  \pm 3^2  \pm  ... \pm k^2$$

Proof: Pretty nice!

Note that if we represent $0$ and positive integer $n,$ then we are done as we can just change the signs.

$$ 0=1-4-(9-16)-(25-36)+(49-25)$$

$$ 1= 1$$

$$ 2= -1-4-9+16$$

$$ 3=-1+4$$


And then we use the fact that $$n^2-(n+1)^2-(n+2)^2+(n+3)^2=4.$$


P.S. My exam ended yesterday, didn't do that well in math and chem. So will focus on that! I did these problems during this 1 week.

P.S.S. From today onwards, I will officially start working on the Otis units! I don't think so I will be able to do a lot of units, but ye let's see. 

P.S.S.S. I think I have to update the pages. Also, I am thinking of making a page called "post log." Which will help the users to see different posts! I will probably add it in the upcoming weeks!


Well, that's it for this week. Also, 6k views special( Nope, no memes)  coming in the next week! Hope you enjoyed it. Happy problem-solving!

Sunaina 💜

Comments

  1. :o, cool problems.
    Also best of luck for Otis units :p.
    Just for flex (basically just for fun?) I completed my first unit (only 1 q left ) :sunglasses:

    ReplyDelete
  2. What are Otis units? Can you share the problems?

    ReplyDelete
    Replies
    1. Sorry, we cannot share the problems, not even the notes.

      Delete
  3. This comment has been removed by the author.

    ReplyDelete
  4. Try :
    Every natural number can be expressed as a finite sum of the form
    $$a_1+\frac{a_2}{2!}+\frac{a_3}{3!}+...........+\frac{a_n}{n!}$$
    Where $a_i$ are integers such that $0\leq a_i\leq i-1$ for $i>1$

    ReplyDelete
  5. P.S.S. From today onwards, I will officially start working on the Otis units! I don't think so I will be able to do a lot of units, but ye let's see

    Says a ReTiReD MO Contestant

    ReplyDelete
    Replies
    1. Hi prabh!
      Well, OTIS this time for fun. I haven't done even one unit :P

      Delete
    2. Lmao,
      ```hi Prabh``` 😂😂

      Delete
    3. Lmao
      Don’t take my name
      Please
      Request

      Delete
    4. The fact that you are using someone else's identity.. :sweat:

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

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

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

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

New year with a new beginning! And a recap of 2024..and all the best for INMO 2025!

Hi everyone! Happy New Year :)  Thank you so much for 95k+ views!!! How was everyone's 2024? What are everyone's resolutions? ( Do write down in the comment section! And you can come back 1 year later to see if you made them possible!). A Better Mathematician  Well, technically a theoretical computer scientist.  I am so grateful to be allowed to study at CMI where I can interact with so many brilliant professors, access the beautiful library and obviously discuss mathematics ( sometimes non math too ) with the students.    And this year, I want to learn more mathematics and clear my fundamentals. I have become much worse in math actually. And hopefully, read some research papers too :)  And discuss a lot of mathematics with other people.  However, with that whole depressing 2024 year, I have lost a lot of my confidence in mathematics. And to be a better mathematician, I should gain the confidence that I can be a mathematician. And well, I am working on...

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

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

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

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