Skip to main content

Non geos are cool!

 Hi! I am posting 5 quick, cute and simple non-geo questions!
I have posted their solutions too. The level is probably a good  INMO level. Do try them! I actually gsolved 4 of them with PC! All of them are from AOPS's Old highschool Olympiad forum.

Problem1: In the following triangular table

$$0,~1,~~2\dots 1958$$

$$1,~~3,~~5\dots 3915$$

$$\dots \dots $$

each number (except for those in the upper row) is equal to the sum of the two nearest numbers in the row above. Prove that the lowest number is divisible by $1958$


Solution: I actually messed up the calculation a bit (posted at MSE), so thanks to everyone who helped me :)


Well, $1958$ surely isn't special. So let's prove for any $$a_1,a_2,a_3,\dots a_n$$ triangular table.


So we have $$a_1~~a_2~~a_3~~a_4\dots \dots~~a_n $$

$$ \downarrow$$

$$(a_1+a_2)~~(a_2+a_3)~~(a_3+a_4)~~(a_4+a_5)\dots \dots ~~(a_{n-1}+a_n) $$

$$ \downarrow$$

$$(a_1+2a_2+a_3)~~(a_2+2a_3+a_4)\dots\dots ~~( a_{n-2}+2a_{n-1}+a_n)$$

$$ \downarrow$$

$$(a_1+3a_2+3a_3+a_4)~~(a_2+3a_3+3a_4+a_5)\dots \dots  $$

$$ \downarrow$$

$$(a_1+4a_2+6a_3+4a_4+a_5)~~ (a_2+4a_3+6a_4+4a_5+a_6)\dots $$

$$ \downarrow$$

$$(a_1+5a_2+10a_3+10a_4+5a_5+a_6)\dots  $$

$$ \vdots$$


Now, we only care about the first term of each row. In the last row of the table, there is only one term.

Now, one can notice the pattern in the first terms, in general (proovable by induction) they are of the form $$(a_1+\binom{k}{1}a_2+\dots + \binom {k}{2}a_{k-1}+\binom{k}{k-1}a_k+a_{k+1}).$$

So the last row's term will be $$(a_1+\binom{n-1}{1}a_2+ \binom{n-1}{2}a_3+\dots + \binom{n-1}{n-2}a_{n-1}+a_n). $$

Then we have $a_1=0,n=1959.$

So we get $$\binom{1958}{1}1+ \binom{1958}{2}2+\dots + \binom{1958}{1957}1957 +  \binom{1958}{1958}1958 =2^{1958-1}1958.$$

Where we got the last line by using the property by differentiating $(1+x)^{1958}$ and then take $x=1.$


Problem2: There are $315$ marbles divided into three piles of $81, 115$ and $119$. In each move Ah Meng can either merge several piles into a single pile or divide a pile with an even number of marbles into $2$ equal piles. Can Ah Meng divide the marbles into $315$ piles, each with a single marble?

Solution: Note that, if we have $n$ numbers as the pile numbers with common $\gcd=d, d>2.$ So we have say $da_1,~da_2,\dots, da_n.$ 

Then whatever moves we make, the resultant pile numbers will be divisible by $d.$

For example, say we have a pile having $$115~~100~~100 \rightarrow 115,~~50,~~50,~~50,~~50$$

Then whatever move we do, we can atmost reach $$ 5,~~5\dots \dots,5~~5.$$

Now, note that $\gcd(81, 115+119=234)=9.$

So the pile number will always be divisible by $9.$ For this case we can't achieve pile numbers as $1,1,\dots 1$ $315$ times..

Now, note that $\gcd(115,81+119=200)=5.$

So the pile number will always be divisible by $5.$ For this case we can't achieve pile numbers as $1,1,\dots 1$ $315$ times..

Now, note that $\gcd(119,81+115=196)=7.$

Same reason.

Hence Ah Meng can not divide the marbles into $315$ piles, each with a single marble.


Problem3: Two players $A$ and $B$ take stones one after the other from a heap with $n \ge 2$ stones. $A$ begins the game and takes at least one stone, but no more than $n -1$ stones. Thereafter, a player on turn takes at least one, but no more than the other player has taken before him. The player who takes the last stone wins. Who of the players has a winning strategy?

Answer: When $n$ is not a perfect power of $2$ then $A$ wins. If $n$ is a perfect power of $2,$ then $B$ wins.

Solution: If there are an odd number of stones then $A$ wins. 


Because then $A$ takes $1$ stone and then $B$ is forced to take only $1$ stone. And then $A$ takes $1$ stone and so on. Since we have odd number of stones. $A$ will be the last person to take the stone, hence $A$ wins.


 Claim: If $v_2(n)=1,~~n\ne 2,$ then $A$ wins.


$A$ starts with taking $2$ stones. Now, $B$ won't take $1$ stone, because then $A$ will get odd stones, and we know having odd stones means we can win. Hence $B$ will take $2$ stones. Since $v_2(n)=1,$ we know that $A$ will be the last person to take the stone.


 Claim: If $v_2(n)=2,n\ne 4$ then $A$ wins


$A$ starts with taking $4$ stones. Now, $B$ knows that if $A$ gets a stones with $v_2(n)=0,1;$ $A$ wins. Hence $B$ will take $4$ stones and will try to maintain $v_2(n)=2.$ But then we know $n=4k,~k\ne 1 $ odd. Hence, $A$ will win.

