Summer is a great time to explore cool problems to keep your skills sharp!  Schedule a class today!

G
Topic
First Poster
Last Poster
k a June Highlights and 2025 AoPS Online Class Information
jlacosta   0
Jun 2, 2025
Congratulations to all the mathletes who competed at National MATHCOUNTS! If you missed the exciting Countdown Round, you can watch the video at this link. Are you interested in training for MATHCOUNTS or AMC 10 contests? How would you like to train for these math competitions in half the time? We have accelerated sections which meet twice per week instead of once starting on July 8th (7:30pm ET). These sections fill quickly so enroll today!

[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC 10 Problem Series[/list]
For those interested in Olympiad level training in math, computer science, physics, and chemistry, be sure to enroll in our WOOT courses before August 19th to take advantage of early bird pricing!

Summer camps are starting this month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have a transformative summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following upcoming events:
[list][*]June 5th, Thursday, 7:30pm ET: Open Discussion with Ben Kornell and Andrew Sutherland, Art of Problem Solving's incoming CEO Ben Kornell and CPO Andrew Sutherland host an Ask Me Anything-style chat. Come ask your questions and get to know our incoming CEO & CPO!
[*]June 9th, Monday, 7:30pm ET, Game Jam: Operation Shuffle!, Come join us to play our second round of Operation Shuffle! If you enjoy number sense, logic, and a healthy dose of luck, this is the game for you. No specific math background is required; all are welcome.[/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29
Sunday, Aug 17 - Dec 14
Tuesday, Aug 26 - Dec 16
Friday, Sep 5 - Jan 16
Monday, Sep 8 - Jan 12
Tuesday, Sep 16 - Jan 20 (4:30 - 5:45 pm ET/1:30 - 2:45 pm PT)
Sunday, Sep 21 - Jan 25
Thursday, Sep 25 - Jan 29
Wednesday, Oct 22 - Feb 25
Tuesday, Nov 4 - Mar 10
Friday, Dec 12 - Apr 10

Prealgebra 2 Self-Paced

Prealgebra 2
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21
Sunday, Aug 17 - Dec 14
Tuesday, Sep 9 - Jan 13
Thursday, Sep 25 - Jan 29
Sunday, Oct 19 - Feb 22
Monday, Oct 27 - Mar 2
Wednesday, Nov 12 - Mar 18

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28
Sunday, Aug 17 - Dec 14
Wednesday, Aug 27 - Dec 17
Friday, Sep 5 - Jan 16
Thursday, Sep 11 - Jan 15
Sunday, Sep 28 - Feb 1
Monday, Oct 6 - Feb 9
Tuesday, Oct 21 - Feb 24
Sunday, Nov 9 - Mar 15
Friday, Dec 5 - Apr 3

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 2 - Sep 17
Sunday, Jul 27 - Oct 19
Monday, Aug 11 - Nov 3
Wednesday, Sep 3 - Nov 19
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Friday, Oct 3 - Jan 16
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30
Wednesday, Aug 13 - Oct 29
Friday, Sep 12 - Dec 12
Sunday, Oct 26 - Feb 1
Monday, Dec 1 - Mar 2

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14
Thursday, Aug 7 - Nov 20
Monday, Aug 18 - Dec 15
Sunday, Sep 7 - Jan 11
Thursday, Sep 11 - Jan 15
Wednesday, Sep 24 - Jan 28
Sunday, Oct 26 - Mar 1
Tuesday, Nov 4 - Mar 10
Monday, Dec 1 - Mar 30

Introduction to Geometry
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19
Wednesday, Aug 13 - Feb 11
Tuesday, Aug 26 - Feb 24
Sunday, Sep 7 - Mar 8
Thursday, Sep 11 - Mar 12
Wednesday, Sep 24 - Mar 25
Sunday, Oct 26 - Apr 26
Monday, Nov 3 - May 4
Friday, Dec 5 - May 29

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22
Friday, Aug 8 - Feb 20
Tuesday, Aug 26 - Feb 24
Sunday, Sep 28 - Mar 29
Wednesday, Oct 8 - Mar 8
Sunday, Nov 16 - May 17
Thursday, Dec 11 - Jun 4

Intermediate Counting & Probability
Sunday, Jun 22 - Nov 2
Sunday, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3
Wednesday, Sep 24 - Dec 17

Precalculus
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8
Wednesday, Aug 6 - Jan 21
Tuesday, Sep 9 - Feb 24
Sunday, Sep 21 - Mar 8
Monday, Oct 20 - Apr 6
Sunday, Dec 14 - May 31

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Wednesday, Jun 25 - Dec 17
Sunday, Sep 7 - Mar 15
Wednesday, Sep 24 - Apr 1
Friday, Nov 14 - May 22

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Wednesday, Sep 3 - Nov 19
Tuesday, Sep 16 - Dec 9
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Oct 6 - Jan 12
Thursday, Oct 16 - Jan 22
Tues, Thurs & Sun, Dec 9 - Jan 18 (meets three times a week!)

MATHCOUNTS/AMC 8 Advanced
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Tuesday, Aug 26 - Nov 11
Thursday, Sep 4 - Nov 20
Friday, Sep 12 - Dec 12
Monday, Sep 15 - Dec 8
Sunday, Oct 5 - Jan 11
Tues, Thurs & Sun, Dec 2 - Jan 11 (meets three times a week!)
Mon, Wed & Fri, Dec 8 - Jan 16 (meets three times a week!)

AMC 10 Problem Series
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 10 - Nov 2
Thursday, Aug 14 - Oct 30
Tuesday, Aug 19 - Nov 4
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Mon, Wed & Fri, Oct 6 - Nov 3 (meets three times a week!)
Tue, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 10 Final Fives
Monday, Jun 30 - Jul 21
Friday, Aug 15 - Sep 12
Sunday, Sep 7 - Sep 28
Tuesday, Sep 9 - Sep 30
Monday, Sep 22 - Oct 13
Sunday, Sep 28 - Oct 19 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, Oct 8 - Oct 29
Thursday, Oct 9 - Oct 30

AMC 12 Problem Series
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22
Sunday, Aug 10 - Nov 2
Monday, Aug 18 - Nov 10
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Tues, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 12 Final Fives
Thursday, Sep 4 - Sep 25
Sunday, Sep 28 - Oct 19
Tuesday, Oct 7 - Oct 28

AIME Problem Series A
Thursday, Oct 23 - Jan 29

AIME Problem Series B
Sunday, Jun 22 - Sep 21
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
Wednesday, Jun 11 - Aug 27
Tuesday, Sep 16 - Dec 9
Friday, Oct 17 - Jan 30

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22
Thursday, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22
Friday, Oct 3 - Jan 16

USACO Bronze Problem Series
Sunday, Jun 22 - Sep 1
Wednesday, Sep 3 - Dec 3
Thursday, Oct 30 - Feb 5
Tuesday, Dec 2 - Mar 3

Physics

Introduction to Physics
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Monday, Jun 23 - Dec 15
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Jun 2, 2025
0 replies
k i A Letter to MSM
Arr0w   23
N Sep 19, 2022 by scannose
Greetings.

I have seen many posts talking about commonly asked questions, such as finding the value of $0^0$, $\frac{1}{0}$,$\frac{0}{0}$, $\frac{\infty}{\infty}$, why $0.999...=1$ or even expressions of those terms combined as if that would make them defined. I have made this post to answer these questions once and for all, and I politely ask everyone to link this post to threads that are talking about this issue.
[list]
[*]Firstly, the case of $0^0$. It is usually regarded that $0^0=1$, not because this works numerically but because it is convenient to define it this way. You will see the convenience of defining other undefined things later on in this post.

[*]What about $\frac{\infty}{\infty}$? The issue here is that $\infty$ isn't even rigorously defined in this expression. What exactly do we mean by $\infty$? Unless the example in question is put in context in a formal manner, then we say that $\frac{\infty}{\infty}$ is meaningless.

[*]What about $\frac{1}{0}$? Suppose that $x=\frac{1}{0}$. Then we would have $x\cdot 0=0=1$, absurd. A more rigorous treatment of the idea is that $\lim_{x\to0}\frac{1}{x}$ does not exist in the first place, although you will see why in a calculus course. So the point is that $\frac{1}{0}$ is undefined.

[*]What about if $0.99999...=1$? An article from brilliant has a good explanation. Alternatively, you can just use a geometric series. Notice that
\begin{align*}
\sum_{n=1}^{\infty} \frac{9}{10^n}&=9\sum_{n=1}^{\infty}\frac{1}{10^n}=9\sum_{n=1}^{\infty}\biggr(\frac{1}{10}\biggr)^n=9\biggr(\frac{\frac{1}{10}}{1-\frac{1}{10}}\biggr)=9\biggr(\frac{\frac{1}{10}}{\frac{9}{10}}\biggr)=9\biggr(\frac{1}{9}\biggr)=\boxed{1}
\end{align*}
[*]What about $\frac{0}{0}$? Usually this is considered to be an indeterminate form, but I would also wager that this is also undefined.
[/list]
Hopefully all of these issues and their corollaries are finally put to rest. Cheers.

2nd EDIT (6/14/22): Since I originally posted this, it has since blown up so I will try to add additional information per the request of users in the thread below.

INDETERMINATE VS UNDEFINED

What makes something indeterminate? As you can see above, there are many things that are indeterminate. While definitions might vary slightly, it is the consensus that the following definition holds: A mathematical expression is be said to be indeterminate if it is not definitively or precisely determined. So how does this make, say, something like $0/0$ indeterminate? In analysis (the theory behind calculus and beyond), limits involving an algebraic combination of functions in an independent variable may often be evaluated by replacing these functions by their limits. However, if the expression obtained after this substitution does not provide sufficient information to determine the original limit, then the expression is called an indeterminate form. For example, we could say that $0/0$ is an indeterminate form.

But we need to more specific, this is still ambiguous. An indeterminate form is a mathematical expression involving at most two of $0$, $1$ or $\infty$, obtained by applying the algebraic limit theorem (a theorem in analysis, look this up for details) in the process of attempting to determine a limit, which fails to restrict that limit to one specific value or infinity, and thus does not determine the limit being calculated. This is why it is called indeterminate. Some examples of indeterminate forms are
\[0/0, \infty/\infty, \infty-\infty, \infty \times 0\]etc etc. So what makes something undefined? In the broader scope, something being undefined refers to an expression which is not assigned an interpretation or a value. A function is said to be undefined for points outside its domain. For example, the function $f:\mathbb{R}^{+}\cup\{0\}\rightarrow\mathbb{R}$ given by the mapping $x\mapsto \sqrt{x}$ is undefined for $x<0$. On the other hand, $1/0$ is undefined because dividing by $0$ is not defined in arithmetic by definition. In other words, something is undefined when it is not defined in some mathematical context.

WHEN THE WATERS GET MUDDIED

So with this notion of indeterminate and undefined, things get convoluted. First of all, just because something is indeterminate does not mean it is not undefined. For example $0/0$ is considered both indeterminate and undefined (but in the context of a limit then it is considered in indeterminate form). Additionally, this notion of something being undefined also means that we can define it in some way. To rephrase, this means that technically, we can make something that is undefined to something that is defined as long as we define it. I'll show you what I mean.

One example of making something undefined into something defined is the extended real number line, which we define as
\[\overline{\mathbb{R}}=\mathbb{R}\cup \{-\infty,+\infty\}.\]So instead of treating infinity as an idea, we define infinity (positively and negatively, mind you) as actual numbers in the reals. The advantage of doing this is for two reasons. The first is because we can turn this thing into a totally ordered set. Specifically, we can let $-\infty\le a\le \infty$ for each $a\in\overline{\mathbb{R}}$ which means that via this order topology each subset has an infimum and supremum and $\overline{\mathbb{R}}$ is therefore compact. While this is nice from an analytic standpoint, extending the reals in this way can allow for interesting arithmetic! In $\overline{\mathbb{R}}$ it is perfectly OK to say that,
\begin{align*}
a + \infty = \infty + a & = \infty, & a & \neq -\infty \\
a - \infty = -\infty + a & = -\infty, & a & \neq \infty \\
a \cdot (\pm\infty) = \pm\infty \cdot a & = \pm\infty, & a & \in (0, +\infty] \\
a \cdot (\pm\infty) = \pm\infty \cdot a & = \mp\infty, & a & \in [-\infty, 0) \\
\frac{a}{\pm\infty} & = 0, & a & \in \mathbb{R} \\
\frac{\pm\infty}{a} & = \pm\infty, & a & \in (0, +\infty) \\
\frac{\pm\infty}{a} & = \mp\infty, & a & \in (-\infty, 0).
\end{align*}So addition, multiplication, and division are all defined nicely. However, notice that we have some indeterminate forms here which are also undefined,
\[\infty-\infty,\frac{\pm\infty}{\pm\infty},\frac{\pm\infty}{0},0\cdot \pm\infty.\]So while we define certain things, we also left others undefined/indeterminate in the process! However, in the context of measure theory it is common to define $\infty \times 0=0$ as greenturtle3141 noted below. I encourage to reread what he wrote, it's great stuff! As you may notice, though, dividing by $0$ is undefined still! Is there a place where it isn't? Kind of. To do this, we can extend the complex numbers! More formally, we can define this extension as
\[\mathbb{C}^*=\mathbb{C}\cup\{\tilde{\infty}\}\]which we call the Riemann Sphere (it actually forms a sphere, pretty cool right?). As a note, $\tilde{\infty}$ means complex infinity, since we are in the complex plane now. Here's the catch: division by $0$ is allowed here! In fact, we have
\[\frac{z}{0}=\tilde{\infty},\frac{z}{\tilde{\infty}}=0.\]where $\tilde{\infty}/\tilde{\infty}$ and $0/0$ are left undefined. We also have
\begin{align*}
z+\tilde{\infty}=\tilde{\infty}, \forall z\ne -\infty\\
z\times \tilde{\infty}=\tilde{\infty}, \forall z\ne 0
\end{align*}Furthermore, we actually have some nice properties with multiplication that we didn't have before. In $\mathbb{C}^*$ it holds that
\[\tilde{\infty}\times \tilde{\infty}=\tilde{\infty}\]but $\tilde{\infty}-\tilde{\infty}$ and $0\times \tilde{\infty}$ are left as undefined (unless there is an explicit need to change that somehow). One could define the projectively extended reals as we did with $\mathbb{C}^*$, by defining them as
\[{\widehat {\mathbb {R} }}=\mathbb {R} \cup \{\infty \}.\]They behave in a similar way to the Riemann Sphere, with division by $0$ also being allowed with the same indeterminate forms (in addition to some other ones).
23 replies
Arr0w
Feb 11, 2022
scannose
Sep 19, 2022
k i Marathon Threads
LauraZed   0
Jul 2, 2019
Due to excessive spam and inappropriate posts, we have locked the Prealgebra and Beginning Algebra threads.

We will either unlock these threads once we've cleaned them up or start new ones, but for now, do not start new marathon threads for these subjects. Any new marathon threads started while this announcement is up will be immediately deleted.
0 replies
LauraZed
Jul 2, 2019
0 replies
k i Basic Forum Rules and Info (Read before posting)
jellymoop   368
N May 16, 2018 by harry1234
f (Reminder: Do not post Alcumus or class homework questions on this forum. Instructions below.) f
Welcome to the Middle School Math Forum! Please take a moment to familiarize yourself with the rules.

Overview:
[list]
[*] When you're posting a new topic with a math problem, give the topic a detailed title that includes the subject of the problem (not just "easy problem" or "nice problem")
[*] Stay on topic and be courteous.
[*] Hide solutions!
[*] If you see an inappropriate post in this forum, simply report the post and a moderator will deal with it. Don't make your own post telling people they're not following the rules - that usually just makes the issue worse.
[*] When you post a question that you need help solving, post what you've attempted so far and not just the question. We are here to learn from each other, not to do your homework. :P
[*] Avoid making posts just to thank someone - you can use the upvote function instead
[*] Don't make a new reply just to repeat yourself or comment on the quality of others' posts; instead, post when you have a new insight or question. You can also edit your post if it's the most recent and you want to add more information.
[*] Avoid bumping old posts.
[*] Use GameBot to post alcumus questions.
[*] If you need general MATHCOUNTS/math competition advice, check out the threads below.
[*] Don't post other users' real names.
[*] Advertisements are not allowed. You can advertise your forum on your profile with a link, on your blog, and on user-created forums that permit forum advertisements.
[/list]

Here are links to more detailed versions of the rules. These are from the older forums, so you can overlook "Classroom math/Competition math only" instructions.
Posting Guidelines
Update on Basic Forum Rules
What belongs on this forum?
How do I write a thorough solution?
How do I get a problem on the contest page?
How do I study for mathcounts?
Mathcounts FAQ and resources
Mathcounts and how to learn

As always, if you have any questions, you can PM me or any of the other Middle School Moderators. Once again, if you see spam, it would help a lot if you filed a report instead of responding :)

Marathons!
Relays might be a better way to describe it, but these threads definitely go the distance! One person starts off by posting a problem, and the next person comes up with a solution and a new problem for another user to solve. Here's some of the frequently active marathons running in this forum:
[list][*]Algebra
[*]Prealgebra
[*]Proofs
[*]Factoring
[*]Geometry
[*]Counting & Probability
[*]Number Theory[/list]
Some of these haven't received attention in a while, but these are the main ones for their respective subjects. Rather than starting a new marathon, please give the existing ones a shot first.

You can also view marathons via the Marathon tag.

Think this list is incomplete or needs changes? Let the mods know and we'll take a look.
368 replies
jellymoop
May 8, 2015
harry1234
May 16, 2018
Bugs Bunny at it again
Rijul saini   8
N 14 minutes ago by quantam13
Source: LMAO 2025 Day 2 Problem 1
Bugs Bunny wants to choose a number $k$ such that every collection of $k$ consecutive positive integers contains an integer whose sum of digits is divisible by $2025$.

Find the smallest positive integer $k$ for which he can do this, or prove that none exist.

Proposed by Saikat Debnath and MV Adhitya
8 replies
Rijul saini
Wednesday at 7:01 PM
quantam13
14 minutes ago
The Bank of Bath
TelMarin   101
N 29 minutes ago by monval
Source: IMO 2019, problem 5
The Bank of Bath issues coins with an $H$ on one side and a $T$ on the other. Harry has $n$ of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly $k>0$ coins showing $H$, then he turns over the $k$th coin from the left; otherwise, all coins show $T$ and he stops. For example, if $n=3$ the process starting with the configuration $THT$ would be $THT \to HHT  \to HTT \to TTT$, which stops after three operations.

(a) Show that, for each initial configuration, Harry stops after a finite number of operations.

(b) For each initial configuration $C$, let $L(C)$ be the number of operations before Harry stops. For example, $L(THT) = 3$ and $L(TTT) = 0$. Determine the average value of $L(C)$ over all $2^n$ possible initial configurations $C$.

Proposed by David Altizio, USA
101 replies
TelMarin
Jul 17, 2019
monval
29 minutes ago
Intersections and concyclic points
Lukaluce   2
N 30 minutes ago by AylyGayypow009
Source: 2025 Junior Macedonian Mathematical Olympiad P2
Let $B_1$ be the foot of the altitude from the vertex $B$ in the acute-angled $\triangle ABC$. Let $D$ be the midpoint of side $AB$, and $O$ be the circumcentre of $\triangle ABC$. Line $B_1D$ meets line $CO$ at $E$. Prove that the points $B, C, B_1$, and $E$ lie on a circle.
2 replies
Lukaluce
May 18, 2025
AylyGayypow009
30 minutes ago
Calvin needs to cover all squares
Rijul saini   5
N 31 minutes ago by quantam13
Source: India IMOTC 2025 Day 2 Problem 1
Consider a $2025\times 2025$ board where we identify the squares with pairs $(i,j)$ where $i$ and $j$ denote the row and column number of that square, respectively.

Calvin picks two positive integers $a,b<2025$ and places a pawn at the bottom left corner (i.e. on $(1,1)$) and makes the following moves. In his $k$-th move, he moves the pawn from $(i,j)$ to either $(i+a,j)$ or $(i,j+a)$ if $k$ is odd and to either $(i+b,j)$ and $(i,j+b)$ if $k$ is even. Here all the numbers are taken modulo $2025$. Find the number of pairs $(a,b)$ that Calvin could have picked such that he can make moves so that the pawn covers all the squares on the board without being on any square twice.

Proposed by Tejaswi Navilarekallu
5 replies
1 viewing
Rijul saini
Wednesday at 6:35 PM
quantam13
31 minutes ago
9 How orz are you? (not troll)
pingpongmerrily   64
N 2 hours ago by Yihangzh
Before voting, please look at the AoPS competition ratings. Your skill level is defined as the hardest level of question you can consistently solve correctly. I have enabled revoting, so you can change your vote after you improve. This is to approximately gauge the orzness of the AoPS community.
I voted 4 lol.
64 replies
pingpongmerrily
Yesterday at 2:13 PM
Yihangzh
2 hours ago
hi guys.
unicornix   2
N 2 hours ago by ohiorizzler1434
if x=(69^2+69)/69 & y=69(x+1)/69-2 then wut is y
2 replies
unicornix
Yesterday at 11:36 PM
ohiorizzler1434
2 hours ago
Problem of the week
evt917   62
N 3 hours ago by nxchman
Whenever possible, I will be posting problems randomly! They will be roughly of AMC 8 difficulty. Have fun solving! Also, these problems are all written by myself!

Also occasionally I may also post theorems that I recently learned, or already knew about.

First problem:

$20^{16}$ has how many digits?
62 replies
evt917
Mar 5, 2025
nxchman
3 hours ago
9 Favorite topic
A7456321   49
N 3 hours ago by K124659
What is your favorite math topic/subject?

If you don't know why you are here, go binge watch something!

If you forgot why you are here, go to a hospital! :)

