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.
<DPA+ <AQD =< QIP wanted, incircle circumcircle related
parmenides5141
N2 hours ago
by Ilikeminecraft
Source: IMo 2019 SL G6
Let be the incentre of acute-angled triangle . Let the incircle meet , and at , and respectively. Let line intersect the circumcircle of the triangle at and , such that lies between and . Prove that .
Parallelity and equal angles given, wanted an angle equality
BarisKoyuncu5
N2 hours ago
by SleepyGirraffe
Source: 2022 Turkey JBMO TST P4
Given a convex quadrilateral such that . The lines and intersect at a point and the line passing through which is parallel to , intersects at . Prove that
Cyclic points and concurrency [1st Lemoine circle]
shobber10
N3 hours ago
by Ilikeminecraft
Source: China TST 2005
Let be the circumcircle of acute triangle . Two tangents of from and intersect at , and intersect at . Point , are on and such that and .
(1) Prove that are concyclic.
(2) Denote the centre of the circle passing through ., are difined similarly. Prove that ,, are concurrent.
Vertices of a convex polygon if and only if m(S) = f(n)
orl12
N4 hours ago
by Maximilian113
Source: IMO Shortlist 2000, C3
Let be a fixed positive integer. Given a set of points in the plane such that no three are collinear and no four concyclic, let be the number of circles that contain in their interior, and let Prove that there exists a positive integer depending only on such that the points of are the vertices of a convex polygon if and only if
Find all solutions for the functional equation , in which :
Note: the solution is actually quite obvious - , but the proof is important.
Note 2: it is likely that the result can be generalized into a more advanced questions, potentially involving more bash.
implies .......... implies ......
Equating 1 and 2 gives,
Plugging in above equation yields
hence we have and
also see that gives for all in
These two functions give ..........
now let belong to
Changing to in above equation gives which gives for all in gives that for all in
hence we get or for all
Now, if there exist in such that and ..
it is easy to get a contradiction by assuming WLOG is non negative and then
so we get two solutions for all in
or for all in
This post has been edited 2 times. Last edited by Atpar, Jun 21, 2020, 11:05 AM
This FE is very suitable for a introductory exercise . It captures all the basic tricks .
Sketch
Denote by the assertion . and gives . Note that and imply that is odd. Next gives that is involutive .
Next note that
Next note that and implies Swapping variables we get holds for all nonzero . Hence we have for all nonzero for some . However since it holds for as well we conclude that for all . Since is an involution, hence .
The answers are and .
It is easy to see that they satisfy the given functional equation, we now show that these are the only solutions.
Let denote the given assertion, we prove that is odd, let , from and , we have and by comparing these two equations, we get for all . So, we can deduce that by letting .
We now show that is an involution, as desired. Since is an involution, it is also bijective.
Then, we show that , we have as desired. Thus, .
Now, assume that there exist such that and where , we have and , therefore, If , then , so which is impossible. If , then which is also impossible.
Hence, and are indeed the only solutions.
The answer is and . This can be easily checked to work. Denote the given assertion.
Let . From we get: But by we get: Comparing these two equations gives us , so .
Now, comparing and we find that , so is odd. Then, by we derive: Combining this with odd, we get that for all . Therefore is involutive and also bijective, etc.
WIth we get: Comparing this with we get . But if we replace with and use , we get: where we use the injectivity of here.
Now suppose there exist some such that and . Since is odd, WLOG . From we get: Now taking a total of four cases on the value of and will give ,, or in each of them, none of which are possible. This leaves and as the only solutions.
Let denotes assertion of given functional equation. Note that and gives us: Consequently from it follows or in other words for all positive reals .
Now we seek to gain some more useful identities, thus we take look at : Replacing by gives in last equality yields to: This helps us since: Last identity simply implies that we for all negative reals , therefore we conclude that for all real numbers . Now we take from both sides of : Finally we replace by in the last identity: This implies that or . Now we are left to escape pointwise trap. Assume that for some non zero real numbers we have and . Consider : This transforms into: If , then - contradiction, otherwise: Therefore functions and are the only ones that work.
So . Plugging in yields , hence and is odd. We immediately get and then by oddness.
Since , we have , and taking and comparing yields .
Assume FTSOC that such that ,, and . Note that , and we similarly have . , so . This means that , so , contradiction. Then the only solutions are and , which both work.
Nice
Choose .. Now put it . Now put in to get . So . Now . In any case, . Now . Also by putting in , we get . Recall that we had obtained . If for some , we get a contradiction by .
So, and are the solutions, which clearly work
Let denote the assertion. and gives .
Comparing and gives is odd. and so for all .
But since is odd, we have and so for all , so is bijective. for all .
So, and since injective, we have for all .
Clearly, and are solutions.
Lets assume for , and . Then gives us or , contradiction. So we have our 2 solutions and .
Let be the assertion of is odd.
For oddness, , So and if we take instead of a in the previous equation, we find
Assume we have and for some nonzero , then or which are contradictions.
Determine all the functions satisfies the equation
Cute
Let be the assertion of the functional equation. Then. gives us that . also gives us that so . Put in this to get . Thus, . Now, gives us that or , implying that . If for some and for some , gives us the desired contradiction.
This post has been edited 1 time. Last edited by rama1728, Oct 21, 2021, 3:35 PM Reason: .
so . so now we have . so and .
Note that covers all nonnegative numbers so for all we have .
we had now put so we have . Note that both are nonnegative so for all nonnegative but back we proved . so we have for negative values as well.
Answers : .
Can we change the title of this post? Having the solution set (however obvious) of a functional equation as the title seems like a major and completely unnecessary giveaway.
Put to get Put to get Thus . From we get , and so .
Put into the initial equation. We get And so Rewrite it as The left side is symmetric, thus , from which . Substituting it into the original equation we get , which means our solutions are and .