So this gives induction vibes. 


Claim:  If $n$ not a perfect power of $2,$ $A$ wins. We prove it using induction.

Consider $v_2(n).$ For $v_2(n)=0,1,2$ $A$ wins. Suppose $A$ wins for $v_2(n)=0,1,\dots k.$

Now we will show that $A$  wins for $v_2(n)=k+1\implies n=2^{k+1}\cdot m,~~m>1$ is odd. 

$A$ will subtract $2^{k+1}.$ $B$ knows that $A$ will win if $A$ has $v_2(n)<k+1.$ Hence $B$ will try to maintain $v_2(n)=k+1.$ So $B$ subtarcts $2^{k+1}.$ And then again $A$ subtracts $2^{k+1}$ and so on. But $A$ will win since $m>1$ is odd. 

And we are done.


 Claim: When $n$ is a perfect power of $2.$ Then $B$ wins.

If $n=2^k,$ $A$ has to take less than $2^{k-1}$ stones because if not in the next move $B$ can take everything. 

But then whatever $A$ takes, $B$ will receive a "non-perfect power of $2$" number of stones. Which we know is a winnable situation. So $B$ wins.


Problem4: Find all natural numbers n with the following property : there exists a permutation $(i_1,i_2,\ldots,i_n)$ of the numbers $1,2,\ldots,n$ such that, if on the circular table there are $n$ people seated and for all $k=1,2,\ldots,n$ the $k$-th person is moving $i_k$ places in the right, all people will sit on different places.

Solution: We claim that only odd $n$ satisfy the condition.

Claim: Odd $n$ work.

Let $(i_1, i_2, \ldots, i_n)$ = $(1,2, \ldots, n)$. Let us denote the initial positions of $n$ persons by $(1, 2, \ldots, n)$

Then the final positions are $(1+1, 2+2, \ldots, n +n)$. So if we prove that all elements of the set $2\cdot {1,2, \ldots, n}$ are distinct. 

Since $gcd(n,2) = 1$ for odd $n$, so the elements of set will be unique and from $1$ to $n$, which satisfy the condition.

Claim: Even n don't work 

Suppose not then we must have 

$$\{1 + i_1, 2 + i_2, \ldots, n + i_n\} \equiv \{1, 2, \ldots, n\} \pmod{n}$$

$$\implies \sum_{j = 1}^n i_j \equiv 0 \pmod{n}$$

Let $n = 2k$

$$\implies k(2k+1) \equiv 0 \pmod{2k}$$

Since $gcd(2k, 2k+1) = 1$

$$\implies k \equiv 0 \pmod{2k}$$

Which is clearly false. 

Problem5: Find all triples $(x, y, z)$ such that $x, y, z, x - y, y - z, x - z$ are all prime positive integers.

Solution: We claim that $(x,y,z) = (7, 5, 2)$ is the only solution.

Clearly, by the question statement $x > y > z$

 Claim: $z = 2$

If all the 3 variables are odd, then their pairwise difference must be even, i.e. 2, as it is the only even prime.

$$\implies x = y+2,\enspace y = z+2, \enspace x = z+2$$

$$x = z + 4 = z+ 4$$

which is not possible. 

 One of them is $2$, since $z$ is smallest and $2$ is the smallest prime $\implies z = 2$


Now, $x-2, x, x+2 $ must be all prime as per the question. 

Since $x \equiv 1, 2 \pmod{3}$

 $\implies$ one of $x-2$, $x$, $x+2$ must be divisible by 3.

$$\implies x - 2 = 3 \implies x = 5$$

$$\implies y = 7$$

$$\implies (x,y,z) = (7,5,2)$$


Yeaaahhh.. This is it for this week. Now, I am taking a break from Olys (till 20th), since I have quite a nice heavy backlog in school and jee! And we have a test at 20, which I am going to fail massively.

Speaking about the school, CBSE 10 results came and I got 95.66%. I think I could have got better marks in IT though but nvm I am happy with what I got!

Also although I am taking a break, I have already prepared the things needed for the next blogpost (hehehe).

So yeah! If you like this type of content then follow the blog! Maybe visit weekly once. Actually, the email subscription isn't working :(.

See you soon,
Sunaina 💜

Comments

  1. When did u do the p1?
    Imo that seems to be toughest 😂

    ReplyDelete
    Replies
    1. Lol I think August first week. It's the easiest. prmo level I complicated
      it. 🤔💫

      Delete
  2. Beautiful questions! I personally liked P3. Remaining were nice too :)

    ReplyDelete
    Replies
    1. hehehe..glad you liked them. I might post some non geos part 2 this week !

      Delete
    2. Great!!! So you're preparing for JEE? What about KVPY?

      Delete
    3. Yeah, P3 was fun to do.
      I remember while doing, my claim was like - 8k+4 fails...... No no 16k+8 fails....... No no 32 k + 16 fails 😂

      And then finally 2^k works lol

      Delete
    4. I am doing jee, currently I too don't know about myself. KVPY, giving but not preparing at all.

      Delete

Post a Comment

Popular posts from this blog

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

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

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

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

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

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

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

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