Happy Memorial Day! Please note that AoPS Online is closed May 24-26th.

G
Topic
First Poster
Last Poster
k a May Highlights and 2025 AoPS Online Class Information
jlacosta   0
May 1, 2025
May is an exciting month! National MATHCOUNTS is the second week of May in Washington D.C. and our Founder, Richard Rusczyk will be presenting a seminar, Preparing Strong Math Students for College and Careers, on May 11th.

Are you interested in working towards MATHCOUNTS and don’t know where to start? We have you covered! If you have taken Prealgebra, then you are ready for MATHCOUNTS/AMC 8 Basics. Already aiming for State or National MATHCOUNTS and harder AMC 8 problems? Then our MATHCOUNTS/AMC 8 Advanced course is for you.

Summer camps are starting next month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have an enriching summer experience. 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)!

Be sure to mark your calendars for the following upcoming events:
[list][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
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

Prealgebra 2 Self-Paced

Prealgebra 2
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
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 Self-Paced

Introduction to Counting & Probability
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
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 Self-Paced

Introduction to Algebra B
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
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

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
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

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
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
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

AMC 12 Final Fives
Sunday, May 18 - Jun 15

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

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

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 1, 2025
0 replies
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
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]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/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 $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ 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.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
JBMO TST Bosnia and Herzegovina 2023 P4
FishkoBiH   0
9 minutes ago
Source: JBMO TST Bosnia and Herzegovina 2023 P4
Let $n$ be a positive integer. A board with a format $n*n$ is divided in $n*n$ equal squares.Determine all integers $n$3 such that the board can be covered in $2*1$ (or $1*2$) pieces so that there is exactly one empty square in each row and each column.
0 replies
FishkoBiH
9 minutes ago
0 replies
JBMO TST Bosnia and Herzegovina 2023 P3
FishkoBiH   0
14 minutes ago
Source: JBMO TST Bosnia and Herzegovina 2023 P3
Let ABC be an acute triangle with an incenter $I$.The Incircle touches sides $AC$ and $AB$ in $E$ and $F$ ,respectivly. Lines CI and EF intersect at $S$. The point $T$$I$ is on the line AI so that $EI$=$ET$.If $K$ is the foot of the altitude from $C$ in triangle $ABC$,prove that points $K$,$S$ and $T$ are colinear.
0 replies
FishkoBiH
14 minutes ago
0 replies
Locus of points P in triangle ABC
v_Enhance   25
N 21 minutes ago by alexanderchew
Source: USA January TST for IMO 2016, Problem 3
Let $ABC$ be an acute scalene triangle and let $P$ be a point in its interior. Let $A_1$, $B_1$, $C_1$ be projections of $P$ onto triangle sides $BC$, $CA$, $AB$, respectively. Find the locus of points $P$ such that $AA_1$, $BB_1$, $CC_1$ are concurrent and $\angle PAB + \angle PBC + \angle PCA = 90^{\circ}$.
25 replies
v_Enhance
May 17, 2016
alexanderchew
21 minutes ago
JBMO TST Bosnia and Herzegovina 2023 P2
FishkoBiH   0
22 minutes ago
Source: JBMO TST Bosnia and Herzegovina 2023 P2
Determine all non negative integers $x$ and $y$ such that $6^x$ + $2^y$ + 2 is a perfect square.
0 replies
FishkoBiH
22 minutes ago
0 replies
JBMO TST Bosnia and Herzegovina 2023 P1
FishkoBiH   0
27 minutes ago
Source: JBMO TST Bosnia and Herzegovina 2023 P1
Determine all real numbers $a, b, c, d$ for which

