Skip to main content

Recurrence relations + Christmas Blog

 Hey everyone! Welcome back to my blog! Today's topic is Recurrence relations! 

The handouts/ books I have referred to are GRAMOLY's recurrence in combinatorics, Recursion in the AIME , Combinatorics: A problem-oriented approach and principles and techniques in Combinatorics.

Recursion is as cute as a rabbit ( not really)


Here are my notes!

Recurrence Relation: A recurrence relation is a formula or rule by which each term of a sequence can be determined using one or more of the earlier terms.


Problem 1: For each of the following sequences find a recurrence pattern.
a. $1,10,100,\dots $

b. $1,3,6,10,\dots $

c. $1,2,6,24,120,\dots $

d. $1,1,2,3,5,8,13,\dots$

e. $0,1,9,44, 265, \dots $

Solution: 

a. $$a_n=10\cdot a_{n-1}$$

b. $$a_n=a_{n-1}+n$$

c. $$a_n=n\cdot a_{n-1}$$

d. This is the Fibonacci sequence. We have $$F_0=1,F_1=1, F_2=2,\dots F_n=F_{n-1}+F_{n-2}$$

e. This is the derangement number. We have $$ D_n= n \cdot D_{n-1}+(-1)^n.$$ We also have $$D_n=(n-1)(D_{n-1}+D_{n-2})$$

The Stamp problem: 

Suppose we have $1,2,5$ stamps. The problem is to find the number of ways these can be arranged in a row so that they can add up to a give value $n.$

Solution: Let $a_n$ be the number of ways the stamp can add up to $n.$

Then we have three cases considering the value of the last stamp. 

Case 1: If the last stamp is $1$. Then the total value of the remaining stamps must be $n-1.$ Therefore the number of ways in which these remaining stamps can be selected is $a_{n-1}.$

Case 2: If the last stamp is $2$. Then the total value of the remaining stamps must be $n-2.$ Therefore the number of ways in which these remaining stamps can be selected is $a_{n-2}.$

Case 3: If the last stamp is $5$. Then the total value of the remaining stamps must be $n-5.$ Therefore the number of ways in which these remaining stamps can be selected is $a_{n-5}.$

So $$ \boxed{a_n=a_{n-1}+a_{n-2}+a_{n-5}}$$

Word with no two consecutive As :

Find the number of $n$ letter of letter words using letters from the set $\{A,B\}$ in which no two consecutive $A$ can appear.

Solution: Let $w_n=$ the number of $n$ letter word satisfying the given condition 

$a_n=$ the number of $n$ letter word ending with $A$

$b_n=$ the number of $n$ letter word ending with $B$

So $w_n=a_n+b_n.$

But note that if the last letter of a word is $A$ then the second last letter of the word is $B.$ So $a_n=b_{n-1}.$

And $$b_n= b_{n-1}+a_{n-1}\implies b_n=w_{n-1}\implies a_n=w_{n-2}$$

So $$\boxed{ w_n= w_{n-1}+w_{n-2}}.$$

Subsets with no two consecutive digits: 

Find the number of subsets of the set of digits $\{0,1,2,\dots, n\}$ such that the subset contains now two consecutive digits.

Solution:  Let $X_n$ denote the subset with highest element $n.$

Here are some  examples

$$X_0=1;\{0\}$$
$$X_1=1; \{1\}$$
$$X_2=2; \{2\}, \{0,2\}$$
$$X_3=3;\{3\},  \{0,3\}, \{1,3\}$$
$$X_4=5; \{4\}, \{0,4\}, \{1,4\},\{2,4\}, \{0,2,4\} $$

Note that $$\boxed{X_n= 1+ X_1+\dots+X_{n-2}}$$

where $1$ is for the single set $\{n\}$ and rest are because $n$ is added to the subset.

Classical Stairs:

There is a $n$ stair staircase, one can climb $1$ or $2$ stairs ($1$ or $2$ steps) at a time, in how many ways he can climb the entire staircase?

Solution: Let $a_n$ denote the number of ways he can climb the $n$ stairs. Then we get two cases considering the last step.

Case 1: If the last step was $1$ stair then he was at $n-1$ staircase. There are $a_{n-1}$ ways to reach the $n-1$th staircase

