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

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

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

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

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

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

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

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

Reflecting on past

INMO Scores are out!! I am now a two times INMO awardee :) I got 16|0|1, so 17 in total! Yes, 16 in P1 T_T. I was thinking I would lose marks because of the way I wrote.  Lemme tell ya'll what happened that day but first I should share a few thoughts I had before the exam. My thoughts Honestly, my preparation for INMO was bad. In fact, I should say I didn't work hard at all. As I have said earlier, I had lost all my hopes for INMO and Olympiads as a whole after EGMO TSTs happened.  Art by Jelena Janic EGMO TSTs i.e European Girl's Mathematical Olympiad Team selection Tests 2022.  Literally my thoughts after EGMO TSTs I feel very ashamed to share but I got 1 mark in my EGMO TSTs. Tests in which I literally gave my whole life. I did so many ISLs ( like SO MANY), I mocked EGMO 2021 TST where my score was 28/42 and I perfected Day 2. 1 mark in the TST just showed my true potential. There are way better people than me in olys. A friend even said to me, "If I wouldn't...

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