If you know why you are here and have voted, maybe say why you picked the option that you picked in a response) :thumbup:

if ur here for any reason whatsoever, CLICK ME YOU KNOW YOU WANT TO
Timeline
49 replies
A7456321
May 23, 2025
K124659
3 hours ago
Trouble focusing
GallopingUnicorn45   18
N 5 hours ago by LXC007
Hi all,

So I'm currently hard-grinding for AIME in AMC 10 this year (I'm taking both A and B) and I'm having a hard time focusing and my productivity is slipping; I can't finish all of the stuff I plan daily and weekly. Before, during the school year, I was also grinding and listening to K-pop while working, and now I have songs stuck in my head as I work, which also makes me unable to focus.

Any tips on how to concentrate for longer periods of time? Thanks!
18 replies
GallopingUnicorn45
Jun 2, 2025
LXC007
5 hours ago
The daily problem!
Leeoz   220
N Yesterday at 11:18 PM by Yihangzh
Every day, I will try to post a new problem for you all to solve! If you want to post a daily problem, you can! :)

Please hide solutions and answers, hints are fine though! :)

Problems usually get harder throughout the week, so Sunday is the easiest and Saturday is the hardest!

Past Problems!
220 replies
Leeoz
Mar 21, 2025
Yihangzh
Yesterday at 11:18 PM
Another Nice Geo Problem
Rice_Farmer   1
N Yesterday at 10:50 PM by Aaronjudgeisgoat
In parallelogram $ABCD, AB=13,BC=14,$ and the distance between $\overline{AD}$ and $\overline{BC}$ is $12.$ Point $E$ lies on $\overline{BD}$ such that $\angle{ECB}=90^\circ.$ What is $CE?$
1 reply
Rice_Farmer
Yesterday at 10:01 PM
Aaronjudgeisgoat
Yesterday at 10:50 PM
Nice Geo Problem
Rice_Farmer   0
Yesterday at 10:00 PM
$ABCD$ is a quadrilateral with $BA=BC,DA=DA,AC=10,$ and $BD=18.O$ is the circumcenter of $\triangle{ABD}.$ If $\angle{ACO}=90^\circ,$ what is $CO?$
0 replies
Rice_Farmer
Yesterday at 10:00 PM
0 replies
Area of Polygon
AIME15   58
N Yesterday at 8:27 PM by Yihangzh
The area of polygon $ ABCDEF$, in square units, is

