Stay ahead of learning milestones! Enroll in a class over the summer!

Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Apr 2, 2025
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. 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 events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 22nd (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/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, Apr 13 - Aug 10
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Monday, Apr 7 - Jul 28
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Apr 16 - Jul 2
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Thursday, Apr 17 - Jul 3
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Wednesday, Apr 23 - Oct 1
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Intermediate: Grades 8-12

Intermediate Algebra
Monday, Apr 21 - Oct 13
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

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Wednesday, Apr 16 - Jul 2
Friday, May 23 - Aug 15
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!)

MATHCOUNTS/AMC 8 Advanced
Friday, Apr 11 - Jun 27
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
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!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

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
Thursday, May 22 - Aug 7
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

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Apr 2, 2025
0 replies
MOP EMAILS OUT!!!
youlost_thegame_1434   27
N 5 minutes ago by mdk2013
CONGRATS TO EVERYONE WHO MADE IT!

IMAGE
27 replies
+5 w
youlost_thegame_1434
an hour ago
mdk2013
5 minutes ago
memorize your 60 120 degree triangles
OronSH   19
N 7 minutes ago by sadas123
Source: 2024 AMC 12A #19
Cyclic quadrilateral $ABCD$ has lengths $BC=CD=3$ and $DA=5$ with $\angle CDA=120^\circ$. What is the length of the shorter diagonal of $ABCD$?

$
\textbf{(A) }\frac{31}7 \qquad
\textbf{(B) }\frac{33}7 \qquad
\textbf{(C) }5 \qquad
\textbf{(D) }\frac{39}7 \qquad
\textbf{(E) }\frac{41}7 \qquad
$
19 replies
+3 w
OronSH
Nov 7, 2024
sadas123
7 minutes ago
centslordm
centslordm   48
N 4 hours ago by sadas123
Source: AIME II #8
From an unlimited supply of 1-cent coins, 10-cent coins, and 25-cent coins, Silas wants to find a collection of coins that has a total value of $N$ cents, where $N$ is a positive integer. He uses the so-called greedy algorithm, successively choosing the coin of greatest value that does not cause the value of his collection to exceed $N.$ For example, to get 42 cents, Silas will choose a 25-cent coin, then a 10-cent coin, then 7 1-cent coins. However, this collection of 9 coins uses more coins than necessary to get a total of 42 cents; indeed, choosing 4 10-cent coins and 2 1-cent coins achieves the same total value with only 6 coins. In general, the greedy algorithm succeeds for a given $N$ if no other collection of 1-cent, 10-cent, and 25-cent coins gives a total value of $N$ cents using strictly fewer coins than the collection given by the greedy algorithm. Find the number of values of $N$ between $1$ and $1000$ inclusive for which the greedy algorithm succeeds.
48 replies
centslordm
Feb 13, 2025
sadas123
4 hours ago
Catch those negatives
cappucher   44
N 5 hours ago by Apple_maths60
Source: 2024 AMC 10A P11
How many ordered pairs of integers $(m, n)$ satisfy $\sqrt{n^2 - 49} = m$?

$
\textbf{(A) }1 \qquad
\textbf{(B) }2 \qquad
\textbf{(C) }3 \qquad
\textbf{(D) }4 \qquad
\textbf{(E) } \text{Infinitely many} \qquad
$
44 replies
+1 w
cappucher
Nov 7, 2024
Apple_maths60
5 hours ago
No more topics!
Advice on Reading solutions
guptaamitu1   10
N Aug 7, 2022 by HamstPan38825
I was recently facing some problems regarding reading solutions. I have read some blogs of Evan Chen on that (1. For solution reading ; 2. General) and have got advice from some other expert people too. What I mainly understood is the following:

[rule]

It is not necessary to understand every possible solution to a problem. One should look at a solution only if it is
[list]
[*] fairly clean/short
[*] and idea behind it is very clever/unique
[/list]
In general looking at solutions posted by some famous people suffices. After reading a solution, one should mainly try to understand the key idea behind it, from which the rest of the solution could easily be reconstructed (called "crossing the ocean" thing by Evan). Sometimes a solution might seem long/messy but main idea/structure of it might be pretty neat. Also, it would be quite counter-productive if seeing the sol takes too much time, most of the gain still comes from attempting the questions on your own.

[rule]

But I have two doubts now:

1. Suppose I see a long solution. Then maybe I should first try to understand it properly, like understand all its arguments precisely. Then I should try to find the key idea behind the solution. But this process might take some time. Sometimes it might even take 20-30 minutes or so. So is this time worth spending? Since in general it is said that "It's going to be very counter-productive if seeing the sol takes too much time, most of the gain still comes from attempting the questions on your own."