Case 2: If the last step was $2$ stair, then we previously at $n-2$ th staircase. There are $a_{n-2}$ ways to reach the $n-2$th staircase.

So $$\boxed{a_n=a_{n-1}+a_{n-2}}$$

Tower of Hanoi: 

Given a stack of $n$ disks arranged from largest on the bottom to smallest on top placed on a rod, together with two empty rods, the tower of Hanoi puzzle asks for the minimum number of moves required to move the stack from one rod to another, where moves are allowed only if they place smaller disks on top of larger disks. 

Solution: The minimum number of moves is $\boxed{2^n-1}.$

Proof: Let the discs be $[1,2,3,\dots, n]$ with $[1]<[2]<\dots<[n].$ Denote $A_n$ as the number of moves requires to move discs $[1,2,3,\dots, n].$

Also let's name the rods as $A, B, C.$

Claim: we need atleast require  $2\cdot A_{n-1}+1$ moves.

Proof: Now, consider the step when we keep disk $[n]$ from some rod $X$ to rod $C.$ This will require us $1$ move. Also during this move the $[n-1]$ discs must be in rod other than $X$ and $C.$ ( arranging the $[n-1]$ discs would have took us at least $A_{n-1}$) And then to bring back the $n-1$ disks back to rod $C$ would have took us at least another $A_{n-1}$ moves.

So we know that the required moves is $\ge 2\cdot A_{n-1}+1.$

Claim: $2\cdot A_{n-1}+1$ works

Proof: We shift the $[1,2,\dots , n-1]$ disc from $A$ to $B$ which will be done in $A_{n-1}$ moves, shift $[n]$ from $A$ to $C$ in one move and then shift $[1,2,\dots , n-1]$ disc from $B$ to $C$   in $A_{n-1}$ moves.

So $$ A_n= 2\cdot A_{n-1}+1.$$

Another way of proving the bound was just strong induction.

We have $A_1= 1, A_2=3, A_3=7, \dots$ and by induction we get $\boxed{A_n=2^n-1}.$

Okay, now we should know how to "solve" linear recurrence relations..

Open and closed Brackets: 

How many ways are there to arrange $n$ open brackets ”[” and $n$ closed brackets ”]” such that when read left to right, the number of closed brackets is less than or equal to the number of open brackets?

Solution: The answer is the Catalan number.

Let $C_n$ denote the number of ways.  

Let us consider  the sequence of closed and open brackets as $a_1,a_2,\dots a_{2n}$ where $a_i $ is either $[, ]$ 

Let $f(j)$ denote the number of [ which are there in the sequence from $a_1,\dots ,a_i$ and $g(j)$ denote the number of ] which are there in the sequence from $a_1,\dots ,a_i.$

Now we consider cases. At first, we have $f(1)>g(1)$ but at the end of the sequence, we have $f(2n)=g(2n).$ So there would be an index $k$ where $f(k)=g(k).$ Note that in this index our first open bracket will complete.

So we have the sequence of the form $$ [A]B$$

Now, both $A$ and $B$ also have to balance and can max contain $n-1$ pairs inside.

So $$C_n=\boxed{C_0\cdot C_{n-1}+C_1\cdot C_{n-2}+C_3\cdot C_{n-4}+\dots + C_{n-1}\cdot C_0}$$

Also, we have $$\boxed{C_n=  \frac{1}{n+1}\binom{2n}{n}}$$

Dominoe tiling:

How many ways are there to fill in a $ 2 \times n$  grid with $1 \times 2$ or $ 2\times 1$ dominos?

Solution:  Now we consider the last $2 x 1$ cell. We consider in what ways we can tile. Denote $T_n$ as the number of ways to tile. We consider cases.









So we get $$ \boxed{T_n=T_{n-1}+T_{n-2}}$$



Linear Recurrence:  A linear recurrence


is a recurrence relation where $a_n$ is expressed as a linear combination of previous terms of the sequence.

Wait what about other non-linear recurrence relations? It's hopeless to solve them :) 

Also, a recurrence relation is homogeneous if it doesn’t contain any constant terms. Else, not homogeneous.


So a linear homogeneous recurrence is $$c_0a_n+c_1a_{n-1}+\dots +c_ra_{n-r}=0$$

The  characteristic equation  of the recurrence is $$c_0x^r+c_1x^{r-1}+\dots +c_r=0$$