$ab+cd=6$
$ac+bd=3$
$ad+bc=2$
$a+b+c+d=6$
0 replies
FishkoBiH
27 minutes ago
0 replies
number theory diophantic with factorials and primes
skellyrah   4
N an hour ago by skellyrah
Source: by me
find all triplets of non negative integers (a,b,p) where p is prime such that $$ a! + b! + 7ab = p^2 $$
4 replies
skellyrah
Feb 16, 2025
skellyrah
an hour ago
Inequality em981
oldbeginner   17
N an hour ago by sqing
Source: Own
Let $a, b, c>0, a+b+c=3$. Prove that
\[\sqrt{a+\frac{9}{b+2c}}+\sqrt{b+\frac{9}{c+2a}}+\sqrt{c+\frac{9}{a+2b}}+\frac{2(ab+bc+ca)}{9}\ge\frac{20}{3}\]
17 replies
oldbeginner
Sep 22, 2016
sqing
an hour ago
primes,exponentials,factorials
skellyrah   6
N an hour ago by skellyrah
find all primes p,q such that $$ \frac{p^q+q^p-p-q}{p!-q!} $$is a prime number
6 replies
skellyrah
Apr 30, 2025
skellyrah
an hour ago
Serbian selection contest for the IMO 2025 - P5
OgnjenTesic   2
N an hour ago by GreenTea2593
Source: Serbian selection contest for the IMO 2025
Determine the smallest positive real number $\alpha$ such that there exists a sequence of positive real numbers $(a_n)$, $n \in \mathbb{N}$, with the property that for every $n \in \mathbb{N}$ it holds that:
\[
        a_1 + \cdots + a_{n+1} < \alpha \cdot a_n.
    \]Proposed by Pavle Martinović
2 replies
OgnjenTesic
May 22, 2025
GreenTea2593
an hour ago
centroid wanted, point that minimizes sum of squares of distances from sides
parmenides51   1
N an hour ago by SuperBarsh
Source: Oliforum Contest V 2017 p9 https://artofproblemsolving.com/community/c2487525_oliforum_contes
Given a triangle $ABC$, let $ P$ be the point which minimizes the sum of squares of distances from the sides of the triangle. Let $D, E, F$ the projections of $ P$ on the sides of the triangle $ABC$. Show that $P$ is the barycenter of $DEF$.

(Jack D’Aurizio)
1 reply
parmenides51
Sep 29, 2021
SuperBarsh
an hour ago
Strictly monotone polynomial with an extra condition
Popescu   11
N 2 hours ago by Iveela
Source: IMSC 2024 Day 2 Problem 2
Let $\mathbb{R}_{>0}$ be the set of all positive real numbers. Find all strictly monotone (increasing or decreasing) functions $f:\mathbb{R}_{>0} \to \mathbb{R}$ such that there exists a two-variable polynomial $P(x, y)$ with real coefficients satisfying
$$
f(xy)=P(f(x), f(y))
$$for all $x, y\in\mathbb{R}_{>0}$.

Proposed by Navid Safaei, Iran
11 replies
Popescu
Jun 29, 2024
Iveela
2 hours ago
Hard geometry
Lukariman   1
N 2 hours ago by ricarlos
Given triangle ABC, any line d intersects AB at D, intersects AC at E, intersects BC at F. Let O1,O2,O3 be the centers of the circles circumscribing triangles ADE, BDF, CFE. Prove that the orthocenter of triangle O1O2O3 lies on line d.
1 reply
Lukariman
May 12, 2025
ricarlos
2 hours ago
Russian Diophantine Equation
LeYohan   1
N 2 hours ago by Natrium
Source: Moscow, 1963
Find all integer solutions to

$\frac{xy}{z} + \frac{xz}{y} + \frac{yz}{x} = 3$.
1 reply
LeYohan
Yesterday at 2:59 PM
Natrium
2 hours ago
Simple Geometry
AbdulWaheed   6
N 2 hours ago by Gggvds1
Source: EGMO
Try to avoid Directed angles
Let ABC be an acute triangle inscribed in circle $\Omega$. Let $X$ be the midpoint of the arc $\overarc{BC}$ not containing $A$ and define $Y, Z$ similarly. Show that the orthocenter of $XYZ$ is the incenter $I$ of $ABC$.
6 replies
AbdulWaheed
May 23, 2025
Gggvds1
2 hours ago
Problem 2 (First Day)
Valentin Vornicu   84
N May 13, 2025 by cj13609517288
Find all polynomials $f$ with real coefficients such that for all reals $a,b,c$ such that $ab+bc+ca = 0$ we have the following relations

\[ f(a-b) + f(b-c) + f(c-a) = 2f(a+b+c). \]
84 replies
Valentin Vornicu
Jul 12, 2004
cj13609517288
May 13, 2025
Problem 2 (First Day)
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Shreyasharma
683 posts
#74
Y by
Kinda disappointed this boiled down to guess and check, but okay.