2. Not all problems have official solution or some famous people posted solution to them. In that case mainly which solutions should I focus more on? Like the ones which seem shorter in length or ones which are on post #2? Of course the latter classification doesn't seem to be a nice idea. On the first classification, sometimes a long solution might have a short key idea and similarly, a short-looking solution might be harder to grasp.

[rule]

Two recent examples of doubt 1. are as follows:

[rule]

The following problem is Sharygin Finals 2018 Grade 10 P4


[quote=Sharygin Finals 2018 Grade 10 P4]We say that a finite set $S$ of red and green points in the plane is orderly if there exists a triangle $\delta$ such that all points of one colour lie strictly inside $\delta$ and all points of the other colour lie strictly outside of $\delta$. Let $A$ be a finite set of red and green points in the plane, in general position. Is it always true that if every $1000$ points in $A$ form a orderly set then $A$ is also orderly?[/quote]

Following is its official solution.

IMAGE
IMAGE
IMAGE
[rule]
The solution seems long and complicated. But after I read it, I understood that the overall idea behind it is quite clever. One doubt is the following:

Should I be trying to verify some of the facts written in the solution without proof, for example why the mentioned construction worked and why everything written in the following paragraph is true:
[rule]
IMAGE


[rule]


The second example is Sharygin Finals 2018 Grade 9 P8.
[quote=Sharygin Finals 2018 Grade 9 P8]Consider a fixed regular $n$-gon of unit side. When a second regular $n$-gon of unit size rolls around the first one, one of its vertices successively pinpoints the vertices of a closed broken line $\kappa$ as in the figure.

IMAGE

Let $A$ be the area of a regular $n$-gon of unit side, and let $B$ be the area of a regular $n$-gon of unit circumradius. Prove that the area enclosed by $\kappa$ equals $6A-2B$.[/quote]

Below is the official solution:

IMAGE
IMAGE
IMAGE
IMAGE
IMAGE
10 replies
guptaamitu1
Aug 4, 2022
HamstPan38825
Aug 7, 2022
Advice on Reading solutions
G H J
G H BBookmark kLocked kLocked NReply
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
guptaamitu1
656 posts
#1 • 4 Y
Y by truffle, HamstPan38825, samrocksnature, megarnie
I was recently facing some problems regarding reading solutions. I have read some blogs of Evan Chen on that (1. For solution reading ; 2. General) and have got advice from some other expert people too. What I mainly understood is the following:


It is not necessary to understand every possible solution to a problem. One should look at a solution only if it is
  • fairly clean/short
  • and idea behind it is very clever/unique
In general looking at solutions posted by some famous people suffices. After reading a solution, one should mainly try to understand the key idea behind it, from which the rest of the solution could easily be reconstructed (called "crossing the ocean" thing by Evan). Sometimes a solution might seem long/messy but main idea/structure of it might be pretty neat. Also, it would be quite counter-productive if seeing the sol takes too much time, most of the gain still comes from attempting the questions on your own.


But I have two doubts now:

1. Suppose I see a long solution. Then maybe I should first try to understand it properly, like understand all its arguments precisely. Then I should try to find the key idea behind the solution. But this process might take some time. Sometimes it might even take 20-30 minutes or so. So is this time worth spending? Since in general it is said that "It's going to be very counter-productive if seeing the sol takes too much time, most of the gain still comes from attempting the questions on your own."

2. Not all problems have official solution or some famous people posted solution to them. In that case mainly which solutions should I focus more on? Like the ones which seem shorter in length or ones which are on post #2? Of course the latter classification doesn't seem to be a nice idea. On the first classification, sometimes a long solution might have a short key idea and similarly, a short-looking solution might be harder to grasp.


Two recent examples of doubt 1. are as follows:


The following problem is Sharygin Finals 2018 Grade 10 P4

Sharygin Finals 2018 Grade 10 P4 wrote:
We say that a finite set $S$ of red and green points in the plane is orderly if there exists a triangle $\delta$ such that all points of one colour lie strictly inside $\delta$ and all points of the other colour lie strictly outside of $\delta$. Let $A$ be a finite set of red and green points in the plane, in general position. Is it always true that if every $1000$ points in $A$ form a orderly set then $A$ is also orderly?

Following is its official solution.

