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 ,, and be squares that have vertices at lattice points (i.e., points whose coordinates are both integers) in the coordinate plane, together with their interiors. The bottom edge of each square is on the x-axis. The left edge of and the right edge of are on the -axis, and contains as many lattice points as does . The top two vertices of are in , and contains of the lattice points contained in . See the figure (not drawn to scale).
IMAGE
The fraction of lattice points in that are in is 27 times the fraction of lattice points in that are in . What is the minimum possible value of the edge length of plus the edge length of plus the edge length of ?
is a positive integer. Call all positive divisors of which are different from and beautiful divisors.We call a special number when it has at least beautiful divisors and difference of any beautiful divisors divides as well. Find all special numbers.
Points with rational coordinates lie on a plane. It turned out that the distance between every pair of points is an integer. Prove that there exist points with integer coordinates such that for every pair N. Sheshko, D. Zmiaikou
Two circles and , of equal radius intersect at different points and . Consider a circle externally tangent to at and internally tangent to at point . Prove that lines and intersect at a point lying on .
Let triangle be inscribed in the circle . A line through point intersects and at points and , respectively. Let be the reflection of across the midpoint of , and be the reflection of across the midpoint of . Prove that:
a) the reflection of the orthocenter of triangle across line lies on the circle .
b) the orthocenters of triangles and coincide.
A student firstly wrote on the board. For each procces, the stutent deletes the number x and replaces it with either or or . Is this possible to make the number on the board?
Let and be positive real numbers with . Let be the maximum possible value of for which the system of equations has a solution in satisfying and . Then can be expressed as a fraction , where and are relatively prime positive integers. Find .
By Napkin 47.1.5 there is a norm function defined by which is multiplicative, meaning This means that for any rational numbers ,,, we should have Since , this gives the identity which kills the problem.
This post has been edited 1 time. Last edited by v_Enhance, Mar 23, 2023, 10:06 PM
The motivation for moving the inside is actually pretty simple: things like usually have geometric sequences as coefficients and so you *really* want that to happen here implying the result
for me i tried some false bounding claims that were proven with faulty calcbash. then i realized "wait why am i using calc on a jmo 1" and then i found the factorization after looking at some of the expressions on my scratch paper.
This post has been edited 1 time. Last edited by brainfertilzer, Mar 23, 2023, 11:04 PM
Let denote the norm in , and note its multiplicative nature. Move to the LHS of the equation. The resulting LHS of rearranges as Thus, we need to find the number of positive integer solutions to . The only solutions are and its permutations, and we conclude.
did you get deducted for the last part? "notice that the only values of x such that 2x^2-1 | 2023 are x=1,2,3." I didn't really see anything wrong so I was wondering what the deduction was for
@3below It probably would be a 7 if he specified that they satisfied the equation. Although the steps are reversible, he didn't say that satisfied anyway.
This post has been edited 1 time. Last edited by megarnie, Mar 14, 2024, 1:52 AM
So you need to show (2,3,3) and permutations work? or the x=1,2,3 work?
You need to show that the find and permutations actually work. What he did was just proving that: if satisfy the equation, then (and permutations). He never showed that implies that satisfy the equation.
In other words, he only showed one direction of the if and only if that the problem wanted. Page 8 of https://web.evanchen.cc/textbooks/OTIS-Excerpts.pdf#page17 has more about this detail.
So you need to show (2,3,3) and permutations work? or the x=1,2,3 work?
You need to show that the find and permutations actually work. What he did was just proving that: if satisfy the equation, then (and permutations). He never showed that implies that satisfy the equation.
In other words, he only showed one direction of the if and only if that the problem wanted. Page 8 of https://web.evanchen.cc/textbooks/OTIS-Excerpts.pdf#page17 has more about this detail. x 76helllooloY 0 hellloolo
@naonaoaz
AoPS User
still would prob get a 6 if this was actual jmo
and plus i think all steps are reversible anways so that is not necessary
This problem is awesome. Let p(t) = t^3 - at^2 + bt - c be the polynomial with roots x, y, and z. Then the equation in the problem is the same as saying 2(a + 2c)^2 = (2b + 1)^2 + 2023 by Vieta's formulas. This tells us that (-1 + sqrt(2)a - sqrt(4)b + sqrt(8)c)(1 + sqrt(2)a + sqrt(4)b + sqrt(8)c) after subtracting both sides by (2b+1)^2 and using the difference of squares factorization. But now we take a real hard look at that equation... and what do you know... it's just sqrt(8)p(-1/sqrt(2)) * sqrt(8)p(1/sqrt(2)) = 8p(-1/sqrt2)p(1/sqrt2). But that equals 8(x - 1/sqrt2)(y-1/sqrt2)(z-1/sqrt2)(x+1/sqrt2)(y+1/sqrt2)(z+1/sqrt2). By the commutative property of multiplication, that just equals 8(x-1/sqrt2)(x+1/sqrt2)(y-1/sqrt2)(y+1/sqrt2)(z-1/sqrt2)(z+1/sqrt2). Finally (x-1/sqrt2)(x+1/sqrt2) = x^2 - 1/2 by the difference of squares factorization. Therefore, our equation just becomes 8(x^2-1/2)(y^2-1/2)(z^2-1/2) = 2023, which means (2x^2-1)(2y^2-1)(2z^2-1) = 2023. Therefore, 2x^2-1 = d, so x = +- sqrt((d+1)/2) for some divisor of 2023 d. We can ignore the negative solution because the problem says x has to be positive, so x = sqrt((d+1)/2). Notice d is either 1, 7, 17, 289, 119, or 2023. Since x is a positive integer, we need (d+1)/2 to be a perfect sqaure, which means d is 1, 7 or 17. Therefore, x = sqrt((1+1)/2) = 1, sqrt((7+1)/2) = 2, or sqrt((17+1)/2) = 3. The same logic happens for y and z. We now do casework on x. If x = 1, then (2y^2-1)(2z^2-1) = 2023. If y = 1, we get 2z^2 - 1 = 2023, so z = sqrt((2023 + 1)/2), which is not an integer. If y = 2, then 2z^2-1 = 289, so z = sqrt((289 + 1)/2), which isnt an integer. If y = 3, we get 2z^2 - 1 = 119, so z^2 = 60, which gives a non-integer solution. Thus, there are no solutions in the case of x = 1. Similarly, when y or z is 1 there will be no solution. Thus, suppose x = 2. Then (2y^2-1)(2z^2-1) = 289. If y = 2, then 2z^2-1 = 289/7, which yields a non integer value of z. If y = 3, then 2z^2-1 = 17, so z = +- 3, meaning z = 3 since we only need to consider the positive solution. Finally, suppose x = 3. Then (2y^2-1)(2z^2-1) = 119. If y = 2, then 2z^2-1 = 17, so z = 3. If y = 3, then 2z^2 - 1 = 7, so z = 2. Therefore, the solutions are (x,y,z) = (2,3,3), (3,2,3), and (3,3,2). QED.
This post has been edited 1 time. Last edited by USAJMO_Qualifier, Mar 6, 2025, 5:11 AM
Here's a way to motivate the factoring from small cases (unfortunately in test I got blocked by this equation forever until bounding and then coming back): Expand and divide both sides by to get where . Now motivated by SFFT, we write it as
Now multiplying both sides by , we have , after which dividing both sides by , we have Now multiplying both sides by gives as desired.
This post has been edited 2 times. Last edited by megarnie, Apr 21, 2025, 11:03 PM