We claim the only solutions are of the form $f(x) = mx^4 + nx^2$, which clearly work.

Let $Q(a, b, c)$ denote the assertion. Clearly $Q(0, 0, 0)$ gives $P(0) = 0$. Then from $Q(x, 0, 0)$ we see $P(x) = P(-x)$ implying $P$ is even. Thus $P$ can be written as $G(x^2) = P(x)$ for some polynomial $G(x)$.

Now we claim that all polynomials of the form $f(x) = mx^4 + nx^2$ work. It is easy to show that these work from just plugging.

Now we claim if $\text{deg}(P) > 6$ fails. To see this we consider the leading coefficients of the polynomial. Note that we want the following to fail,
\begin{align*}
    (a-b)^{2n} + \left(b + \frac{ab}{a+b}\right)^{2n} + \left(a + \frac{ab}{a+b}\right)^{2n} = 2\left(a + b - \frac{ab}{a+b}\right)^{2n}
\end{align*}This is equivalent to showing that the leading coefficients of the following fail,
\begin{align*}
    (a^2 - b^2)^{2n} + \left(2ab + b^2 \right)^{2n} + \left(2ab + a^2 \right)^{2n} = 2\left(a^2 + b^2 + ab\right)^{2n}
\end{align*}Setting $a = 2x$ and $b = x$ we see we need,
\begin{align*}
    (3x)^{2n} + (5x)^{2n} + (8x)^{2n} = 2 \cdot (7x)^{2n}
\end{align*}However it is easy to see the LHS is much greater than the RHS for $n \geq 3$, so it is impossible for this equation to hold. Thus we are done.
This post has been edited 2 times. Last edited by Shreyasharma, Sep 27, 2023, 5:07 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
joshualiu315
2534 posts
#75
Y by
Notice $(a,b,c)=(0,0,0)$ gives $P(0)=0$ so then we can plug in $(a,b,c)=(x,0,0)$ to get that $P$ is even.

Set $P(x) = a_{2n}x^{2n} + a_{2n-2}x^{2n-2} + \cdots + a_2x^2 + a_0$. Taking $(a,b,c) = (3x,6x,-2x)$ gives $\deg P <6$. Solving, we get $\boxed{P(x)=cx^4+dx^2, \ c,d \in \mathbb{R}}$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
abeot
128 posts
#76 • 2 Y
Y by chenghaohu, centslordm
Taking $a=b=c=0$ we find that $P(0) = 0$.
Taking $a=b=0$ we find that $P(-c) = P(c)$, so $P$ must be even.

Now, let $a = -2k$, $b = 3k$ and $c = 6k$.
Clearly this satisfies $ab+bc+ca=0$, and we obtain
\[ P(5k) + P(3k) + P(8k) = 2P(7k) \]Now, suppose that $P(x)$ has degree $n$. Then we obtain
\[ 5^n + 3^n + 8^n = 2\cdot 7^n \]From Bernoulli we see that $\frac{8^7}{7^7} \geq 2$. Thus, $n \leq 7$. Taking modulo 6, we see that $n \neq 6$.
Therefore, the maximal degree is $4$, as $n$ must be even.

Then, we find that $P(x) = k_1x^4 + k_2x^2$ for some reals $k_1$ and $k_2$. To see how $x^4$ works, note that
\[ (a-b)^4 + (b-c)^4 + (c-a)^4 - 2(a+b+c)^4 = -6(ab+bc+ca)(ab+bc+ca+a^2+b^2+c^2) \]and $x^2$ works as
\[ (a-b)^2 + (b-c)^2 + (c-a)^2 - 2(a+b+c)^2 = -6(ab+bc+ca) \]so indeed all polynomials of that form work. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jolynefag
125 posts
#77
Y by
Let our polynomial be of the form $P(x)=a_n \cdot x^n+a_{n-1} \cdot x^{n-1}+...+a_1\cdot x+a_0$. Let's play with the coefficients of the polynomial, that is, if there is some $c_i*A$ on the left in the expression, where say $A$ is an expression of $a,b,c$, then we should have the same thing on the right.

Let's look at how the coefficient $a_0$ behaves: $$a_0+a_0+a_0=2a_0,$$
$$\Rightarrow \a_0=0.$$

