ka April Highlights and 2025 AoPS Online Class Information
jlacosta0
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)!
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
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
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
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
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
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
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][/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 , do not answer with " is a solution" only. Either you post any kind of proof or at least something unexpected (like " is the smallest solution). Someone that does not see that 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.
A chess king was placed on a square of an board and made moves so that it visited all squares and returned to the starting square. At every moment, the distance from the center of the square the king was on to the center of the board was calculated. A move is called if this distance becomes smaller after the move. Find the maximum possible number of pleasant moves. (The chess king moves to a square adjacent either by side or by corner.)
Let be positive integers such that and . Let be the set of values attained by as runs through the positive integers. Show that is the set of all positive divisors of some positive integer.
Dear Argady, what you know about ABC Theorem ? Would be nice if you send us links of solved examples with ABC Theorem.
Dear bitrak, Arqady right, this problem can be solved by ABC theorem because depend on and , you can read the theorem ( or ABC theorem, I learn it from Nguyen Anh Cuong) and I sure that your solution has wrong already.
Monreal, you know Vietnamese language ^^.
UVW and ABC are not same technique (methods) such that maybe you don't learn good.
I expect comments from others mathematicians.
Thanks for your comment Monreal.
luofangxiang
It is true that:
c ≥ 1 ( must be proved: Because c=max{a,b,c} => c²+c²+c²+c³ ≥ 4 <=> (c-1)(c+2)² ≥0 <=> c ≥1 ) and
c ≥ (a+b)/2 (proof: from c ≥a and c ≥ b => 2c ≥ (a+b) => c ≥ (a+b)/2 )
How from here you conclude that
c ≥ 1≥ (a+b)/2
?
Thanks for your explanation.
Nice mudok and thank you for helping in explanation the solution of luofangxiang.
Your proof for a+b+c ≤ 3 is very nice. I have this proof from year 2011 on vietnamese language.
That's first line of his proof and the most important fact.
" It is well-known result ", but in solution of luofangxiang must be noted and prove.
^^
Attachments:
This post has been edited 1 time. Last edited by bitrak, Apr 13, 2016, 10:54 PM Reason: I forgot a picture.
You are right mudok.
On AoPS ABC theorem is not "well-known result ".
Same in Europe.
I think that ABC Theorem is before UVW and is proved by Vietnamese mathematicians,
because very often I see proof written on vietnamese language (almost never on englesh).
But here on AoPS have so many good mathematicians from Asia and they can help us with translating and elaborating of ABC theorem.
In each case, by my thinking ABC is very useful tool for solving inequalities as UVW method.
and techniques are the same. The original proof, written in Vietnamese, is essentially the same as one written in English. So you should not argument about it, Bitrak .
Argady is correct when arguing that you cannot fix and constant at the same time and treat as a single variable. The core ideal of theorem is to expand to find the bound of . Then it is arguing that any symmetric polynomial that can be written as monotonic function of will achieve extrema when 2 variables are equal. Anhcuong simplied the criterion by considering any symmetric polynomial of degree because obviously they are all linear function of .
It is obviously that you did not understand the proof of or theorem .
This post has been edited 1 time. Last edited by urun, Apr 13, 2016, 9:58 PM
I think Urun that you don't understand ABC theorem. In my solved example above you can see that p and q are not fixed and ABC technique is explained complete. So, would be nice if we can see the proof of ABC on english and Vietnamese language.
Your comment is very suspicious without proof.
Thank you for a comment.
This post has been edited 1 time. Last edited by bitrak, Apr 13, 2016, 11:14 PM
Because problem of ABC and UVW is very interesting and behind your very nice inequlaity, I will open new topics where we can
continue with comments. I expect for your inequality here will have more nice solutions.
If you are the author of the inequality, then bravo for you, inequality is really beautiful. http://artofproblemsolving.com/community/c6h1227738_abc_vs_uvw_theorem
Lets fix .We have condition .We see that inequality is equivalent to where is where We have so is monotonic.So we only need to check for minimal possible value of u.Existence of a,b,c for u is equivalent to <==><==> where ,so we see that for big enough and for some so it has smallest positive real root .If when then smallest value u can attain is otherwise its .In both cases two of are equal,so we only need to check inequality when , and this case is obvious.
Note that we allow to be negative(but not )(because in case inequality is still true(see #2 post)
So inequality is true for all reals such that .We also have one more equality case for this:
This post has been edited 2 times. Last edited by Misha57, Apr 14, 2016, 10:13 AM
We fix any for which there exist such that Then we are moving u (with fixed and condition ).So by each value of that we chose we know exactly (and since it is fixed).
This post has been edited 2 times. Last edited by Misha57, Apr 14, 2016, 9:54 AM