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
Hello, I am going to be a 7th grader next year and I really want to qualify for USAJMO in 8th grade, so far I have these goals reached
1. AMC 10 Honor Roll A and B 2025
2. AMC 8 DHR and HR
3. AIME 3 :(
This year on AIME something happened and I got a 3 :( on the AMC's I got a 105 on AMC 10 A and I got a 114 on AMC 10 B. I want to improve mostly on AIME but since the AMC 10 is coming up quicker what would you guys recommend for getting 110+ on both of the AMC 10's and getting a 6+ on AIME? So far I am only doing Alcumus and have no books so far.... Checking the table of contents on the books Alcumus provides the same topics. I was thinking to take WOOT 1 and AMC 10 Problem Series.
i wanted to do one for 1000, then 1111, then 1234, then 1500, then 2000, then 2222 and i forgot about all of those lol
2500 is cool.
i am not very sentimental so im not going to post a math story or anything.
here are some problems though
p1
You roll 5 -sided regular dice. What is the minimum value of such that the expected value of the sum of all five rolls is at least ?
p2
students want to share pencils. If every student gets at least one pencil, how many ways are there to distribute the pencils?
p3
How many diagonals can a -sided regular polygon have such that the diagonals only meet at the vertices?
p4
Johnny buys a pet lobster named Pinchy. If Pinchy can eat water balloons at a rate of 69 pounds/nanogram, how tall is Johnny? Assume that it is not a leap year.
So basically, I have the AP Calculus BC exam in less than a month, and I have only covered until Unit 6 or 7 of the cirriculum. I am self studying this course (no teacher) and have not had much time to study bc of 6 other APs. I need to finish 8, 9, and 10 in less than 2 weeks. What can I do ? I would appreciate any help or resources anyone could provide. Could I just learn everything from barrons and princeton? Also, I have not taken AP Calculus AB before.
A semicircle k with radius r is constructed over the line segment ST. Let D be a point on the line segment ST that is different from S and T. The two squares ABCD and DEF G lie in the half-plane of the semicircle such that points B and F lie on the semicircle k and points S, C, D, E, and T lie on a straight line in that order. (Points A and/or G can also lie outside the semicircle if necessary.)
Investigate whether the sum of the areas of the squares ABCD and DEFG depends on the position of point D on the line segment ST.
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 ....
Maximizing the Sum of Minimum Differences in Permutations
chinawgp0
Today at 10:20 AM
Problem Statement
Given a positive integer n \geq 3 , consider a permutation \pi = (a_1, a_2, \dots, a_n) of \{1, 2, \dots, n\} . For each i ( 1 \leq i \leq n-1 ), define d_i as the minimum absolute difference between a_i and any subsequent element a_j ( j > i ), i.e.,
d_i = \min \{ |a_i - a_j| \mid j > i \}.
Let S_n denote the maximum possible sum of d_i over all permutations of \{1, \dots, n\} , i.e.,
S_n = \max_{\pi} \sum_{i=1}^{n-1} d_i.
Proposed Construction
I found a method to construct a permutation that seems to maximize \sum d_i :
1. Fix a_{n-1} = 1 and a_n = n .
2. For each i (from n-2 down to 1 ):
- Sort a_{i+1}, a_{i+2}, \dots, a_n in increasing order.
- Compute the gaps between consecutive elements.
- Place a_i in the middle of the largest gap (if the gap has even length, choose the smaller midpoint).
Partial Results
1. I can prove that 1 and n must occupy the last two positions. Otherwise, moving either 1 or n further right does not decrease \sum d_i .
2. The construction greedily maximizes each d_i locally, but I’m unsure if this ensures global optimality.
Request for Help
- Does this construction always yield the maximum S_n ?
- If yes, how can we rigorously prove it? (Induction? Exchange arguments?)
- If no, what is the correct approach?
Observations:
- The construction works for small n (e.g., n=3,4,5,...,12 ).
- The problem resembles optimizing "minimum gaps" in permutations.
Any insights or references would be greatly appreciated!
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