Let's see how $a_1$ behaves: $$a_1((a-b)+(b-c)+(c-a))=2a_1(a+b+c),$$$$\Rightarrow 0=a_1(a+b+c).$$
$a+b+c$ is not always $0$, so $a_1=0$.

And how $a_2$ behaves: $$a_2((a-b)^2+(b-c)^2+(c-a)^2)=2a_2(a+b+c)^2,$$$$\Rightarrow a_2(2a^2+2b^2+2c^2)=a_2(2a^2+2b^2+2c^2).$$
Everything works, so we can say that $a_2$ can essentially be anything, and we leave it that way.
Of course, I would like to work with $a_3$ further, but I'm so lazy, a lot of numbers appear with it, and something tells me that equality does not always happen, I thought. Then, it would be worthwhile to come up with some universal values for $a,b,c$ so that the condition $ab+bc+ac=0$ would be satisfied at the same time, and so that the coefficients could be conveniently estimated.

The equality of the coefficient $a_i$ looks like this: $$a_i((a-b)^i+(b-c)^i+(c-a)^i)=2a_i(a+b+c)^i.$$It is very inconvenient to disclose this whole thing with large values of $i$, then let's find convenient values for $a,b,c.$ Then, let's look at $(a-b)$, I thought it would be quite convenient if $a=b+1$ and the value would be identical to $1$ for any $i$. With the same logic, I made it so that $c=b+2$, then let's see what happens to $ab+bc+ac$:

$$b(b+1)+b(b+2)+(b+1)(b+2)=0,$$$$3b^2+6b+2=0,$$$$ \Rightarrow b_1=\frac{1}{\sqrt{3}}-1, \ b_2=-\frac{1}{\sqrt{3}}-1.$$We get two roots, I see that the first one is more convenient and I take it. Let's look at our coefficient $a_i$ under these values: $$a_i((\frac{1}{\sqrt{3}}-(\frac{1}{\sqrt{3}}-1))^i+((\frac{1}{\sqrt{3}}-1)-(\frac{1}{\sqrt{3}}+1))^i+((\frac{1}{\sqrt{3}}+1)-\frac{1}{\sqrt{3}})^i)=2a_i(\sqrt{3})^i,$$$$\Rightarrow a_i((-2)^i+2)=2a_i(\sqrt{3})^i.$$Let's say $a_i$ is not $0$, then $(-2)^i+2=2(\sqrt{3})^i.$ With $i\geq 3$ and odd, the two sides will have different signs, and with $i\geq 6$ and $i$ even, the growth will be faster on the left than on the right (it can be proved by induction that there will always be more on the left with $i\geq 6$.) Works for $i=2.4$, but this does not mean that this will always be the case. If $i=2$ we have checked. Check $i=4$, use the facts that $(a+b+c)^2=a^2+b^2+c^2$, $(ab+bc+ac)^2=0,$ $(a^2+b^2+c^2)(ab+bc+ac)=0$ and make sure that the equality is identical.

Accordingly, any coefficient except $a_4$ and $a_2$ must be zero, and these two can take any value.

Answer: $\boxed{P(x)=a_4\cdot x^4+a_2 \cdot x^2.}$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kamatadu
480 posts
#78 • 1 Y
Y by GeoKing
$P \equiv kx^4 + lx^2$ works where $k$, $l\in \mathbb R$.

Let $Q(a,b,c)$ denote the assertion $P(a-b)+P(b-c)+P(c-a) = 2P(a+b+c)$.

$Q(0,0,0)\implies P(0) = 0$.

\begin{align*}
    Q\left(c,c,-\frac{c}{2}\right) &\implies P(0) + P\left(\frac{3c}{2}\right) + P\left(\frac{-3c}{2}\right) = 2 P\left(\frac{3c}{2}\right)\\
    &\implies P\left(\frac{-3c}{2}\right)=P\left(\frac{3c}{2}\right)\\
    &\implies P(-x) = P(x)\\
    &\implies P(x) \text{ is even}
.\end{align*}
All the terms are of even degree.

$P(x) = a_nx^{2n} + \cdots + a_1x^2 + a_0x^0$. So $P(0) = 0 \implies a_0 = 0$.