IMAGE

\[ \textbf{(A)}\ 24 \qquad
\textbf{(B)}\ 30 \qquad
\textbf{(C)}\ 46 \qquad
\textbf{(D)}\ 66 \qquad
\textbf{(E)}\ 74
\]
58 replies
AIME15
Jan 12, 2009
Yihangzh
Yesterday at 8:27 PM
An annoying math problem
Wolfpierce   10
N Yesterday at 8:20 PM by Capybara7017
Okay so what is 2/((√3+1)((3 to the 1/4)+1)((3 to the 1/8)+1)((3 to the 1/16)+1)) to the power of 32?
10 replies
Wolfpierce
Yesterday at 12:17 AM
Capybara7017
Yesterday at 8:20 PM
EGMO magic square
Lukaluce   17
N Jun 3, 2025 by HamstPan38825
Source: EGMO 2025 P6
In each cell of a $2025 \times 2025$ board, a nonnegative real number is written in such a way that the sum of the numbers in each row is equal to $1$, and the sum of the numbers in each column is equal to $1$. Define $r_i$ to be the largest value in row $i$, and let $R = r_1 + r_2 + ... + r_{2025}$. Similarly, define $c_i$ to be the largest value in column $i$, and let $C = c_1 + c_2 + ... + c_{2025}$.
What is the largest possible value of $\frac{R}{C}$?