https://i.imgur.com/JxLS78a.png
https://i.imgur.com/xJxADW3.png
https://i.imgur.com/fKa0eRE.png
The solution seems long and complicated. But after I read it, I understood that the overall idea behind it is quite clever. One doubt is the following:

Should I be trying to verify some of the facts written in the solution without proof, for example why the mentioned construction worked and why everything written in the following paragraph is true:
https://i.imgur.com/YZMjMhd.png




The second example is Sharygin Finals 2018 Grade 9 P8.
Sharygin Finals 2018 Grade 9 P8 wrote:
Consider a fixed regular $n$-gon of unit side. When a second regular $n$-gon of unit size rolls around the first one, one of its vertices successively pinpoints the vertices of a closed broken line $\kappa$ as in the figure.

[asy]
int n=9;
draw(polygon(n));
for (int i = 0; i<n;++i) {
 draw(reflect(dir(360*i/n + 90), dir(360*(i+1)/n + 90))*polygon(n), dashed+linewidth(0.4));
 draw(reflect(dir(360*i/n + 90),dir(360*(i+1)/n + 90))*(0,1)--reflect(dir(360*(i-1)/n + 90),dir(360*i/n + 90))*(0,1), linewidth(1.2));
}
[/asy]

Let $A$ be the area of a regular $n$-gon of unit side, and let $B$ be the area of a regular $n$-gon of unit circumradius. Prove that the area enclosed by $\kappa$ equals $6A-2B$.

Below is the official solution:

https://i.imgur.com/1ZiHvKS.png
https://i.imgur.com/3kIZKOE.png
https://i.imgur.com/ffrbhdZ.png
https://i.imgur.com/Lm16LOY.png
https://i.imgur.com/hzreolk.png
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Math4Life7
1703 posts
#2 • 1 Y
Y by NegativeZeroPlusOne
as a person who is terrible at reading solutions and still decently okay at comp math. I think solution reading isn't too important you just need to understand the concept in one way or another not necesarrily through solutions tho
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
guptaamitu1
656 posts
#3 • 3 Y
Y by Mango247, Mango247, Mango247
Math4Life7 wrote:
as a person who is terrible at reading solutions and still decently okay at comp math.

My question was not regarding comp math. I meant to ask about olympiad math.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BakedPotato66
747 posts
#4
Y by
I guess one thing that could be helpful is watching video solutions (if those exist for olympiad math, for example, probably Evan Chen has some on his YT channel). bc I think video solutions are much easier to understand and follow along
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
anurag27826
93 posts
#5
Y by
BakedPotato66 wrote:
I guess one thing that could be helpful is watching video solutions (if those exist for olympiad math, for example, probably Evan Chen has some on his YT channel). bc I think video solutions are much easier to understand and follow along

Every oly problem doesn't have a video solution.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ZETA_in_olympiad
2211 posts
#6
Y by
guptaamitu1 wrote:
Math4Life7 wrote:
as a person who is terrible at reading solutions and still decently okay at comp math.

My question was not regarding comp math. I meant to ask about olympiad math.

Yeah, comp math can be computational. But according to me, still what M4L7 says it true.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HamstPan38825
8857 posts
#8 • 12 Y
Y by Bradygho, metricpaper, Mogmog8, eagles2018, peace09, guptaamitu1, akasht, ETS1331, eibc, rama1728, third_one_is_jerk, bestzack66
There's something which I like to call the Uncertainty Principle for olympiads. The interpretation, well, is taken quite literally.

Of course, much of this is based on (comparatively, scant) personal experience. But I think I've thought about this problem enough that I have a few things to say.
In fact, the continuum of your comfortability with any certain problem is more discrete than continuous. I will carry over Evan's notation, as it makes many things easier to explain.

Suppose we have a problem $P$.

First, I personally do not like it when $P$ is arbitrary. Note that everything that follows is cast under the uncertainty principle: the more you try to concretely classify a problem, the less you perceive the structure of it past a certain extent. There are essentially three classes of problems:
  • Exercises: spinoffs of a problem, which illustrate an obvious idea or principle. Textbook examples, theoretical illustrations, etc. also fall under this category.
  • Practices: the idea is essentially given (e.g. "practice on the use of projective transformations"), but the problems are likely full-fledged olympiad problems with their own developed structure.
  • Problems: an arbitrary problem about which you predetermine nothing before you see it. In other words, akin to actually solving olympiad problems.
