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.
Let P be a point in a square ABCD. The lengths of segments PA, PB, PC are 17, 11 and 5 respectively. Determine the area of the square and if it can’t be determined exactly, all possible values are to be listed.
German math Olympiad, Class 9, 2024
It’s my first time posting - please excuse any mistakes
A sequence of integers is call if it satisfies the following properties: and for all indices . .
Find the smallest integer for which: Every sequence, there always exist two terms whose diffence is not less than . (where is given positive integer)
Hi everyone,
As we know, the pqr/uvw method is a powerful and useful tool for proving inequalities. However, transforming an expression into or can sometimes be quite complex. That's why I’ve written a program to assist with this process.
I hope you’ll find it helpful!
IHC 10 Q25: Eight countries participated in a football tournament
xytan05850
22 minutes ago
Source: International Hope Cup Mathematics Invitational Regional Competition IHC10
Eight countries sent teams to participate in a football tournament, with the Argentine and Brazilian teams being the strongest, while the remaining six teams are similar strength. The probability of the Argentine and Brazilian teams winning against the other six teams is both . The tournament adopts an elimination system, and the winner advances to the next round. What is the probability that the Argentine team will meet the Brazilian team in the entire tournament?
also know as provincial level, is a qualifying round for National Math Olympiad
Year 2019 Part A
Part B consists of 5 essay / proof problems, posted here
Time: 90 minutes Rules
Write only the answers to the questions given. Some questions can have more than one correct answer. You are asked to provide the most correct or exact answer to a question like this. Scores will only be given to the giver of the most correct or most exact answer. Each question is worth 1 (one) point. to be more exact: in years 2002-08 time was 90' for part A and 120' for part B since years 2009 time is 210' for part A and B totally each problem in part A is 1 point, in part B is 7 points
p1. In the bag there are red balls and white balls. Audi took two balls at once from inside the bag. The chance of taking two balls of the same color is ...
p2. Given a regular hexagon with a side length of unit. The area of the hexagon is ...
p3. It is known that and are the roots of the cubic equation . The value of is ...
p4. The number of pairs of natural numbers so that and is ...
p5. A data with four real numbers ,,, has an average of and a median of . The largest number of such data is ...
p6. Suppose are integers greater than which are four consecutive quarters of an arithmetic row with . If and are squares of two consecutive natural numbers, then the smallest value of is ...
p7. Given a triangle , with , and . The points and lies on the line segment . with and . The measure of the angle is ...
p8. Sequqnce of real numbers meet for each natural number . The value of is ....
p9. The number of ways to select four numbers from provided that the difference of any two numbers at least is ...
p10. Pairs of natural numbers which satisfies are as many as ...
p11. Given a triangle with and . Point lies on the side so that . Suppose is a point on the side extension so that is perpendicular to . The point lies on the ray such that and . The large angle is ...
p12. The set of consists of integers with the following properties: For every three different members of there are two of them whose sum is a member of . The largest value of is ....
p13. The minimum value of with positive reals is ....
p14. The polynomial P satisfies the equation with is ....
p15. Look at a chessboard measuring square units. Two plots are said to be neighbors if they both have one side in common. Initially, there are a total of coins on the chessboard where each coin is only loaded exactly on one square and each square can contain coins or blanks. At each turn. You must select exactly one plot that holds the minimum number of coins in the number of neighbors of the plot and then you must give exactly one coin to each neighbor of the selected plot. The game ends if you are no longer able to select squares with the intended conditions. The smallest number of so that the game never ends for any initial square selection is ....
1. The infinite Morse sequence of zeros and ones, 011010011001..., is constructed as follows: start with 0, then at each step, append a block of the same length as the current sequence, obtained by replacing 0 with 1 and vice versa in the existing block. Is this sequence periodic?
2. On an infinite (two-way) tape, a text in Russian is written. It is known that in this text, the number of distinct 15-symbol blocks is equal to the number of distinct 16-symbol blocks. Prove that the text on the tape is periodic in both directions (i.e., bi-infinite and periodic), for example: "...мамамыларамумамамы...".
Given six distinct points on a plane, all pairwise distances between which are different. Prove that there exists a line segment connecting two of these points which is the longest side in one triangle formed by three of the points, and the shortest side in another triangle formed by three of the points.
Since gcd of any two possible integers is at least 1,then a>=b>=c>=4(wlog ,since a,b,c>=4). Then,we have: a=gcd(b,c)+3<=c+3. 1) If a=c=>a=b=c=>a=gcd(b,c)+3=a+3, false. 2)If a=c+1 =>b=gcd(a,c)+3=4=> c=4, a=5, contradiction,since a=5, but gcd(b,c)+3=7. 3)If a=c+2, and a is odd=> b=gcd(a,c)+3=4, și c=4, and a=c+2=6, contradiction( a îs odd); if a is even, then b=gcd(a,c)+3=5, and a,c are both even=>c=4,a=6, contradiction,since a=6, but gcd(b,c)+3=4. 4) If a=c+3=> b=4 or b=6. If b=4=>c=4, a=7, and (7,4,4) is a valid solution; if b=6, then gcd(b,c)+3=a>=b=6, obtain gcd(b,c)>=3, and this leads to c=6, a=9 => the valid solution is (9,6,6). . Finally,the answer is 7•4•4+9•6•6=436.
Since gcd of any two possible integers is at least 1,then a>=b>=c>=4(wlog ,since a,b,c>=4). Then,we have: a=gcd(b,c)+3<=c+3. 1) If a=c=>a=b=c=>a=gcd(b,c)+3=a+3, false. 2)If a=c+1 =>b=gcd(a,c)+3=4=> c=4, a=5, contradiction,since a=5, but gcd(b,c)+3=7. 3)If a=c+2, and a is odd=> b=gcd(a,c)+3=4, și c=4, and a=c+2=6, contradiction( a îs odd); if a is even, then b=gcd(a,c)+3=5, and a,c are both even=>c=4,a=6, contradiction,since a=6, but gcd(b,c)+3=4. 4) If a=c+3=> b=4 or b=6. If b=4=>c=4, a=7, and (7,4,4) is a valid solution; if b=6, then gcd(b,c)+3=a>=b=6, obtain gcd(b,c)>=3, and this leads to c=6, a=9 => the valid solution is (9,6,6). . Finally,the answer is 7•4•4+9•6•6=436.
with latex
Since gcd of any two possible integers is at least 1,then (wlog ,since ). Then,we have:.
1) If , false.
2)If contradiction,since , but .
3)If , and is odd then , șo , and , contradiction (a is odd); if a is even, then , and are both even then , contradiction, since , but .
4) If or . If , and is a valid solution; if , then , obtain , and this leads to and the valid solution is . Finally,the answer is .
This post has been edited 1 time. Last edited by MrHeccMcHecc, Mar 11, 2025, 8:58 AM