If $\alpha_1,\dots \alpha_r$ are the distinct roots then $$ a_n= A_1(\alpha_1)^n+A_2(\alpha_2)^n+\dots +A_r(\alpha_r)^n$$

What about repetitions?



So for two-degree equation whose root repeat we get,

$$a_n= (A+Bn)r^n$$


Solving Fibonacci: 

We have to solve the recurrence $$a_n-a_{n-1}-a_{n-2}=0$$

So the characteristic equation is $$ x^2-x-1=0$$

and it's roots are $$ \alpha_1=\frac{1+\sqrt{5}}{2}$$ and $$\alpha_2=\frac{1-\sqrt{5}}{2}$$ 

Hence $$ a_n= A\Big(\frac{1+\sqrt{5}}{2}\Big)^n+B\Big(\frac{1-\sqrt{5}}{2}\Big)^n$$

Since $$a_0=a_1=1\implies A+B=1, A\Big(\frac{1+\sqrt{5}}{2}\Big)+B\Big(\frac{1-\sqrt{5}}{2}\Big)=1$$

Solving gives us $$A= \frac{1+\sqrt{5}}{2\sqrt{5}}, B=\frac{-1+\sqrt{5}}{2\sqrt{5}}$$

So $$a_n= \frac{1}{\sqrt{5}}\Big[ \Big(\frac{1+\sqrt{5}}{2}\Big)^{n+1}-\Big(\frac{1-\sqrt{5}}{2}\Big)^{n+1}\Big]$$


Another example: 

Find solution to the recurrence relation $$ a_n=3a_{n-1}+4a_{n-2}$$ with $a_0=2, a_1=3.$

Solution: We have $x^2-3x-4=0\implies (x-4)(x+1)=0$

So $$a_n=A\cdot 4^n+B\cdot (-1)^n$$
So $$a_0=2\implies A+B=2$$

$$a_1=3\implies 4a-B=3$$

$$\implies A=1,B=1$$

Hence $$a_n= 4^n+(-1)^n$$

Olympiad Problems:

Problem [India postal 2006]: Consider the set $A = \{1, 2, 3, ..., 2008\}$. We say that a set is of type $r, r \in \{0, 1, 2\}$, if that set is a nonempty subset of $A$ and the sum of its elements gives the remainder $r$ when divided by $3$. Denote by $X_r, r \in \{0, 1, 2\}$ the class of sets of type $r$. Determine which of the classes $X_r, r \in \{0, 1, 2\}$, is the largest.

Proof: Consider set $B=\{1,2,\dots , 3k\}, k>1.$

Claim 1:$X_0$ is the largest for set $B.$

We can say by symmetry, $|X_1|=|X_2|.$ And we can show this by induction on $k.$ 

For base case take $k=2,$ we get $|X_1|=|X_2|=2$ and $|X_3|=3.$ So $X_3 $ is largest. Now if we add $\{4,5,6\}, $ we will get previous set using only 

$E=\{1,2,3\}$  , sets  using only $F=\{4,1,2,3\}$ , sets  using only $G=\{5,1,2,3\}$ ,sets  using only $H=\{6,1,2,3\}$, sets  using only $I=\{4,5,1,2,3\}$,  sets  using only $J=\{4,6,1,2,3\}$,  sets  using only $K=\{5,6,1,2,3\}$,  sets  using only $L=\{4,5,6,1,2,3\}.$

For now sets $F,G,H,I,J,K,L$ will use at least two elements from there sets with $F$ must having $4$, $G$ having $5$, and so on.

Now initially we has $X_1=2,X_2=2, X_3=3$ . Now if we see sets, $\{4\},\{5\},\{6\},\{4,5\},\{4,6\}, \{5,6\}.$ Now $X_1=3,X_2=3,X_3=5.$

Now set $E's$ all non empty subset ahs been counted. Now consider set $F.$ Since $F's $ subsets will must have $4,$ it's same as having $E's$ subsets, but everything shifting to $1\mod 3,$ hence it will have $X_1=3,X_2=2,X_3=2.$

Similarly Since $G's $ subsets will must have $5,$ it's same as having $E's$ subsets, but everything shifting to $2\mod 3,$ hence it will have $X_1=2,X_2=3,X_3=2.$