The second category is by far the most important in training, by an overwhelming supermajority. I think Evan's 2013/2014 platitude posts are somewhat outdated: nowadays, the amount of resources, categorizations, structured books and handouts, etc. is growing exponentially. Capitalize off the work that has been done already for you. Don't do arbitrary problems all the time.
Of course, this is not actually directly related to the topic of solutions themselves, but it will be pivotal to my main point. First, let us consider the first category of problems.

This is the type of problem that either seems immediately trivial or it doesn't. As an example, say $P$ is a preliminary exercise in a book designed to introduce Hall's Marriage Lemma. A common misperception is as follows:
Misperception wrote:
I cannot really spend my time well on this problem because I know it is trivial by something and there will be nothing else to find.
This is totally false: the example of Hall is quite extreme, but this applies in many other places as well. You will learn something by thinking about a problem that would lead to a result $R$ without even coming close to finding $R$.

For example, if you have an idea, go down that path and just keep going until you get hopelessly stuck; then, if you have nowhere else to go, read the solution and learn about the proposed idea. You may not be able to make the connection why did I get stuck? immediately.

Some people like to note down literally every detail of every problem: okay, I got stuck on this problem, come back and review it in $n$ days and try to think about why I got stuck, or contriving some kind of reason to explain it. This is simply stupid: artificially synthesized intuition is an oxymoron. If you can immediately see why you got stuck, great! If not, well, keep your scratch work/notes somewhere, understand the correct solution (write it down), and move on.

Though I've explained this in the specific context of exercises, some of the above also applies to general problems and practices as well. Again, the uncertainty principle: there is never an explicit formula, and intuitive exceptions always override established systems of thought.
Now onto the second category; I think this is where I can begin to address your doubts explicitly. Much of the philosophy behind reading solutions is derived from the following principle, which is similar to the one I explained before:
principle wrote:
If any bit of non-concrete intuition is not obvious to you, it does not exist.
Suppose you're working on an angle chasing section of geometry and one of the solutions you find explains why we should construct the point $P$ because there is an incenter Miquel configuration hidden in the problem, yada yada, and they're acclaimed for making that observation, say on the AoPS thread.

If you've learned about this specific configuration before, and given the statement, you immediately realize you missed that, well, great! The point, though, is that what you're training yourself to do is angle chase in an arbitrary diagram correctly in an analytical fashion. If you don't know the configuration, well, it doesn't mean the problem is above you. In some sense, reading these solutions is actually detrimental, as I will demonstrate.

Let's use the same angle chasing problem with the construction of the point $P$, and say that there is a solution that is simply vanilla angle chasing (that also uses the construction). Assume further that you missed the construction, which was the key point and made all the other correct observations. Then, by reading the angle chasing solution, you find that you should have constructed $P$ because [insert specific *concrete* implications for angle chasing here; i.e. creates a cyclic quadrilateral, encompasses a concurrency, etc.]. You may not know exactly what the motivation was, but that's fine! If you immediately understood why constructing $P$ would solve the problem, your brain has automatically created an intuitive "picture" of the problem. If there exists another problem for which having the intuition of this problem will make it much easier, your brain *will* recognize something familiar. Pondering for 30 minutes over why is a complete waste of those 30 minutes.

Clean and short solutions are not exactly the best solutions. In fact, I have heard the following quote more than once:
Quote:
When written correctly, any inequality has a reasonable legible one-line solution.
There will always be weird solutions. Honorable mention that I have to include: spoilers for IMO 2001/2
I suppose it's a clever idea. No freaking way I'm coming up with that in contest though.

There is no objectively "better" solution. Your work may resemble that of a laughably overkill solution, or follow the lines of a remarkably inefficient one. At the end of the day, it doesn't matter. In some ways, there is a net gain with respect to time: it is easier to complete a 1000-piece puzzle with 250 pieces missing than it is to complete a 250-piece puzzle. Maybe one day you will come back to the problem and find the 250-piece solution.

Problems are, ultimately, their solutions, not themselves. The same problem (for example, 2011 USAJMO/5) can be spoilers Spend a little time scrolling through to find solutions that resemble your work to the greatest extent; this should be your first priority if and only if there is not an official solution in the context of where the practice problem appeared (for example, selected solutions in a textbook.) If that solution exists, you should read it no matter what: it either resembles your solution completely, or it illustrates an application of the idea you were trying to learn that you missed. This is why problems in this category are so useful: you're guaranteed to take away at least something concrete from the problem (from reading the official solution), and doing problems with similar flavor consciously helps your brain build that "abstract intuition" stronger and stronger.
Hopefully the above discourse has illustrated why I am against doing arbitrary problems: even if those problems are from well-known or affluent contests (IMO shortlist, USA contests, etc.) You will find yourself missing 250 pieces of a 1000 piece puzzle that can be completed much, much less than you will find yourself missing 750 pieces into a puzzle that cannot be completed. It may be frustrating to make *so much progress* on one approach and have none of the complete solutions take your path, instead diverging in many different directions none of which you even considered. But it happens: you want to have something to fall back on.