Proposed by Paulius Aleknavičius, Lithuania, and Anghel David Andrei, Romania
17 replies
Lukaluce
Apr 14, 2025
HamstPan38825
Jun 3, 2025
EGMO magic square
G H J
G H BBookmark kLocked kLocked NReply
Source: EGMO 2025 P6
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Lukaluce
274 posts
#1 • 4 Y
Y by RainbowJessa, radian_51, farhad.fritl, dangerousliri
In each cell of a $2025 \times 2025$ board, a nonnegative real number is written in such a way that the sum of the numbers in each row is equal to $1$, and the sum of the numbers in each column is equal to $1$. Define $r_i$ to be the largest value in row $i$, and let $R = r_1 + r_2 + ... + r_{2025}$. Similarly, define $c_i$ to be the largest value in column $i$, and let $C = c_1 + c_2 + ... + c_{2025}$.
What is the largest possible value of $\frac{R}{C}$?

Proposed by Paulius Aleknavičius, Lithuania, and Anghel David Andrei, Romania
This post has been edited 2 times. Last edited by Lukaluce, Apr 29, 2025, 10:37 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
aaaa_27
4 posts
#2 • 1 Y
Y by RainbowJessa
2 combi in a day?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
R8kt
303 posts
#3 • 30 Y
Y by BR1F1SZ, oVlad, alexanderhamilton124, GuvercinciHoca, Ciobi_, Assassino9931, megarnie, Triangle_Center, Kimchiks926, chirita.andrei, qwedsazxc, EpicBird08, EeEeRUT, CerealCipher, RainbowJessa, Sedro, khina, ihatemath123, Miquel-point, Yiyj1, aidan0626, farhad.fritl, Rox_, RaduAndreiLecoiu, MuhammadAmmar, ZVFrozel, paintingredflagsgreen3761, math_comb01, qlip, WildFitBrain
This problem was created by me (Paulius Aleknavičius, Lithuania) and a fitting official solution was provided by the one and only David-Andrei Anghel (Romania). Hard to believe two of my problems made EGMO this year (P1 and P6)! I hope you guys enjoyed them.
This post has been edited 1 time. Last edited by R8kt, Apr 14, 2025, 12:02 PM
Reason: .
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DottedCaculator
7357 posts
#4 • 5 Y
Y by EeEeRUT, khina, qwedsazxc, radian_51, aidan0626
The largest possible value of $\frac RC$ is $\frac{2025}{89}$. For the construction, partition the left $45$ columns into $45\times45$ squares, and put $\frac1{45}$ in each of the main diagonals of the squares and $0$s elsewhere in those squares. Fill the rest of the board with $\frac1{2025}$. Then, $R=45$ and $C=1+\frac{1980}{2025}=\frac{89}{45}$, so $\frac RC=\frac{2025}{89}$.