And so on.. adding we get $X_1=20,X_2=20,X_3=23.$ For set $\{1,2,3,4,5,6\}.$

Now for $\{1,2,3,4,5,6,7,8,9\}, $ we will have $X_3$ and infact by this method, we get $|X_3| - |X_1|=2\cdot 3+1=7.$

For $\{1,2,3,4,5,6,7,8,9,10,11,12\}, $ we will have $X_3$ and  we get $|X_3| - |X_1|=2\cdot 7+1.$

So this forming recurrence stuff. Clearly $K$ grows more, the difference between $X_3$ and $X_1$ grows very much too.

Now consider $C=\{1,2,\cdots,3k,3k+1\},$ It's just the set $B$ but we added ${3k+1}. $ So there are $3$ types of subsets, 

Subset's of $B$, $\{3k+1\}, D=$Subsets must containing $3k+1.$

Claim2: $X_1$  is the largest for $C.$

Now if for $B,$ we have by our claim, $X_1=X_2=a$ and $X_3=b$ and $b>>a.$ 

Again, note that $D's$ subets are just $ B's$ subsets, but everything shifted with $1\mod 3.$ 

So $D's$ contribution to $X_1=b,X_2=a,X_3=a$ and the single set $\{3k+1\} $ contributes $1$ to $X_{1}.$

So for set $C,$ we get $X_1=a+b+1,X_2=a+a,X_3=a+b.$ Hence we get $X_1$ to be the largest. 

Note that $2008=2007+1= 3l+1,$ so by our Claim2, we get $X_1$ to be the largest. And we are done!

Problem[ Modified INMO from Gramoly handout]: For any natural number $n,$ consider a $1 \times n$ rectangular board made up of n unit squares. This is covered by $3$ types of tiles : $1 \times 1$ red tile, $1 \times 1$ green tile and $1 ×\times 2$ domino. Let $T_n$ denote the number of ways of covering $1 \times n$ rectangular board by these $3$ types of tiles. Find a recursion for $T_n$

Proof: Clearly, $$T_n=2\cdot T_{n-1}+ T_{n-2}.$$
Solving, we $$x^2-2x+1=0 \implies a_n= A(1+\sqrt{2})^n+B(1-\sqrt{2})^n$$

Then $$a_1=2, a_2 =3\implies A+B=2, A-B=\frac{3}{\sqrt{2}}$$

Problem [2018 USAJMO]: For each positive integer $n$, find the number of $n$-digit positive integers that satisfy both of the following conditions:

no two consecutive digits are equal, and the last digit is a prime.

Proof: Note that the unit digit can be filled up in $4$ ways and then we can fill up the rest $n-1$ digits in $9^{n-1}$ ways ( allowing $0$ to be in the first digit). Now, note that the no. of numbers has $0$ in the first place is $a_{n-1}.$

Hence $$4\cdot 9^{n-1}=a_n+a_{n-1}\implies a_n+a_{n-1}= \frac{ a_n+a_{n-1}}{9}$$

$$\implies 8a_{n-1}+9a_{n-2}=a_n$$ And $a_1=4, a_2=32$

Solving we get $$x^2-8x-9=0\implies \alpha_1= -1, \alpha_2=9 \implies a_n= A(-1)^n+B(9)^n$$

$$ \implies A=\frac{-2}{5}, B=\frac{2}{5}$$

So $$\boxed{a_n=\frac{2}{5}\left(9^n-(-1)^{n}\right)}$$

Problem[ 2020 C1]: Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying

$$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$

Proof: Let $F_0=1,F_1=1,F_2=2, F_n=F_{n-1}+F_{n-2}.$ We claim that the number of permutation is $F_n.$ 
We use strong induction. For $n=1$ it is true. For $n=2$ we get $(1,2)$ and $(2,1).$

Claim:  $k+1$ is $a_k$ or $a_{k+1}$ in a valid permutation

Proof: If not then let $k+1$ be $a_y.$ Then let $y$ be $a_i.$ Also $i\cdot y\le (k+1) y$ for any $i.$

So $i \le y.$ Hence by PHP, there is a number $x<y$ which is $a_j$ and $j>y.$ But then we must have $j\cdot x\ge (k+1) y$ which is false. A contradiction.

