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 ABCD be a cyclic quadrilateral, which is AB=7 and BC=6. Let E be a point on segment CD so that BE=9. Line BE and AD intersect at F. Suppose that A, D, and F lie in order. If AF=11 and DF:DE=7:6, find the length of segment CD.
IMO ShortList 1998, combinatorics theory problem 1
orl44
N19 minutes ago
by YaoAOPS
Source: IMO ShortList 1998, combinatorics theory problem 1
A rectangular array of numbers is given. In each row and each column, the sum of all numbers is an integer. Prove that each nonintegral number in the array can be changed into either or so that the row-sums and column-sums remain unchanged. (Note that is the least integer greater than or equal to , while is the greatest integer less than or equal to .)
Source: Bulgaria National Olympiad 2025, Day 2, Problem 6
Let be given points in the plane, and let be a real number. Alice and Bob play the following game. Firstly, Alice constructs a connected graph with vertices at the points , i.e., she connects some of the points with edges so that from any point you can reach any other point by moving along the edges.Then, Alice assigns to each vertex a non-negative real number , for , such that . Bob then selects a sequence of distinct vertices such that and are connected by an edge for every . (Note that the length is not fixed and the first selected vertex always has to be .) Bob wins if otherwise, Alice wins. Depending on , determine the largest possible value of for which Bobby has a winning strategy.
Given triangle the point is the centre of the excircle opposite the vertex This excircle is tangent to the side at , and to the lines and at and , respectively. The lines and meet at , and the lines and meet at Let be the point of intersection of the lines and , and let be the point of intersection of the lines and Prove that is the midpoint of
(The excircle of opposite the vertex is the circle that is tangent to the line segment , to the ray beyond , and to the ray beyond .)
Several line segments parallel to the sides of a rectangular sheet of paper were drawn on it. These segments divided the sheet into several rectangles, inside of which there are no drawn lines. Petya wants to draw one diagonal in each of the rectangles, dividing it into two triangles, and color each triangle either black or white. Is it always possible to do this in such a way that no two triangles of the same color share a segment of their boundary?
(help urgent) Classic Geo Problem / Angle Chasing?
orangesyrup4
N35 minutes ago
by Royal_mhyasd
Source: own
In the given figure, ABC is an isosceles triangle with AB = AC and ∠BAC = 78°. Point D is chosen inside the triangle such that AD=DC. Find the measure of angle X (∠BDC).
Define act <Castle> as following:
For rectangle with dimensions i * j, doing <Castle> means to change its dimensions to (i+p) * (j+q) where p,q is a natural number smaller than 3.
Define 1*1 rectangle as "C0" rectangle, and define "Cn" ("n" is a natural number) as a rectangle that can be created with "n" <Castle>s.
Plus, there is a constraint for "Cn" rectangle. The constraint is that "Cn" rectangle's area must be bigger than n^2 and be same or smaller than (n+1)^2. (n^2 < Area =< (n+1)^2)
Let all "C20" rectangle's area's sum be A, and let all "C20" rectangles perimeter's sum be B.
What is A-B?
I can prove is injective and anyone continue please?
I noticed that there exists some homogenous-like function by isolating on the . Can you post the claims you made with proof so that we can create a complete solution?
I can prove is injective and anyone continue please?
I noticed that there exists some homogenous-like function by isolating on the . Can you post the claims you made with proof so that we can create a complete solution?
for all so all can be written as for some
Then there exists some homogenous-kinda function (lets call it ) such that and also thats what I meant to say. Correct me if wrong lol.
for all so all can be written as for some
Then there exists some homogenous-kinda function (lets call it ) such that and also thats what I meant to say. Correct me if wrong lol.
I am not sure how to call it in english or even what it is. Hope you can understand what I am saying from the symbols Thats the important part anyways, not some random math definition.
I am not sure how to call it in english or even what it is. Hope you can understand what I am saying from the symbols Thats the important part anyways, not some random math definition.
So basically I am trying to define a second function, g, which exists and satisfies both relations above. Then proving g must be constant will help in proving that the only sol we have found so far is unique. Hope that clears things up.
So basically I am trying to define a second function, g, which exists and satisfies both relations above. Then proving g must be constant will help in proving that the only sol we have found so far is unique. Hope that clears things up.
is a must for all positive . Then it could be any function but we may be able to narrow it down. Just brainstorming, nothing rigorous. This FE has been unsolved for some time, I doubt that I of all people will be the one to solve.
This post has been edited 3 times. Last edited by GreekIdiot, Apr 4, 2025, 8:28 PM