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.
Checking a summand property for integers sufficiently large.
DinDean1
Nan hour ago
by Double07
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 ,,,.
Let and be points on a plane such that , where is a positive integer. Let be the set of all points such that , where is a real number. The path that traces is continuous, and the value of is minimized. Prove that for all , is always a rational number.
Let be a positive integer. A positive integer is called a benefactor of if the positive divisors of can be partitioned into two sets and such that is equal to the sum of elements in minus the sum of the elements in . Note that or could be empty, and that the sum of the elements of the empty set is .
For example, is a benefactor of because .
Show that every positive integer has at least benefactors.
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?
If ,, there are 46 solutions for ( through ). If , we have through . This continues until ,, for which there is only one solution: . The sum for is The above is only for the case .
This post has been edited 1 time. Last edited by mathdragon2000, Sep 7, 2017, 7:30 PM
If we replace with , we know there is only solution, . In your solution, -> would become ->. In your final equation, has no solutions, but we know there is one solution.
Let , is the difference from to , is the difference from to , is the difference from to .,,, are all integers . Also, Now let ,,,. Now . If we use instead , instead of we get , which is only attainable with .
From this point, we can continue with casework bash.
This post has been edited 2 times. Last edited by Strategos, Sep 7, 2017, 8:18 PM
Y bylaegolas, brainiac1, durkaa03, thedoge, Adventure10
solution
Solving is equivalent to finding the number of partitions of into parts of size at most , which is also equivalent to finding the number of partitions of into at most parts. This sequence is A026810, and on Wolfram Alpha, the search 'partitions of 90 into at most 4 parts' yields .
If we replace with , we know there is only solution, . In your solution, -> would become ->. In your final equation, has no solutions, but we know there is one solution.
Let , is the difference from to , is the difference from to , is the difference from to .,,, are all integers . Also, Now let ,,,. Now . If we use instead , instead of we get , which is only attainable with .
From this point, we can continue with casework bash.
Ok, thanks. I though something weird happened when I tried small cases.
where
let where
Due to symmetry we will use Burnside's Lemma as follows:
we know that any group of permutations of 4 objects has 1 identity element, six 2-cycles, eight 3-cycles, six 4-cycles, and 3 pairs of 2-cycles so we need to consider 5 cases :
case1: the number of solutions of the equation with no restriction
case2: if two variable are equal say is even
if both and are even and so the number of solutions
if both and are odd so the number of solutions
Thus the total number of solutions in this case
where 6 is the number 2-cycles.
case3: if three variable are equal say is a multiple of 3
so the number of solutions of the equation
therefore the total number of solutions in this case where 8 is the number of
3-cycles.
case4: if four variables are equal say so the number of solutions of the equations thus the total number of solutions in this case where 6 is the number of 4-cycles.
case5: if two variable are equal and the other two variables are equal say so the number of solutions in this case thus the total number of solutions in this case
By Burnside's Lemma the total number of solutions
where is the total number of all cycles.
This post has been edited 2 times. Last edited by gasgous, Sep 8, 2017, 10:48 AM
By Stars and Bars, or whatever you call it, there are ways to do this ignoring . There is case where all of the numbers are the same number. There are cases where of the numbers are the same number. There are cases where there are two pairs of the same number. There are cases where two of the numbers are the same and the other two are different. Adding these cases up, we get cases where all four numbers are not distinct. This means that there are cases where all the numbers are different. Divide by to get .
This post has been edited 1 time. Last edited by randomdude10807, Sep 8, 2017, 11:09 AM
I think the best way is to use generating function but it requires the use of partial fractions which is time consuming in order to find a certain coefficient.