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 May Highlights and 2025 AoPS Online Class Information
jlacosta   0
May 1, 2025
May is an exciting month! National MATHCOUNTS is the second week of May in Washington D.C. and our Founder, Richard Rusczyk will be presenting a seminar, Preparing Strong Math Students for College and Careers, on May 11th.

Are you interested in working towards MATHCOUNTS and don’t know where to start? We have you covered! If you have taken Prealgebra, then you are ready for MATHCOUNTS/AMC 8 Basics. Already aiming for State or National MATHCOUNTS and harder AMC 8 problems? Then our MATHCOUNTS/AMC 8 Advanced course is for you.

Summer camps are starting next 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 an enriching 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][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/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
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
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
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
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
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
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
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

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

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

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

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

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

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
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 1, 2025
0 replies
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Interesting inequalities
sqing   0
30 minutes ago
Source: Own
Let $a,b,c \geq 0 $ and $ abc+2(ab+bc+ca) =32.$ Show that
$$ka+b+c\geq 8\sqrt k-2k$$Where $0<k\leq 4. $
$$ka+b+c\geq 8 $$Where $ k\geq 4. $
$$a+b+c\geq 6$$$$2a+b+c\geq 8\sqrt 2-4$$
0 replies
1 viewing
sqing
30 minutes ago
0 replies
x+yz+zx=n where n is a postive integer
Jackson0423   0
31 minutes ago
Source: Own
Let \( f(n) \) denote the number of ordered triples of positive integers \( (x, y, z) \) satisfying
\[
x + yz + zx = n.
\]
(1) Find \( f(10) \) and \( f(2025) \).
(2) Let \( d(n) \) denote the number of positive divisors of \( n \). Express \( f(n) \) in terms of \( d(n) \).
0 replies
Jackson0423
31 minutes ago
0 replies
Geometry with altitudes and the nine point centre
Adywastaken   3
N 39 minutes ago by Captainscrubz
Source: KoMaL B5333
The foot of the altitude from vertex $A$ of acute triangle $ABC$ is $T_A$. The ray drawn from $A$ through the circumcenter $O$ intersects $BC$ at $R_A$. Let the midpoint of $AR_A$ be $F_A$. Define $T_B$, $R_B$, $F_B$, $T_C$, $R_C$, $F_C$ similarly. Prove that $T_AF_A$, $T_BF_B$, $T_CF_C$ are concurrent.
3 replies
Adywastaken
Yesterday at 12:47 PM
Captainscrubz
39 minutes ago
(a^2+1)(b^2+1)((a+b)^2+1) being a square
navi_09220114   2
N 40 minutes ago by jonh_malkovich
Source: Malaysian SST 2024 P5
Do there exist infinitely many positive integers $a, b$ such that $$(a^2+1)(b^2+1)((a+b)^2+1)$$is a perfect square?

Proposed Ivan Chan Guan Yu
2 replies
1 viewing
navi_09220114
Sep 5, 2024
jonh_malkovich
40 minutes ago
Cycle in a graph with a minimal number of chords
GeorgeRP   3
N 43 minutes ago by starchan
Source: Bulgaria IMO TST 2025 P3
In King Arthur's court every knight is friends with at least $d>2$ other knights where friendship is mutual. Prove that King Arthur can place some of his knights around a round table in such a way that every knight is friends with the $2$ people adjacent to him and between them there are at least $\frac{d^2}{10}$ friendships of knights that are not adjacent to each other.
3 replies
GeorgeRP
Yesterday at 7:51 AM
starchan
43 minutes ago
2019 CNMO P2
minecraftfaq   5
N an hour ago by pku
Source: 2019 China North MO, Problem 2
Two circles $O_1$ and $O_2$ intersect at $A,B$. Diameter $AC$ of $\odot O_1$ intersects $\odot O_2$ at $E$, Diameter $AD$ of $\odot O_2$ intersects $\odot O_1$ at $F$. $CF$ intersects $O_2$ at $H$, $DE$ intersects $O_1$ at $G,H$. $GH\cap O_1=P$. Prove that $PH=PK$.
5 replies
minecraftfaq
Feb 21, 2020
pku
an hour ago
2019 CNMO P5
minecraftfaq   4
N an hour ago by pku
Source: 2019 China North MO, Problem 5
Two circles $O_1$ and $O_2$ intersect at $A,B$. Bisector of outer angle $\angle O_1AO_2$ intersects $O_1$ at $C$, $O_2$ at $D$. $P$ is a point on $\odot(BCD)$, $CP\cap O_1=E,DP\cap O_2=F$. Prove that $PE=PF$.
4 replies
minecraftfaq
Feb 22, 2020
pku
an hour ago
Camp Conway/Camp Sierpinski Acceptance
fossasor   7
N an hour ago by fossasor
(trying this again in a different thread now that it's later)

I've been accepted into Camp Conway, which is a part of National Math Camps, a organization of Math Camps that currently includes two: Camp Conway and Camp Sierpinski. Camp Conway is located at Harvey Mudd in California and happens during the first half of summer, while Camp Sierpinski is in North Carolina's research triangle and happens during the second half. Each of them has two two-week long sessions that accept 30 people (it's very focused on social connection), which means 120 people will be accepted to the program in total.

Given how much of the math community is on aops, I think there's a decent chance one of the 120 people might see this thread. So - has anyone here been accepted into Camp Conway or Camp Sierpinski? If so, which session are you going during, and what are you looking forward to?

I'll be attending during the second session of Conway in the first few weeks of July - I'm looking forward to the Topics Classes as a lot of them sound pretty fun.
7 replies
fossasor
Apr 19, 2025
fossasor
an hour ago
Goals for 2025-2026
Airbus320-214   138
N an hour ago by fossasor
Please write down your goal/goals for competitions here for 2025-2026.
138 replies
Airbus320-214
May 11, 2025
fossasor
an hour ago
4-vars inequality
xytunghoanh   0
an hour ago
For $a,b,c,d \ge 0$ and $a\ge c$, $b \ge d$. Prove that
$$a+b+c+d+ac+bd+8 \ge 2(\sqrt{ab}+\sqrt{bc}+\sqrt{cd}+\sqrt{da}+\sqrt{ac}+\sqrt{bd})$$.
0 replies
xytunghoanh
an hour ago
0 replies
a+b+c=1, trivial
RaleD   6
N an hour ago by MITDragon
Source: Bosnia and Herzegovina 2011
Let $a, b, c$ be positive reals such that $a+b+c=1$. Prove that the inequality
\[a \sqrt[3]{1+b-c} + b\sqrt[3]{1+c-a} + c\sqrt[3]{1+a-b} \leq 1\]
holds.
6 replies
RaleD
May 16, 2011
MITDragon
an hour ago
Nice original fe
Rayanelba   5
N 2 hours ago by Rayanelba
Source: Original
Find all functions $f: \mathbb{R}_{>0} \to \mathbb{R}_{>0}$ that verfy the following equation :
$P(x,y):f(x+yf(x))+f(f(x))=f(xy)+2x$
5 replies
Rayanelba
3 hours ago
Rayanelba
2 hours ago
HCSSiM results
SurvivingInEnglish   74
N 2 hours ago by smiley
Anyone already got results for HCSSiM? Are there any point in sending additional work if I applied on March 19?
74 replies
SurvivingInEnglish
Apr 5, 2024
smiley
2 hours ago
Stanford Math Tournament (SMT) 2025
stanford-math-tournament   4
N Today at 5:37 AM by techb
[center] :trampoline: :first: Stanford Math Tournament :first: :trampoline: [/center]

----------------------------------------------------------

[center]IMAGE[/center]

We are excited to announce that registration is now open for Stanford Math Tournament (SMT) 2025!

This year, we will welcome 800 competitors from across the nation to participate in person on Stanford’s campus. The tournament will be held April 11-12, 2025, and registration is open to all high-school students from the United States. This year, we are extending registration to high school teams (strongly preferred), established local mathematical organizations, and individuals; please refer to our website for specific policies. Whether you’re an experienced math wizard, a puzzle hunt enthusiast, or someone looking to meet new friends, SMT has something to offer everyone!

Register here today! We’ll be accepting applications until March 2, 2025.

For those unable to travel, in middle school, or not from the United States, we encourage you to instead register for SMT 2025 Online, which will be held on April 13, 2025. Registration for SMT 2025 Online will open mid-February.

For more information visit our website! Please email us at stanford.math.tournament@gmail.com with any questions or reply to this thread below. We can’t wait to meet you all in April!

4 replies
stanford-math-tournament
Feb 1, 2025
techb
Today at 5:37 AM
USAMO Prep
123s   50
N May 6, 2007 by JSteinhardt
Does anyone have any advice on how (to learn) to write clear, concise, and rigorous proofs, and/or any advice on preparing for the USAMO in general?
50 replies
123s
Apr 10, 2007
JSteinhardt
May 6, 2007
USAMO Prep
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
123s
87 posts
#1 • 6 Y
Y by Adventure10, Mango247, and 4 other users
Does anyone have any advice on how (to learn) to write clear, concise, and rigorous proofs, and/or any advice on preparing for the USAMO in general?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jb05
1086 posts
#2 • 4 Y
Y by Adventure10 and 3 other users
Preparing: do old contests (be very, very patient - spend the entire 4.5 hours at least once just to develop patience). If you can't make any progress with them, just read Engel (Problem Solving Strategies). Actually read that even if you can do them (that's how I managed to go from averaging 0 problems per USAMO at the AIME to one or two when I took it last year). If that's too hard, sorry but you probably aren't going to do too well this year :( . Prepare for next time.

There is a misconception that there's something tricky and mysterious about proofs. Just pretend that you're explaining it to a friend, but keep in mind that the friend can't ask you questions afterwards (so be clear and rigorous, but skip arithmetic and obvious stuff). If you are really worried, ask someone with more experience for advice. You can even post your proofs on these forums.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
dasherm
854 posts
#3 • 2 Y
Y by Adventure10, Mango247
jb05 wrote:
If you can't make any progress with them, just read Engel (Problem Solving Strategies).

Is this a book? If not, is it available on the web?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
davidyko
815 posts
#4 • 2 Y
Y by Adventure10, Mango247
Yup, it's a book. I believe it is in the Bookstore on this site.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Teki-Teki
553 posts
#5 • 4 Y
Y by Adventure10, Mango247, and 2 other users
to clarify, it is a pale yellow book (sticky-note color) with purplish text on the front, in case you want to make sure.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
davidyko
815 posts
#6 • 2 Y
Y by Adventure10, Mango247
And it's filled with lots of cool math. :P
Not that I'm up to that level yet.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
noneoftheabove
257 posts
#7 • 2 Y
Y by Adventure10, Mango247
about how long does it take to get through engel??
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
davidyko
815 posts
#8 • 2 Y
Y by Adventure10 and 1 other user
You definitely won't get through it in a jiffy, from skimming through its contents. Even though I haven't done any of it yet.
Okay, I'll shut up about things I don't know about now.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Klebian
1143 posts
#9 • 3 Y
Y by Adventure10 and 2 other users
Thank you.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Arvind_sn
524 posts
#10 • 4 Y
Y by Adventure10, Mango247, and 2 other users
Hmm I have Engel... it's definitely NOT something you can read in a couple of months. As a matter of fact, I'm betting that even the best mathematicians in the nation could get something out of it by reading it even if they've read it before. It will take you at least a year to read, but I remember a friend who said that he sort of "skimmed" over a few chapters in the book and made red MOP. If you are as much of a genius as he is, go for it! If not, there's always next year :)

But Engel definitely taught me a few techniques on how to tackle Olympiad problems. However, the difficulty is quite high. If you want something a bit easier to read (you can get the first chapter of Engel on Amazon's "Search Inside!" feature), you could try Larson's "Problem Solving Through Problems"
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Boy Soprano II
7935 posts
#11 • 6 Y
Y by Adventure10, Mango247, theSpider, and 3 other users
A math book is not a novel. I don't see the point of purposely trying to do every single problem in a worthwhile book on problem solving. You can read through the lessons in very little time, and it is probably worthwhile to do so. To do the more than one thousand problems would obviously take a very long time. If you can do a problem in five minutes, then it is far too easy for you to be doing that many. So I don't think you should be trying to "get through Engel". Instead, try working on some problems from it, and enjoy them, instead of seeing them as so many hurdles to jump.

Anyhow, Engel has a somewhat different flavor from the USAMO. You'll notice it most in the inequalities and the geometry, I think. But it's still good practice.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DPopov
1398 posts
#12 • 3 Y
Y by Adventure10, Mango247, theSpider
Engel is definitely not meant to be read straigth through. I would skip around and try to learn various techniques. Then attempt a few of the olympiad problems and try to apply the techniques but don't try to do every problem; it's not necessary or efficient.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Phelpedo
2444 posts
#13 • 3 Y
Y by Adventure10, Mango247, and 1 other user
Don't think you can walk away with a mastery of the material without doing a good number of problems, though. Also, just going straight from the problems to the solutions is not a good idea.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
junggi
1813 posts
#14 • 3 Y
Y by Adventure10, Mango247, and 1 other user
how many problems per chapter should we do?(percentage wise or something)

@phelpedo: nice, 2007 post count(at the time of my post)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DPopov
1398 posts
#15 • 4 Y
Y by Adventure10, Mango247, and 2 other users
Don't get me wrong, you definitely need to do a good deal of problems to master the technique. However, this will take some time and it's almost impossible to do before this year's USAMO. I would say that if you work on 15 olympiad level problems from each chapter in addition to the exercises presented within the context, you should obtain a pretty decent understand of the material. Of course it's always a good idea to review with more problems. The only way to really practice for USAMO is by doing lots and lots of problems (at least this is my opinion).
Z K Y
G
H
=
a