Now $Q\left(\frac{-c}{3},\frac{c}{2},c\right) \implies P\left(\frac{-5c}{6}\right) + P\left(\frac{-c}{2}\right) + P\left(\frac{4c}{3}\right) = 2P\left(\frac{7c}{6}\right)$.

So, we have,
\[  P\left(\frac{5c}{6}\right) + P\left(\frac{c}{2}\right) + P\left(\frac{4c}{3}\right) = 2P\left(\frac{7c}{6}\right). \]
Now comparing the coefficients of the $c^{2i}$ term, we get that,
\[ a_i\left(\frac{5}{6}\right)^{2i} + a_i\left(\frac{1}{2}\right)^{2i} + a_i\left(\frac{4}{3}\right)^{2i} = 2\left(\frac{7}{6}\right)^{2i}. \]$\implies a_i(5^{2i} + 3^{2i} + 8^{2i}) = a_i(2\cdot 7^2i)$.

If $a_i\neq 0$, then $25^i + 9^i + 64^i = 2\cdot 49^i$. Now note that $64^i > 2\cdot 49^i$ for all $i\ge 3$.

Thus we must have $i\le 2$. Checking gives that $i=1$ and $2$ both work. So we get our desired form and we are done. :yoda:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shendrew7
799 posts
#79
Y by
We claim our solutions are of the form $\boxed{P(x)=px^4+qx^2, \quad p,q \in \mathbb{R}}$, which can be tested to work. Denote the assertion as $A(a,b,c)$. Then
\begin{align*}
A(0,0,0) &\implies P(0)=0 \\
A(a,0,0) &\implies P(a)=P(-a) \implies P \text{ even.} \\
A(1, 1-\sqrt 3, 1+\sqrt 3) &\implies (\sqrt 3)^{2k} + (-2\sqrt 3)^{2k} + (\sqrt 3)^{2k} = 2 \cdot 3^{2k} \\
&\implies 4^k+2 = 2 \cdot 3^k \\
&\implies k=1,2.
\end{align*}
Hence the only possible degrees of nonzero terms of $P$ are 2 and 4, as desired. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Cusofay
85 posts
#80
Y by
We can check that $P(x)=mx^4+nx^2$ for real numbers $m,n$ works and we want to prove its uniqueness.
Note that if $P$ and $Q$ are solutions, $aP+bQ$ is a solution for all real numbers $a,b$ so it's enough to find all solutions of the form $x^n$.$P(0,0,0)$ and $P(0,0,x)$ gives us that $n$ is even

$$P(6,3,-2) \Rightarrow 3^n+5^n+(-8)^n=2 \cdot 7^n$$
If $n=0$, then this obviously doesn't hold.

If $n=2$, then $9+25+64= 98 =2 \cdot 49$, which works.

If $n=4$, then $81+625+4096 = 4802 = 2 \cdot 2401 $, which also works.


If $n=6$, then $$3^6+5^6+8^6>8^6=(7+1)^6=7^6+\frac{6}{7} \cdot 7^6 + \frac{15}{49} \cdot 7^6 = (2+\frac{8}{49}) \cdot 7^6>2 \cdot 7^6,$$which is a contradiction.

If $n \ge 8$, then $$3^n+5^n+8^n>8^n=(7+1)^n>7^n+n \cdot 7^{n-1} > 2 \cdot 7^n,$$contradiction.

$$\mathbb{Q.E.D.}$$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
john0512
4190 posts
#81
Y by
We claim that the answer is $P(x)=rx^4+sx^2$ for any real number $r,s$, which clearly works.

By plugging $a=b=c=0$, we find that $P(0)=0$. Then, plugging $b=c=0$, we have that $P$ is even.

