Skip to main content

TOP 10 problems of Week#2

This week was full Number Theory and algebra biased!! 😄

Do try all the problems first!! And if you guys get any nice solutions , do post in the comments section!

Here are the walkthroughs of this week's top 5 Number Theory problems!

5th position (1999 JBMO P2): For each nonnegative integer $n$ we define $A_n = 2^{3n}+3^{6n+2}+5^{6n+2}$. Find the greatest common divisor of the numbers $A_0,A_1,\ldots, A_{1999}$.

Walkthrough: It doesn't require a walkthrough, I wrote this here, cause it's a cute problem for the person who has just started Contest math :P

a. What is $A_0$?

b. Find out $A_1$.

c. Show that $\boxed{7}$ is the required answer!

4th position (APMO, Evan Chen's orders modulo a prime handout): Let $a,b,c$ be distinct integers. Given that $a | bc + b + c, b | ca + c + a$

and $c | ab + a + b$, prove that at least one of $a, b, c$ is not prime.

Walkthrough: Fully thanks to MSE ! (Also one should try MSE, it has helped me a lot, ofc it's more tilted to College math but it's great! )

a. FTSOC let $a,b,c$ be primes. Then note that by simon's favorite factoring trick , we get $(b+1)(c+1)\equiv 1 \mod a$ , similarly for $b,c$.

b. Bound $\frac{(a+1)(b+1)(c+1)}{abc}$ and get a contradiction !

3rd position (IMO 2011 P1): Given any set $A = \{a_1, a_2, a_3, a_4\}$ of four distinct positive integers, we denote the sum $a_1 +a_2 +a_3 +a_4$ by $s_A$. Let $n_A$ denote the number of pairs $(i, j)$ with $1 \leq  i < j \leq 4$ for which $a_i +a_j$ divides $s_A$. Find all sets $A$ of four distinct positive integers which achieve the largest possible value of $n_A$.

Walkthrough: This was clearly the hardest of all like I took  lot of hints :P.

a. Show that $n_A\ne 6,5$.

b. We will show that $n_A=4$ is possible. hmm...so what do we have ? 

c. Show that $a_1+a_4=a_2+a_3$.

d. So $a_1+a_2|2(a_2+a_3) \implies k_1(a_1+a_2)=2(a_2+a_3)$ , and similarly $k_2(a_1+a_3)=2(a_2+a_3)$ , where $k_1>k_2$.

e.But note that $2a_3+2a_1>2(a_2-a_1) \implies k_2=3$.

f. Show that $k(a_1+a_2)=6a_2-6a_1 \implies k_1=4,5$

g. Case bash!!!!!!!!! 

2nd position(IMO 2011 P5) : Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$.

Walkthrough: Thanks to the Pr0est Mueller.25

a. Take $P(m,0)$ and show that $f(m)|f(0)$ for all $m$. This gives that $f(x)$ has finite solutions.

b. Take $P(0,n)$ and $P(0,-n) $ and show that $f(n)=f(-n)$.

c. Prove by induction that if $a|b \implies f(a)|f(b)$ [it's not required, we just want $f(1)|f(b)$, but it's cute, so one can try].

d. Since $f(x)$ has finite solution, let the solutions be $f(1)<f(a_1)< \dots <f(a_k)<f(0)$.

e. So.. the problem now reduces on showing $f(a_i)|f(a_j)$ when $i<j$. 

f. okay so we have $f(1)|f(a_i)$ , so let's try showing $f(a_1)|f(a_2)$.

g. Let's take $P(a_2,a_1)$ then show that $f(a_2-a_1)= f(a_1)$ or $f(1)$.

h. But we want to show that $f(1)|f(2)$ . But note that if we show that $f(a_2-a_1)= f(a_1)$, then we will be done! So let's try to show that!

i. Take $P(a_2-a_1, -a_1)$ and wola!

1st Position (IMO Shortlist 2011 N3):  Let $n \geq 1$ be an odd integer. Determine all functions $f$ from the set of integers to itself, such that for all integers $x$ and $y$ the difference $f(x)-f(y)$ divides $x^n-y^n.$

Walkthrough: a. Try to guess what possible solutions can be by taking $n=1,3,6$ ( just guess, no need to prove :P) 

b. Note that if $f(x)$ works then $f(x)+c, -f(x)$ works too. So we can assume $f(0)=0$ and $f(1)=1$.

c. With $P(p,1)$ and $P(p,0)$, where $p$ is a prime, show that $f(p)=\pm p^k$ , where $k|n$ 

d. Show $f(p)\ne -p^k$ [ we here use the fact that when $a^b-1|a^c-1 \implies b|c$ and also $k\ne 0$ ]

e. But n has finitely many prime factors , and there are finitely many prime, so there will exist a prime factor of $n$ say $d$ , which will be used infinitely times. So let $q$ be a very( verrrry big) prime with $f(q)=q^d$

f. Take $P(x,q)$, and show that $f(x)=x^d$. And then conclude! 

g. Solutions are $\boxed{f(x)=\pm x^d+c}$ where $d|n$.

Next are the walkthroughs of this week's top 5 Algebra problems! This is only for beginners algebra people ( It's not my fault that people who are reading this blog are pr0s 😎). *Take it more like as a set of problems to motivate you to study algebra :P