Now, we show $\frac RC\leq\frac{2025}{89}$. For each row, circle the largest number in the row. Then, let $a_i$ be the number of circles in column $i$ and let $s_i$ be the sum of the circles in column $i$. Then, we can pick $C\geq\sum_{a_i>0}\left(\frac{s_i}{a_i}-\frac1{2025}\right)+1$. By AM-GM, $\frac{s_i}{a_i}\geq-\frac1{2025}a_i+\frac2{45}\sqrt{s_i}$, so
\begin{align*}
C&\geq\sum_{a_i>0}\left(-\frac1{2025}a_i+\frac2{45}\sqrt{s_i}-\frac1{2025}\right)+1\\
&=\sum_{a_i>0}\left(\frac2{45}\sqrt{s_i}-\frac1{2025}\right)\\
&\geq\sum_{a_i>0}\frac{89}{2025}s_i\\
&=\frac{89}{2025}R,
\end{align*}as $\frac2{45}\sqrt{s_i}-\frac1{2025}\geq\frac{89}{2025}s_i$ is equivalent to $(\sqrt{s_i}-1)(89\sqrt{s_i}-1)\leq0$ since each circled number must be at least $\frac1{2025}$. Therefore, $\frac RC\leq\frac{2025}{89}$.
This post has been edited 2 times. Last edited by DottedCaculator, Apr 14, 2025, 2:16 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Polyquadratus
4 posts
#5 • 5 Y
Y by Triangle_Center, R8kt, oVlad, Yiyj1, aidan0626
R8kt wrote:
This problem was created by me (Paulius Aleknavičius, Lithuania) and a fitting official solution was provided by the one and only David-Andrei Anghel (Romania). Hard to believe two of my problems made EGMO this year (P1 and P6)! I hope you guys enjoyed them.