We would like to cancel the right side by setting $a+b+c=0$, but this isn't possible since $a+b+c=0,ab+ac+bc=0$ implies $a=b=c=0$ over reals. The next best thing would be to consolidate terms of the left hand side: $$a-b=b-c$$$$c=2b-a.$$Plugging $c=2b-a$ gives us that $$2P(a-b)+P(2b-2a)=2P(3b).$$However, we also have $$ab+ac+bc=0$$$$ab+(2b-a)(a+b)=0$$$$a^2-2ab-2b^2=0$$$$a=b(1\pm \sqrt{3}).$$We will only use $a=b(1+\sqrt{3}),$ which when plugged into $$2P(a-b)+P(2b-2a)=2P(3b),$$we get $$2P(b\sqrt{3})+P(-2b\sqrt{3})=2P(3b).$$We will equate coefficients of $b^{2n}$ on both sides, noting that $P$ is even. If the coefficient of $x^{2n}$ in $P$ is $a_2n$, then we have $$a_{2n}(2\cdot 3^n+12^n)=a_{2n}(2\cdot 9^n).$$Thus, or each nonnegative integer $n$, either $$a_{2n}=0$$or $$2\cdot 3^n+12^n=2\cdot 9^n.$$This is only true for $n=1$ and $n=2$, as we can test that $n=0$ doesn't work, and $12^n>2\cdot 9^n$ for $n\geq 3.$ Thus, only the $x^2$ and $x^4$ coefficients are allowed to be nonzero, thus done.

remark: The main idea here is to make a substitution that, combined with the constraint of $ab+ac+bc=0$, makes it so that all terms are of the form $$kP(rb).$$This is very nice because this means that the $x^n$ coefficent of this only depends on the $x^n$ coefficient of $P$, allowing us to easily equate coefficients. By only setting "homogeneous" constraints, like $a-b=b-c$ that I used, one can prevent the input of the polynomial from having a constant shift. In fact, $$(a,b,c)=(b(1+\sqrt{3}),b,b(1-\sqrt{3}))$$is really the only substitution you need to solve this problem.
This post has been edited 1 time. Last edited by john0512, Feb 10, 2024, 4:36 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
john0512
4190 posts
#82
Y by
Cusofay wrote:
We can check that $P(x)=mx^4+nx^2$ for real numbers $m,n$ works and we want to prove its uniqueness.
Note that if $P$ and $Q$ are solutions, $aP+bQ$ is a solution for all real numbers $a,b$ so it's enough to find all solutions of the form $x^n$.$P(0,0,0)$ and $P(0,0,x)$ gives us that $n$ is even

$$P(6,3,-2) \Rightarrow 3^n+5^n+(-8)^n=2 \cdot 7^n$$
If $n=0$, then this obviously doesn't hold.

If $n=2$, then $9+25+64= 98 =2 \cdot 49$, which works.

If $n=4$, then $81+625+4096 = 4802 = 2 \cdot 2401 $, which also works.


If $n=6$, then $$3^6+5^6+8^6>8^6=(7+1)^6=7^6+\frac{6}{7} \cdot 7^6 + \frac{15}{49} \cdot 7^6 = (2+\frac{8}{49}) \cdot 7^6>2 \cdot 7^6,$$which is a contradiction.

If $n \ge 8$, then $$3^n+5^n+8^n>8^n=(7+1)^n>7^n+n \cdot 7^{n-1} > 2 \cdot 7^n,$$contradiction.

$$\mathbb{Q.E.D.}$$

unfortunately, the linear combination of any two solutions also being a solution does not necessarily imply that checking $x^n$ suffices

for example, if hypothetically the solution set is $r(x+1)$ for real numbers $r$, then it is true that the linear combination of any two solutions is still a solution, but in this case there are no solutions of the form $x^n$ even though there does exist solutions.

the issue here is that $1,x,x^2,\dots$ is not the only basis for real polynomials, and there are plenty of other choices, so closure under addition like this does not imply that only checking these suffices

it's ok though :D I wish you good luck in the future!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
pie854
243 posts
#83
Y by
The answer is $f(x)=ux^4+vx^2$ where $u,v\in \mathbb R$. This polynomial indeed satisfies the problem.

We get from the equation that $f(0)=0$ and $f(x)=f(-x)$ for all $x\in \mathbb R$. So we can write $$f(x)=\sum_{k=1}^n a_k x^{2k}$$where $a_n\neq 0$. Now we put $(a,b,c)=\left(x,-\frac{x}{1+x},1\right)$ into the equation and after clearing the denominator we get $$\sum_{k=1}^n a_k Q_k(x)=0\qquad(\star)$$for all $x\in \mathbb R$, where $$Q_k(x)=x^{2k}(x+2)^{2k}+(2x+1)^{2k}+(x^2-1)^{2k}-2(x^2+x+1)^{2k}.$$We can check that $Q_2(x)=Q_4(x)=0$ for all $x$. And for $k>2$ we can prove via the multinomial theorem that $\deg Q_k=4k-2$.

