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.
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!
A rectangle with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of are either all odd or all even.
Checking a summand property for integers sufficiently large.
DinDean2
Nan hour ago
by DinDean
For any fixed integer , prove that there exists a positive integer , such that for any integer , can be expressed by a sum of positive integers 's as where ,,, and .
Source: USA December TST for IMO 2023, Problem 1 and USA TST for EGMO 2023, Problem 1
There are equally spaced points on a circular track of circumference . The points are labeled in some order, each label used once. Initially, Bunbun the Bunny begins at . She hops along from to , then from to , until she reaches , after which she hops back to . When hopping from to , she always hops along the shorter of the two arcs of ; if is a diameter of , she moves along either semicircle.
Determine the maximal possible sum of the lengths of the arcs which Bunbun traveled, over all possible labellings of the points.
I have noticed thousands upon thousands of inequalities that you have posted to HSO and was wondering where you get the inspiration, imagination, and even the validation that such inequalities are true? Also, what do you find particularly appealing and important about specifically inequalities rather than other branches of mathematics? Thank you :)
There is a board with a number written in each cell. Every two neighbour rows sum up to at least , and every two neighbour columns sum up to at most . Find the sum of all numbers on the board.
A square is divided into unit squares. Is it possible to fill each unit square with a number in such a way that, whenever one places the tile so that it fully covers nine unit squares, the tile will cover nine different numbers?
A quadrilateral with no parallel sides is inscribed in a circle . Circles are inscribed in triangles , respectively. Common external tangents are drawn between and , and , and , and and , not containing any sides of quadrilateral . A quadrilateral whose consecutive sides lie on these four lines is inscribed in a circle . Prove that the lines joining the centers of and , and , and the centers of and all intersect at one point.
Case 1 = If a=b then 2^b!+1=c^3 and c must be in form of 2^a. From here we get 3a=b! +1 . So b<3 . By trying 1 and 2. For case 1 a=b=2 is the only solution.
Case 2. Becuse a and b symetric in this equation , we can take a>b .
Now we get 2^b!(2^(a!-b!) +1)=c^3 Because the part in the paranthesis doesn't divide 2, b! is divisible by 3.That makes b=3 or b>3. So a>3. Now outside of the paranthesis is cubic. So let's say 2^(a!-b!)+1= k^3 where k is positive int.
In modulo 7 x^3 can't be 2. But because a>3 and b is bigger or equal to 3. And a>b. a!-b! divides 3.
In modulo seven 2^(a!-b!) +1 is 2. We get a contradiction in this case.
So a and be must be equal and the only solution is (2,2,2) .
Clearly , thus . Moreover notice that
Therefore however this clearly contradicts the fact that . Thus
Manually checking the cases yields to be the only viable solution .
Also there is a question like that (it's from senior 2020);
pow(2,a!)+pow(2,b!)+pow(2,c!)=x³
First i investigated the possibilities;
i) a=b=c
3* pow(2,a!)=x³
x is consist of 2 and 3 divisors
We must to make pow(3,3k) but we can not do this. Because another divisor is pow(2,p). So there is no solution.
ii) The answer is asymmetric. So we will look one of them, and after finding all of the solutions we will write permutations of them. Assume that a=b<c
2*pow(2,a!)+pow(2,c!)=x³
pow(2,a!+1)+pow(2,c!)=x³ accept that :
c=a+1
pow(2,a!+1)*(1+2⁰)=pow(2,a!+2) And in the problem that's given that a€Z+ . It pays for a=1. And it has solution . Click to reveal hidden text
LaTeX code below
Let's look the equality like that;
a+1!=c and the equality will be:
1+ pow(2,c!-a!-1) it can not be pow(2,k) and also can not be a cube.
Let's look another case;
iii) a<b<c
pow(2,a!)*(1+pow(2,b!-a!)+pow(2,c!-a!)=x³
And also there are two cases. If it must be equal to a cube of the number, second factor must be pow(2,n). But it gives 1 to mod 2, so it can't.
Or a must be 3k and the second multiply must be cube.
Let's accept b!-a!=m and c!-a!=n
1+pow(2,m)+ pow(2,n)=y³
pow(2,m)+pow(2,n)=y³-1=(y-1)(y²+y+1)
y must be odd number. So y-1==>even number
And y²+y+1==>odd number. pow(2,m)+pow(2,n) there are only 2 factors. So it can not pay. It doesn't have solution.
Click to reveal hidden text
LaTeX code below
This post has been edited 2 times. Last edited by zaidova, Feb 18, 2024, 7:59 PM
Also there is a question like that (it's from senior 2020);
pow(2,a!)+pow(2,b!)+pow(2,c!)=x³
First i investigated the possibilities;
i) a=b=c
3* pow(2,a!)=x³
x is consist of 2 and 3 divisors
We must to make pow(3,3k) but we can not do this. Because another divisor is pow(2,p). So there is no solution.
ii) The answer is asymmetric. So we will look one of them, and after finding all of the solutions we will write permutations of them. Assume that a=b<c
2*pow(2,a!)+pow(2,c!)=x³
pow(2,a!+1)+pow(2,c!)=x³ accept that :
c=a+1
pow(2,a!+1)*(1+2⁰)=pow(2,a!+2) And in the problem that's given that a€Z+ . It pays for a=1. And it has solution . Click to reveal hidden text
LaTeX code below
Let's look the equality like that;
a+1!=c and the equality will be:
1+ pow(2,c!-a!-1) it can not be pow(2,k) and also can not be a cube.
Let's look another case;
iii) a<b<c
pow(2,a!)*(1+pow(2,b!-a!)+pow(2,c!-a!)=x³
And also there are two cases. If it must be equal to a cube of the number, second factor must be pow(2,n). But it gives 1 to mod 2, so it can't.
Or a must be 3k and the second multiply must be cube.
Let's accept b!-a!=m and c!-a!=n
1+pow(2,m)+ pow(2,n)=y³
pow(2,m)+pow(2,n)=y³-1=(y-1)(y²+y+1)
y must be odd number. So y-1==>even number
And y²+y+1==>odd number. pow(2,m)+pow(2,n) there are only 2 factors. So it can not pay. It doesn't have solution.
Same idea if we search the cases like that, we will get a=b=c
>
And that is equal to;
This post has been edited 4 times. Last edited by zaidova, Nov 21, 2024, 2:00 PM
The only solution is , which works. Now we show it's the only one.
Claim: If the sum of two powers of is a cube, then neither of the two powers of are .
Proof: Suppose otherwise for some nonnegative integers and that one of are . WLOG that . Note that powers of are or modulo , so is or modulo , however cubes are either modulo , absurd.
Thus, can't divide or , meaning are both less than . Checking cases ( and ) gives the desired result.
This seems new...
Claim: .
Proof: Assume otherwise WLOG , and let .
Note that we then have In particular, is coprime to , so it must itself be a perfect cube, say .
Then we have , but this isn't possible as is odd and not equal to .
Now we have , which has a solution iff . This gives us the value .
Thus the nly working solution is .
my solution:
i solved tis problem using modulo 3:
So if a,b<=2 we have that a=b=1:
so c^3=2+2=1 mod 3 <=> c=1 (fermat's litle theorem (a^p=a mod p))
Therefore a,b >=2. So a,b are even numbers.
It also means that 2^2k =1 mod 3
therefore a!=2s and b!=2t.
So 2^a!=1 mod 3 and 2^b! = 1 mod 3 <=> c^3 = 2 mod 3 <=> c=2 (fermat's litle theorem again)
Therefore we have that 2^a! 2^b!= 8 <=> a=b=2
So the solution is (a,b,c)=(2,2,2).
I Hope It Is Correct.