5th position (2010 AMC 10 A P21) : The polynomial $x^3-ax^2+bx-2010$ has three positive integer roots. What is the smallest possible value of $a$?

Walkthrough: a. Use Vieta's formula and factorize $2010=2\cdot 3 \cdot 5\cdot 67$ 

b. okay to minimize , obviously 6,5,67 will be answer :P (idk how to explain this part , it actually follows trivially :P)

4th position (NIMO summer contest P9): The roots of the polynomial $P(x) = x^3 + 5x + 4$ are $r, s$, and $t$. Evaluate$ (r + s) ^4 (s + t) ^4 (t + r)^ 4$

Walkthrough: a. Use Viteta's , we get $r+s+t=0$ 

b. we just have to find $(rst)^4$.

3rd position (AIME 2008 II P7): Let $ r$, $ s$, and $ t$ be the three roots of the equation $8x^3+1001x+2008=0.$ Find $ (r+s)^3+(s+t)^3+(t+r)^3$.

Walkthrough: Ooo quite similar to the problem we did  previously.

a. Use viteta and get $r+s+t=0$. So $ (r+s)^3+(s+t)^3+(t+r)^3=-(t^3+r^3+s^3)$.

b. So for people who are in grade 9 or below India standard, or any beginner in algebra, there's a very well known formula, which says $a^3+b^3+c^3=3abc$ , when $a+b+c=0$, it's just $a^3 + b3^ + c^3 - 3abc = (a + b + c)(a^2 + b^2 + c^2 - ab - bc - ca)$ . Use it and we are done!

2nd position (2017 AMC 12 A P17) : There are $24$ different complex numbers $z$ such that $z^{24}=1$. For how many of these is $z^6$ a real number?

Walkthrough:  I don't think so any walkthrough is needed :P. Answer is $\boxed{12}$. Consider $z^{{\frac{2\pi\cdot i \cdot k}{24}}\cdot 6}$ , it will be real iff $k$ is even .

1st Position(JBMO 2012 Shortlist): Let $a$ , $b$ , $c$ be positive real numbers such that $abc=1$ . Show that :

$\frac{1}{a^3+bc}+\frac{1}{b^3+ca}+\frac{1}{c^3+ab} \leq \frac{ \left (ab+bc+ca \right )^2 }{6}$

Walkthrough: a. Use AM-GM and get $a^3+bc\ge 2a$.

b. Try to get this $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\le \frac{(ab+bc+ca)^2}{3}$ , conclude with AM-GM again !

So these were my top 10 ! I personally wanted to add JMO 2017 P4, but didn't ( due to some soul imbalance , you will understand what I mean once you try this problem) . Go ahead and try if u want to :P.

What are your top 10s ? do write in the comments section (at least write something ! I will be happy to hear your comments ). Follow this blog if you want to see more contest math problems! See you all soon 😊.

---

I also made a pdf compilation of these problems and hints. Here is the google drive link https://drive.google.com/file/d/1sFQBU1MDIYGXWKG_1Bb6TpUAfTZfT4en/view?usp=sharing

Sunaina 💜


Comments

  1. Nice Post!
    BTW which year's APMO was N4? Asking 'cause its almost same as IMO 1992/P1

    ReplyDelete
    Replies
    1. I actually don't know.. Evan sourced it as APMO in his orders modulo prime handout ..

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

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

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

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