Now we claim that $n\leq 2$, which will finish the problem. Suppose ftsoc that $n>2$ and let $\deg Q_n=m$. Since $m>\max_{1\leq k\leq n-1} \deg Q_k$, it follows that the coefficient of $x^m$ in $(\star)$ is some nonzero number times $a_n$. Thus we must have $a_n=0$, which is the desired contradiction.
This post has been edited 1 time. Last edited by pie854, May 19, 2024, 4:41 AM
Reason: changed P to f
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sansgankrsngupta
147 posts
#84
Y by
Am I the only one to find this problem very easy for a P2 or infact even a P1?
This post has been edited 1 time. Last edited by sansgankrsngupta, Nov 29, 2024, 12:54 PM
Reason: -
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ilikeminecraft
658 posts
#85
Y by
Let $S$ be the set of solutions. We prove that $S = \{rx^2 + sx^4 \mid|r, s\in\mathbb R\}$

$(0, 0, 0) \implies P(0) = 0, (0, 0, c) \implies P(c)= P(-c),$ so $P$ is an even function.
Claim: $S$ is a $\mathbb R$-vector space
Proof: This is obvious.
Claim:$P(x) = x^2, x^4$ both work.
Proof: Both are just expansion
Claim: $\deg P \leq 4$
Proof: Take $(6x, 3x, -2x)$ to get $P(3x) + P(5x) + P(8x) = 2P(7x).$ Hence, if a polynomial works, then we require $3^{2n} + 5^{2n} + 8^{2n} = 2\cdot7^{2n}$ where $n = \deg P.$ However, simply note that $8^{2n}\geq2\cdot7^{2n}$ for $n\geq3.$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ihatecombin
66 posts
#86
Y by
We claim the only polynomials which work are those of the form \(f(x) = ax^4 + bx^2\). It can be shown (painfully) that \(f(x) = x^4\) works, thus \(P(x) = ax^4\) works.
Similarly it can be shown that \(bx^2\) works, thus \(f(x) = ax^4 + bx^2\) works, we shall show that this is the only solution.
Claim 1: \(f(0) = 0\) and \(f(x)\) is even
Proof:
We can just substitute \(b = c = 0\), we immediately obtain
\[f(a) + f(0) + f(-a) = 2f(a) \Longrightarrow f(a) = f(-a) + f(0)\]Since the constant terms of both sides of the equation have to be equal, it follows that \(f(0) = 0\), thus \(f(x)\) is even. $\blacksquare$

The main idea is that in the equation
\[f(a-b) + f(b-c) + f(c-a) = 2f(a+b+c)\]if \(f(x) = a_{n}x^n + a_{n-1}x^{n-1} + \cdots + a_{0}\) works, then \(f(n) = x^n\), \(f(n) = x^{n-1}\), etc, also has to work. Thus by claim \(1\), we simply need to show that \(f(x) = x^{2k}\) fails for \(k > 2\). Let us first show that \(x^{2k}\) fails
Claim 2: \(f(x) = x^{2k}\) fails for \(k > 2\)
Proof:
We can substitute \(c = \frac{-ab}{a+b}\) to get rid of the algebraic condition, thus our equation becomes
\[{(a-b)}^{2k} + {\left(b + \frac{ab}{a+b}\right)}^{2k} + {\left(\frac{-ab}{a+b} - a\right)}^{2k} = 2{\left(a+b-\frac{ab}{a+b}\right)}^{2k}\]We can multiply both sides by \({(a+b)}^{2k}\) to obtain
\[{(a^2-b^2)}^{2k} + {(b^2 + 2ab)}^{2k} + {(a^2 + 2ab)}^{2k} = 2{(a^2 + ab + b^2)}^{2k}\]Now we can substitute \(a = 2\) and \(b = 1\) which gives
\[3^{2k} + 5^{2k} + 8^{2k} = 2 \cdot 7^{2k} \Longrightarrow {\left(\frac{3}{7}\right)}^{2k} + {\left(\frac{5}{7}\right)}^{2k} + {\left(\frac{8}{7}\right)}^{2k} = 2\]Since \({\left(1+\frac{1}{7}\right)}^{6} > 2\) by the binomial theorem, we are done. $\blacksquare$