So $k+1$ is $a_k$ or $a_{k+1}.$

Case 1: If $k+1$ is $a_{k+1}$ then by induction, we have $F_k$ valid permutaion.

Case 2: If $k+1$ is $a_{k}$ then $a_{k+1}$ must be $k,$ then by induction, we have $F_{k-1}$ valid permuations.

So $$\boxed{F_{k+1}=F_k+F_{k-1}}.$$

Yayy!! That's it for today's recurrence blog post!! There will be a sequel of harder problems ( I asked Rohan bhaiya to send some handouts, which he did and the problems look hard)! 

Also a short Christmas blog :P

So I had an appointment with the dentist ( cause I have braces). So, we went for a regular checkup. After the check-up, we went to Rudrakh mall which has my favourite shop in Guwahati! MUMUSO!! It has so cute stationery items :pleading: and as always I bought so cute stuff. Although, my mom always says the items are just useless -_-..

I bought these paper clips.. They are so cute!

After Mumuso, Suhan played a virtual reality cricket game, where he lost terribly :P And then we realised Pantaloons had sale! My mom after hearing the word "sale" turned into Sinchan's mom 😂

The sale was " Buy 5000+ rupees cloth,  get 5000 rupee cloth for free." And boom! We spent 3 hours buying clothes 😇. My mom was very proud of herself.

The mall looked so beautiful


After that, we went to dominoes, where I ate my fav food item, Moroccan chicken chunks ( try it!!) 😋

Then we went to a Turkish ice cream stall, where the ice cream maker guy played tricks like not giving Suhan his ice cream ( you know those viral shorts videos?)
And the icre cream was so nice!!


Suhan was looking weird :P

Yeah! That's what we did yesterday! It was quite fun!! I hope you guys are also having fun during this vacation! 


Stay safe
Sunaina 💜



Labels:

Comments

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

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

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

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

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

Some NMTC sub-junior level Problems

Well.. Many people don't know but I was a part of STEM's Horizon ( Now, I have left them due to boards etc.) BTW STEM's Horizons is really great! And anyone interested in Olympiad math should join it! More info about it in below (make sure to check it out!). So here are some problems I sent to them. They are fairly easy, and most of them are repetitive ideas. But they are my first sets of problems ( I know UMO was there but still..) The solutions will be posted in another blog posts. You guys can type out sols in the comments sections too :) Problems:- 1. What is maximum possible number dividing  $x^2+x+1$ and $x^5 +x^4 +x^3 + 3x^2 +2 x +4$ for all $x\in \Bbb{N}$ 2. Let $P$ be the sum of all $x$ and $y$ satisfying $45^x-2^x=2021^y.$ What is the last two digits of $p^2+p+1.$ 3. What is the greatest value of $r$ such that $3^r$ is factor of $10^{2022}-8^{674}$. 4. Find all possible tuples $ (x,y,l)$ such that $\frac{x}{100}=\frac{20}{y}=\frac{5}{l}.$ 5. Consider the following...
13 comments
Read more

Problems done in August

  Welcome back! So today I will be sharing a few problems which I did last week and some ISLs. Easy ones I guess. Happy September 2021!  Problem[APMO 2018 P1]: Let $ABC$ be a triangle with orthocenter $H$ and let $M$ and $N$ denote the midpoints of ${AB}$ and ${AC}$. Assume $H$ lies inside quadrilateral $BMNC$, and the circumcircles of $\triangle BMH$ and $\triangle CNH$ are tangent. The line through $H$ parallel to ${BC}$ intersects $(BMH)$ and $(CNH)$ again at $K$, $L$ respectively. Let $F = {MK} \cap {NL}$, and let $J$ denote the incenter of $\triangle MHN$. Prove that $FJ = FA$. Proof:  By angle chase, we get $\angle FKL=\angle FLK.$    Hence $KL||MN\implies FM=FN.$   And we get $\angle MFN=2A\implies F$ is circumcentre if $(AMN)\implies FA=FM=FN.$   And we get $\angle MHN=180-2A$    Hence $MFHN$ is cyclic.    By fact 5, $ME=FJ=FN\implies FJ=FA.$ Problem[Shortlist 2007 G3]: Let $ABCD$ be a trapezoid whose diagonals meet at $P$....
17 comments
Read more

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