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

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

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

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

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

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

Challenging myself? [Jan 15-Jan 27]

Ehh INMO was trash. I think I will get 17/0/0/0-1/3-5/10-14, which is def not good enough for qualifying from 12th grade. Well, I really feel sad but let's not talk about it and focus on EGMO rather.  INMO 2023 P1 Let $S$ be a finite set of positive integers. Assume that there are precisely 2023 ordered pairs $(x,y)$ in $S\times S$ so that the product $xy$ is a perfect square. Prove that one can find at least four distinct elements in $S$ so that none of their pairwise products is a perfect square. I will use Atul's sol, cause it's the exact same as mine.  Proof: Consider the graph $G$ induced by the elements of $S$ and edges being if the products are perfect squares. Note that if $xy = a^2$ and $xz = b^2$, then $yz = \left( \frac{ab}{x} \right)^2$, since its an integer and square of a rational number its a perfect square and so $yz$ is an edge too. So the graph is a bunch of disjoint cliques, say with sizes $c_1, c_2, \cdots, c_k$. Then $\sum_{i=1}^k c_i^2 = 2023$, which ...

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

Some random problems

  I know, I know. Different font indeed. I have deleted a few of my MSE answers. I felt they weren't that good in quality. And a few questions are from my prev aops account which I have deactivated now. I also have posted 10 IOQM types of problems. These can be used while preparing for IOQM. Problem: Prove that $\dfrac{ab}{c^3}+\dfrac{bc}{a^3}+\dfrac{ca}{b^3}> \dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}$, where $a,b,c$  are different positive real numbers.  Proof: Note that by AM-GM $$\frac{ab}{c^3}+\frac{bc}{a^3}\ge \frac{2b}{ac}$$ and we also have $$\frac {b}{ac}+\frac{c}{ab}\ge \frac{2}{a}$$. Hence, $$\sum_{cyc}\frac{ab}{c^3}\ge\sum_{cyc}\frac{b}{ac}\ge\sum_{cyc}\frac{1}{a}$$ where everything we got is by applying AM-GM on $2$ terms and then dividing by $2$. USA TST 2007: Triangle $ABC$ which is inscribed in circle $\omega$. The tangent lines to $\omega$ at $B$ and $C$ meet at $T$. Point $S$ lies on ray $BC$ such that $AS$ is perpendicular to $AT$. Points $B_1$ and $C_1...

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