Thus, embrace official solutions in context; they're your best friend.

Of course, this is not to say that you should ignore all solutions entirely. If you cannot find a solution that traces your own work, you can simply just read a solution to the problem that feels easy to understand (intuitively). If many of the solutions go in one specific direction that differs from your original approach, do some work in that direction. You don't stop thinking about the problem the moment you start reading any solution. Keep your brain active: try to follow a solution that is structured in a way you can perceive. If the first solution you find doesn't satisfy this, look for another one. If all things fail (or you decide consciously to do so), simply drop the problem and come back to it later.

Essentially, the above paragraph can be summarized in one sentence: make it work.

Above all, we truly realize how to think about attempting problems, looking at solutions, and using hints when we realize that there is nothing to think about.
This post has been edited 1 time. Last edited by HamstPan38825, Aug 5, 2022, 5:14 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Math4Life7
1703 posts
#9 • 1 Y
Y by NegativeZeroPlusOne
guptaamitu1 wrote:
Math4Life7 wrote:
as a person who is terrible at reading solutions and still decently okay at comp math.

My question was not regarding comp math. I meant to ask about olympiad math.

I was talking about competition math but I dont have too much experience with oly so...
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
guptaamitu1
656 posts
#10
Y by
@HamstPan38825 , Thanks. That was quite helpful.

I think you gave emphasis on the fact that it much better to try practice problems. But sometimes, I lag resources for that. Like for Geometry, one can find lot of nice material online. But when it comes to other topics (like Algebra, Combinatorics, and Number Theory), then I am unable to find nice resources. There might be some introductory type resources, but say if one is trying to get better at tackling IMO 3/6, I simply don't know exactly which handouts/books to refer.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
anurag27826
93 posts
#11 • 1 Y
Y by Mango247
guptaamitu1 wrote:
But when it comes to other topics (like Algebra, Combinatorics, and Number Theory), then I am unable to find nice resources. There might be some introductory type resources, but say if one is trying to get better at tackling IMO 3/6, I simply don't know exactly which handouts/books to refer.

True, There is a great need for a Combinatorics and NT Marathon just like the active Geo Marathon.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HamstPan38825
8857 posts
#12 • 1 Y
Y by guptaamitu1
guptaamitu1 wrote:
@HamstPan38825 , Thanks. That was quite helpful.

I think you gave emphasis on the fact that it much better to try practice problems. But sometimes, I lag resources for that. Like for Geometry, one can find lot of nice material online. But when it comes to other topics (like Algebra, Combinatorics, and Number Theory), then I am unable to find nice resources. There might be some introductory type resources, but say if one is trying to get better at tackling IMO 3/6, I simply don't know exactly which handouts/books to refer.

I don't want to say anything too decisive here, as I'm nowhere near the level of IMO 3/6, and towards the most difficult end of olympiads there is really a luck-based aspect: a highly experienced contestant with a reasonable amount of training faced with a reasonable olympiad may find it possible to guarantee, say, 35+, but a guaranteed 42 is near impossible. (A similar idea plays out throughout all nontrivial contest levels.)

That being said, you're not asking about how to solve IMO 3/6's, which makes the above tangent somewhat irrelevant. I'm not sure how difficult or how unconventional you're trying to go for here, but some kinds of resources definitely exist: for example, to cite probably the most famous of which, XYZ Press's Topics in Functional Equations, Lemmas in Olympiad Geometry, and Number Theory: Concepts and Problems form a quite formidable trio.

Another piece of advice that is useful at all levels is to capitalize off the experiences of others, quite directly. I'm not a good person to give you specific guidance here: but if you ask a specific, concrete question (example: "can anyone give a good set of problems for practicing $\nu_p$ in binomial coefficients?" rather than "does anyone have any good recommendations for IMO 3/6 level $\nu_p$ problems?), there is likely someone who could help you. In general, you will be much better off with your solution-reading dilemma if there exists a person you know who has attempted the problem recently, still has it fresh on their mind, and can explain it to you and point out anything you've missed.
This post has been edited 1 time. Last edited by HamstPan38825, Aug 7, 2022, 2:53 PM
Z K Y
N Quick Reply
G
H
=
a