I <3 David Andrei Anghel
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
oVlad
1746 posts
#6 • 11 Y
Y by khina, Triangle_Center, chirita.andrei, Yiyj1, aidan0626, Ciobi_, farhad.fritl, SomeonesPenguin, paintingredflagsgreen3761, ravengsd, Double07
Polyquadratus wrote:
R8kt wrote:
This problem was created by me (Paulius Aleknavičius, Lithuania) and a fitting official solution was provided by the one and only David-Andrei Anghel (Romania). Hard to believe two of my problems made EGMO this year (P1 and P6)! I hope you guys enjoyed them.

I <3 David Andrei Anghel

Back off he's mine.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Euclid9876
5 posts
#7
Y by
Did anyone solve this in the actual competition?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
YaoAOPS
1549 posts
#8 • 1 Y
Y by radian_51
We claim the answer is $\frac{R}{C} = \frac{2025}{89}$.

Construction: Divide the board into a $2025 \times 45$ rectangle with $45$ columns and a $2025 \times 2020$ rectangle. Fill the $2025 \times 2020$ rectangle with all $\frac{1}{2025}$, and fill the $2025 \times 45$ with $2025$ occurences of $\frac{1}{45}$ with $45$ occurences per column and one per row. Then
\[
	\frac{R}{C} = \frac{2025 \cdot \frac{1}{45}}{45 \cdot \frac{1}{45} + \frac{2025 - 45}{45}} = \frac{2025}{89}
\]
Bound: Color the largest cell in each row red, breaking ties arbitrarily.

Claim: We may assume that two red cells in the same column have the same value.
Proof: Replace both rows with their average, $R$ remains the same and $C$ remains the same or decreases. $\blacksquare$

Now, WLOG let the red cells be in columns $1$ through $i$ with $a_i$ in the $i$th column. We then have that $a_1 + a_2 + \dots + a_i = 2025$. Note that the red cells in the $i$th column have value at most $\frac{1}{2025} \le r_i \le \frac{1}{a_i}$. Let $N = \frac{2025}{89}$. We then want to show that
\[
	a_1r_1 + a_2r_2 + \dots + a_ir_i \le N \cdot \left(r_1 + r_2 + r_3 + \dots + \frac{2025 - i}{2025}\right)
\]This is tightest when the $a_i < N$ have $r_i = \frac{1}{2025}$ and the $a_i > N$ have $r_i = \frac{1}{a_i}$. We can thus rewrite this as
\[
	j + \frac{t}{2025} \le N \cdot \left(\frac{1}{a_1} + \dots + \frac{1}{a_j} + \frac{i-j}{2025} + \frac{2025 - i}{2025}\right)
\]where $a_1 + \dots + a_j = 2025 - t$. Since $t \ge i-j \ge \frac{t}{N}$, this becomes
\[
	\frac{j}{N} \le \frac{1}{a_1} + \dots + \frac{1}{a_j} + \frac{2025 - i}{2025}
\]which with AM-HM and applying $t \ge i-j$ becomes
\[
	\frac{j}{N} \le \frac{j^2}{a+j} + \frac{a}{2025}
\]with $a \le 2025-j$. The RHS is minimized at $a = 44j$ as the only root. If $j \le 45$, this is tightest at $a = 44j$ and becomes
\[
	\frac{j}{N} \le \frac{j^2}{45j} + \frac{44j}{2025} \iff
	\frac{89j}{2025} \le \frac{45j}{2025j} + \frac{44j}{2025}
\]which holds. If $j \ge 45$, this becomes
\[
	\frac{j}{N} \le \frac{j^2}{2025} + \frac{2025-j}{2025} \iff 
    89j \le j^2 + 2025 - j \iff (j-45)^2 \ge 0 
\]which holds.
This post has been edited 3 times. Last edited by YaoAOPS, Apr 14, 2025, 8:03 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Yiyj1
1278 posts
#9
Y by
Polyquadratus wrote:
R8kt wrote:
This problem was created by me (Paulius Aleknavičius, Lithuania) and a fitting official solution was provided by the one and only David-Andrei Anghel (Romania). Hard to believe two of my problems made EGMO this year (P1 and P6)! I hope you guys enjoyed them.

I <3 David Andrei Anghel