Now we need to show that if \(f(x) = a_{n}x^n + a_{n-1}x^{n-1} + \cdots + a_{0}\) works, then \(f(n) = x^n\), \(f(n) = x^{n-1}\), etc, also has to work.
Assume \(f(x)\) works for all \((a,b,c)\) with \(ab+bc+ca = 0\) however there exists some \(m\) such that \(a_{m} \neq 0\), but \(f(x) = x^{m}\) fails.

Let \(k\) denote the largest value such that \(f(x) = a_{n}x^n + a_{n-1}x^{n-1} + \cdots + a_{k}x^{k} + \cdots + a_{0}\) works, but \(f(x) = x^k\) fails.
Due to the maximality of \(k\), it follows that if \(a_{m} \neq 0\) and \(m > k\) then \(x^m\) works, thus we can just get rid of these terms and only look at the function
\(g(x) = a_{k}x^{k} + a_{k-1}x^{k-1} + \cdots + a_{0}\), we also preemptively define \(h(x) = g(x) - a_{k}x^k = a_{k-1}x^{k-1} + \cdots + a_{0}\)

Let \((p,q,r)\) denote some triple of values such that \(pq+qr+rp = 0\) and for which
\[{(p-q)}^{k} + {(q-r)}^{k} + {(r-q)}^{k} \neq 2{(p+q+r)}^{k}\]such a triple clearly exists since we assumed that \(f(x) = x^k\) doesn't fulfill the functional equation.
Let \({(p-q)}^{k} + {(q-r)}^{k} + {(r-q)}^{k} - 2{(p+q+r)}^{k} = \delta\), since we have assumed that \(g(x)\) works, it follows that
\[g(p-q) + g(q-r) + g(r-p) = 2g(p+q+r)\]Thus
\[a_{k} \cdot \delta = 2h(p+q+r) -  h(p-q) - h(q-r) - h(r-p)\]Notice that if the functional equation holds for some \((p,q,r)\), it also holds for some \(cp,cq,cr\) where \(c\) is an arbitrary constant. Thus by scaling the variables by \(c\) we have
\[a_{k} \cdot \delta \cdot c^{k} = 2h(cp+cq+cr) - h(cp-cq) - h(cq-cr) - h(cr-cp)\]Since \(h(x)\) is a degree \(k-1\) polynomial at best, it follows that the right hand side grows by at most \(c^{k-1}\), whereas the left hand side grows by \(c^{k}\).
Thus for sufficiently large \(c\), the left hand side cannot possibly equal the right hand side. Thus we are done.
This post has been edited 1 time. Last edited by Ihatecombin, Apr 16, 2025, 2:47 PM
Reason: -
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Adywastaken
62 posts
#87
Y by
We first proceed similarly to other solutions.
$a=b=c=0\implies P(0)=0$
$a=b=0\implies P(-c)=P(c)$
$(a, b, c)=(6x, 3x, -2x)$. Then, if $\deg(P)=n$,
$3^n+5^n+8^n=2\cdot7^n$
$n=4$ works since $\frac{4802}{2401}=2$, and there are no other solutions.
Since $P$ is even and of degree 4, let $P(x)=ax^4+bx^2+c$. Plugging in, $c=0$.
So, $P(x)=ax^4+bx^2$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
cj13609517288
1922 posts
#88
Y by
The answer is $\boxed{f(x)=sx^4+tx^2}$ for any real $s,t$, which "clearly" works.

$P(0,0,0)$ gives $f(0)=0$, then $P(a,0,0)$ gives $f(a)=f(-a)$. So $P(a,1-a,-a(1-a))$ gives
\[f(2a-1)+f(a^2-2a)+f(a^2-1)=2f(a^2-a+1).\]Suppose that the leading term of $f$ is $\ell x^{2k}$, then $k\ge 3$. Then by comparing the coefficient of $a^{4k-2}$ on both sides, we get
\[4k(2k-1)-2k=2(2k+k(2k-1))\]which eventually reduces to $k\in\{0,2\}$, impossible. $\blacksquare$
Z K Y
N Quick Reply
G
H
=
a