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
Suppose an infinite non-constant arithmetic progression of integers contains in it. Prove that there are an infinite number of perfect cubes in this progression. (A perfect cube is an integer of the form , where is an integer. For example, , and are perfect cubes.)
I will post a question and someone has to answer it. Then they have to post a question and someone else will answer it and so on. We can only post questions related to Number Theory and each problem should be more difficult than the previous. Let's start!
This is so messed up, well first u have to prove that there exists an such that now the replace after that doesn't give and finally the fact that is an identity doesn't mean
Let , so equation rewrites as , and putting , we get , call this .
Note that for any such that , and gives that for all .
.
, comparing this with above, we get for all .
Now, letting , since , we get for all .
Since was surjective, we get for all , and putting we get that for all , so is constant and for some constant . It is easy to see that all such functions work.
I claim that all solutions are of the form for some , these can be shown to work.
Let be the assertion. gives that , thus is surjective. For any such that , gives that , so has exactly solution. Assume that there are distinct and such that . Let be such that , and let be such that . Note that and must be distinct. and give that , giving a contradiction, so is injective. gives as desired.
Let the assertion yields: (1)
Since is surjective, yields: yields: , let denote yields: from (1)
Furthermore let , thus let . This implies that: .
And we are done!
f(x + f(x+y)) = x + f(f(x) + y)(1)
(1) x --> 0 => f(f(y)) = f(y + f(0))(2)
(1) y--> -f(x) => f : surjective
There is exist some c such that f(c) = 0
(1) x--> c, y --> 0 => f(c) = c + f(0) => c = -f(0)
(1) y --> -x+c => f(x) = x + f(f(x) - x +c ) => f(x) - x = f(f(x) - x +c)
Let a = f(x) - x + c => f(a) = a+f(0)
(1) x--> a, y --> y - a => f(a + f(y)) = a + f(f(a) + y - a) => f(a + f(y)) = a + f(y + f(0)) => f(a + f(y)) = a + f(f(y))
By (2) we can replace f(y) by z => f(z + a) = a + f(z)(3)
(1) y --> y - x + c => f(x + f(y + c)) = x + f(f(x) + y - x +c) and a = f(x) - x +c => f(x + f(y+c)) = x + f(y) + f(x) - x + c =>
f(x + f(y - f(0))) = f(x) + f(y) + c, replace y by y + f(0) => f(x + f(y)) = f(x) + f(y + f(0)) + c => f(x + f(y)) = f(x) + f(y) + c
By (2) we can replace f(y) by y => f(x + y) = f(x) + f(y) + c then g(x) = f(x) - f(0) => g(x+y) = g(x) + g(y)
(1) => g(x + g(x + y) + f(0)) + f(0) = x + f(0) + g(g(x) + y + f(0)) => g(x + g(x + y)+ f(0)) - g(g(x) + y + f(0)) = x =>
g(x - y + g(y)) = x => put y = a => g(x) = x then f(x) = x+f(0) - is answer
Answer is for any real constant . Note that plugging yields the surjectivity of . Let . Pick to get gives or . Comparing with implies Since is surjective, we can replace with . So which yields is constant. If then as desired.
This post has been edited 2 times. Last edited by bin_sherlo, Nov 4, 2024, 4:18 PM
Let denote the assertion. gives Suppose with , let , then for all . But gives So is injective and . Plugging this in, we get that all work for constant .
Let denote the assertion. gives Suppose with , let , then for all . But gives So is injective and . Plugging this in, we get that all work for constant .