who doesnt
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
cj13609517288
1930 posts
#10
Y by
This is not a "complete" solution (I used WolframAlpha because I wasn't sure if my algebra would finish), but I will post it for storage.

https://manifold.markets/JiaheLiu/will-a-problem-on-the-2025-imo-nont#r0bnhtwdgy moment

Replace $2025$ with $n^2$. The answer is $\boxed{\frac{n^2}{2n-1}}$, achieved by generalizing the following example for $n=2$ (everything should be divided by $4$):

2011
2011
0211
0211

Now for the proof, consider the scorer for each row, and rearrange the rows and columns so that the scorers are "sorted", like so:

X???
X???
?X??
??X?

Say there are $\ell$ columns that contains scorers. Note that the non-scorers in a column with more than $\frac{n^2}{2n-1}$ scorers should be distributed to the scorers to maximize the ratio, the converse is true (distribute among non-scorers if there aren't enough scorers).

After a lot of algebra, eventually it turns out that we want to prove
\[\frac{n^2a+n^2-s}{n^2-a+\frac{n^2a^2}{s}}\le\frac{n^2}{2n-1}.\]After more bashing, we realize that this is optimized when $a=\frac{n}{s}$, and eventually we get that this inequality is true. $\blacksquare$
This post has been edited 1 time. Last edited by cj13609517288, Apr 14, 2025, 8:44 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathLuis
1562 posts
#11 • 1 Y
Y by MS_asdfgzxcvb
Give all cells that contain some *uniquely chosen* value from the $r_i$'s the yellow color, now on each column $i$ consider $s_i$ the sum of values of yellow cells and let $y_i$ the number of yellow cells it has.
Notice from the maximun condition we must have that each $c_i$ is greater than $\frac{1}{2025}$ but obviously this won't always be sharp so in order to make the relevant info above more useful we will take in consideration the existence of the yellow cells and the thing mentioned above to get that $C \ge \sum_{y_i>0} \left(\frac{s_i}{y_i}-\frac{1}{2025} \right)+1$ and all we want is for this to be in terms of $s_i$ only as $R=\sum_{y_i>0} s_i$ is trivially true by double counting so now we will split sum of $y_i$'s and $s_i$'s by using AM-GM as it is true that $\frac{s_i}{y_i}+\frac{y_i}{2025} \ge \frac{2}{45} \cdot \sqrt{s_i}$ and therefore $C \ge \sum_{y_i>0} \left(\frac{2}{45} \cdot \sqrt{s_i}-\frac{y_i}{2025}-\frac{1}{2025} \right)+1=\frac{2}{45} \cdot \left( \sum_{y_i>0} \sqrt{s_i}-\frac{1}{90} \right)$ And now here we need $s_i$ to show up again in a way we can get rid of the square roots, notice that each $s_i \ge \frac{1}{2025}$ and thus $\sqrt{s_i} \ge \frac{1}{45}$ but also trivially $1 \ge \sqrt{s_i}$ which should lead to picking $(\sqrt{s_i}-1)(k\sqrt{s_i}-1) \le 0$ for some $k \ge 45$, now expanding this gives $ks_i-(k+1)\sqrt{s_i}+1 \le 0$ and therefore $ks_i+1 \le (k+1)\sqrt{s_i}$ so our pick here will be $k=89$ to get rid of each $\frac{1}{90}$ in which case we get that $\sqrt{s_i}-\frac{1}{90} \ge \frac{89s_i}{90}$ this so that we don't have the need to summon each $y_i$ again...
And of course this gives $\frac{R}{C} \le \frac{2025}{89}$ so tracing back the equality this gives that in each of the columns where $y_i>0$ we have that the only nonzero cells are the ones in yellow, also from the AM-GM we have that $y_i=45$ if $y_i>0$ which means we must have exactly $45$ such rows, so as a construction consider the first 45 columns, and split the board in $45 \times 45$'s then on the first column of these place the $\frac{1}{45}$ on the same main diagonal with the same direction for each such $45 \times 45$ and the rest of cells must be zero, also from the first bound of $C$ we have followed acordingly all $s_i$'s to be equal which is why we picked $\frac{1}{45}$ but also notice equality happens when every other cell is $\frac{1}{2025}$ and thus that will be our construction, thus we are done :cool:.
This post has been edited 2 times. Last edited by MathLuis, Apr 15, 2025, 4:41 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AbbyWong
171 posts
#13
Y by
@R9182 ChatGPT gave me 2025 lol.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
YaoAOPS
1549 posts
#14 • 1 Y
Y by R9182
Unfortunately, the only charitable thing you can give the AI is that it found the construction.
R9182 wrote:
We now explain briefly why no doubly stochastic matrix can yield a larger value of \(\frac{R}{C}\). At the heart of the matter is the trade–off already discussed. If one tries to increase some row’s maximum beyond \(\frac{1}{45}\), then (since the sum of its row is 1) one must concentrate even more mass in a single entry. But then the column that “carries” that mass will have its maximum raised. In our construction the choice of “heavy” columns has been optimized: by “packing” exactly 45 large entries of size \(1/45\) in each such column, we guarantee that each heavy column carries the minimal possible maximum to serve 45 rows. (A short optimization shows that if one designates \(k\) columns to serve as the targets for high entries and distributes the mass evenly among them so that every heavy row gets exactly \(1/r\) in the column it uses, then one may obtain a ratio of
\[ \frac{n}{\,k+r-1}\,, \]with the constraint \(k\cdot r=n\). This expression is maximized when \(k=r=\sqrt{n}\); in our case \(\sqrt{2025}=45\), and the maximum value is exactly
\[ \frac{2025}{45+45-1}=\frac{2025}{89}\,. \])

A more “dual” formulation of the problem (via linear programming duality) leads to the same optimum. We omit the details for brevity.

This is nonsensical and does not go into actually proving the bound.
R9182 wrote:
A careful (and somewhat lengthy) verification shows that one may indeed “patch” the matrix so that all the doubly stochastic constraints are met. (There are several ways to complete the construction; one may view the process as “gluing” together an extreme point of the Birkhoff–von Neumann polytope on a \(45\times45\) block with the “flat” matrix on the remaining cells.)

Throwing the words Birkhoff–von Neumann around in a doubly stochastic matrix problem does not actually prove anything other than looking impressive.
R9182 wrote:
- If we partition the \(2025\) rows into \(k\) groups (with equal size, say) and have each group’s rows use a distinct column for their row–maximum, then in any column which is so chosen the column sum constraint forces the common maximum to be equal to the reciprocal of the group’s size.
- At the same time, by “filling in” the remaining cells very uniformly the maximum of every other column may be made as low as possible.

This is a highly nontrivial step and most of the problem's difficulty lies in proving this. Showing that these maximums are equal is also nontrivial.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
R9182
8 posts
#15
Y by
YaoAOPS wrote:
Unfortunately, the only charitable thing you can give the AI is that it found the construction.
R9182 wrote:
We now explain briefly why no doubly stochastic matrix can yield a larger value of \(\frac{R}{C}\). At the heart of the matter is the trade–off already discussed. If one tries to increase some row’s maximum beyond \(\frac{1}{45}\), then (since the sum of its row is 1) one must concentrate even more mass in a single entry. But then the column that “carries” that mass will have its maximum raised. In our construction the choice of “heavy” columns has been optimized: by “packing” exactly 45 large entries of size \(1/45\) in each such column, we guarantee that each heavy column carries the minimal possible maximum to serve 45 rows. (A short optimization shows that if one designates \(k\) columns to serve as the targets for high entries and distributes the mass evenly among them so that every heavy row gets exactly \(1/r\) in the column it uses, then one may obtain a ratio of
\[ \frac{n}{\,k+r-1}\,, \]with the constraint \(k\cdot r=n\). This expression is maximized when \(k=r=\sqrt{n}\); in our case \(\sqrt{2025}=45\), and the maximum value is exactly
\[ \frac{2025}{45+45-1}=\frac{2025}{89}\,. \])

A more “dual” formulation of the problem (via linear programming duality) leads to the same optimum. We omit the details for brevity.

This is nonsensical and does not go into actually proving the bound.
R9182 wrote:
A careful (and somewhat lengthy) verification shows that one may indeed “patch” the matrix so that all the doubly stochastic constraints are met. (There are several ways to complete the construction; one may view the process as “gluing” together an extreme point of the Birkhoff–von Neumann polytope on a \(45\times45\) block with the “flat” matrix on the remaining cells.)

Throwing the words Birkhoff–von Neumann around in a doubly stochastic matrix problem does not actually prove anything other than looking impressive.
R9182 wrote:
- If we partition the \(2025\) rows into \(k\) groups (with equal size, say) and have each group’s rows use a distinct column for their row–maximum, then in any column which is so chosen the column sum constraint forces the common maximum to be equal to the reciprocal of the group’s size.
- At the same time, by “filling in” the remaining cells very uniformly the maximum of every other column may be made as low as possible.

This is a highly nontrivial step and most of the problem's difficulty lies in proving this. Showing that these maximums are equal is also nontrivial.

Oh, thanks for the detailed analysis of the AI's attempt at this problem. It seems that AI is still far from actually being able to solve problems of this kind. I see what you're saying — it skipped the highly non-trivial and important steps without providing any proof.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Assassino9931
1390 posts
#16 • 1 Y
Y by sami1618
Both this problem and EGMO 2024 P6 are truly mathematically brilliant and have some research flavour. However, there goes once again of Problem 6 having no solution from a European country and barely any from all countries. People, please, if a competition has 6 problems, then really try to make it to have 6 problems. Day 1 was very well balanced, congrats to the PSC, and will remain a good example for aiming a balanced paper in the near and far future!
This post has been edited 3 times. Last edited by Assassino9931, Apr 16, 2025, 6:44 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Iveela
118 posts
#17 • 2 Y
Y by R9182, thdnder
@above I think we should view mathematical olympiads as a celebration of the beauty of mathematics rather than a test for university admissions and whatnot. That is not to say that having a balanced paper is unimportant, however including one very difficult but amazing problem does not take away from the quality of the contest. I think these problems excel in that respect. The same logic goes for problems like IMO 2023 P6 as well.
This post has been edited 4 times. Last edited by Iveela, Apr 19, 2025, 2:16 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
zRevenant
14 posts
#18
Y by
(Livesolved on YouTube: Art of Olympiad Mathematics)

Answer: $\frac{89}{2025}$.

Proof. For example, let's take rightmost $45$ columns and place $45$ fractions $\frac{1}{45}$ in $45$ squares in every column, such that no two are in the same row. In the rest of the columns we placed $\frac{1}{2025}$. This construction clearly works to give the answer $\frac{89}{2025}$.

For bound, let's mark all the cells that are biggest in a row $red$. Then, we suppose there are $k$ columns that have $red$ cells. Suppose there are exactly $x_1, x_2, ..., x_k$ numbers in those columns and the sum in each row is $a_1, a_2, ..., a_k$. Then, clearly $R=r_1+...+r_{2025} \le k$ because they are contained in $k$ columns. $C=c_1+...+c_{2025} \ge \frac{1}{2025} \cdot (2025-k) + \frac{a_1}{x_1} + ... + \frac{a_k}{x_k}$. In order to bound further, we can use Titu's lemma for when everything except for $x_i$'s is fixed, which yields that $a_i=t \cdot x_i$. Hence, we want to bound $\frac{2025t}{\frac{2025-k}{2025}+kt}$, which is greater or equal to $\frac{R}{C}$, which we continue by dividing both numerator and denominator by $t$. Now, we just have to bound $t$: $t=\frac{a_1+...+a_k}{x_1+...+x_k} \le \frac{k}{2025}$ which will get us to $\frac{R}{C} \le \frac{2025}{k+\frac{2025}{k}-1}$ which yields the needed answer.
This post has been edited 4 times. Last edited by zRevenant, Apr 23, 2025, 10:30 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HamstPan38825
8881 posts
#19
Y by
For a simple algebraic grid optimization, this problem is astoundingly difficult because it contains three nontrivial parts:
  • Figure out what the answer is;
  • Parametrize the row and column sums correctly, and
  • Carry through the algebra at the end properly.
I was unable to finish any one of these three steps completely on my own, let alone solve the problem, but I believe that in whole, each step is extremely instructive.

The answer is $\tfrac{2025}{89}$.

Construction: Generalize the following construction for $n=4$:
\[\begin{tabular}{c|c|c|c} $1/2$ & 0 & $1/4$ & $1/4$ \\ \hline
$1/2$ & 0 & $1/4$ & $1/4$ \\ \hline
0 & $1/2$ & $1/4$ & $1/4$ \\ \hline 
0 & $1/2$ & $1/4$ & $1/4$ \\
\end{tabular}\]In general, for an $n^2 \times n^2$ grid, we place fractions $\tfrac 1n$ in groups of $n$ (in the same column) in the first $n$ rows and fill the remaining $n^2-n$ columns with $\tfrac 1{n^2}$.

Bound: Replace $2025$ with $n$. We color a cell red if it is the cell with the largest number in its row; suppose that the red cells occupy $d$ distinct columns (without loss of generality columns $1, 2, \dots, d$), and suppose that there are $r_i$ red cells in column $i$, which sum to $s_i$.

It follows that there is a cell in column $i$ with value at least $\tfrac{r_i}{s_i}$, and hence
\begin{align*}
C &= 1 - \frac dn + \sum_{i=1}^d \frac{r_i}{s_i} \\
&\geq 1-\frac dn +\sum_{i=1}^d \left(\frac 2{\sqrt n} \sqrt{s_i} - \frac{r_i}n \right) \\
&= \sum_{i=1}^d \left(\frac 2{\sqrt n} \sqrt{s_i} - \frac 1n\right) \\
&\geq  \sum_{i=1}^d s_i \left(\frac 2{\sqrt n} - \frac 1n\right).
\end{align*}The first inequality follows by AM-GM, and the last follows by considering a quadratic in $\sqrt{s_i} \leq 1$. Hence \[\frac RC \leq \frac{\sum_{i=1}^d s_i}{\left(\frac 2{\sqrt n} - \frac 1n\right) \sum_{i=1}^d s_i} = \left(\frac 2{\sqrt n} -\frac 1n\right)^{-1} = \frac{2025}{89}\]when $n=2025$.
This post has been edited 1 time. Last edited by HamstPan38825, Jun 3, 2025, 3:55 AM
Z K Y
N Quick Reply
G
H
=
a