We have your learning goals covered with Spring and Summer courses available. Enroll today!

G
Topic
First Poster
Last Poster
k a March Highlights and 2025 AoPS Online Class Information
jlacosta   0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.

Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!

Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.

Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/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
Sunday, Mar 2 - Jun 22
Friday, Mar 28 - Jul 18
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

Prealgebra 2 Self-Paced

Prealgebra 2
Tuesday, Mar 25 - Jul 8
Sunday, Apr 13 - Aug 10
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, Mar 23 - Jul 20
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 Self-Paced

Introduction to Counting & Probability
Sunday, Mar 16 - Jun 8
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
Monday, Mar 17 - Jun 9
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 Self-Paced

Introduction to Algebra B
Sunday, Mar 2 - Jun 22
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
Tuesday, Mar 4 - Aug 12
Sunday, Mar 23 - Sep 21
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
Sunday, Mar 16 - Sep 14
Tuesday, Mar 25 - Sep 2
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

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

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Sunday, Mar 16 - Aug 24
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Wednesday, Mar 5 - May 21
Tuesday, Jun 10 - Aug 26

Calculus
Sunday, Mar 30 - Oct 5
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
Sunday, Mar 23 - Jun 15
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
Tuesday, Mar 4 - May 20
Monday, Mar 31 - Jun 23
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

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
Monday, Mar 24 - Jun 16
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
Sunday, Mar 30 - Jun 22
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Tuesday, Mar 25 - Sep 2
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Mar 2, 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
concurrency wanted, starting with a 45-135/2 - 135/2 triangle
parmenides51   2
N 18 minutes ago by GioOrnikapa
Source: 2020 Balkan MO shortlist G5
Let $ABC$ be an isosceles triangle with $AB = AC$ and $\angle A = 45^o$. Its circumcircle $(c)$ has center $O, M$ is the midpoint of $BC$ and $D$ is the foot of the perpendicular from $C$ to $AB$. With center $C$ and radius $CD$ we draw a circle which internally intersects $AC$ at the point $F$ and the circle $(c)$ at the points $Z$ and $E$, such that $Z$ lies on the small arc $BC$ and $E$ on the small arc $AC$. Prove that the lines $ZE$, $CO$, $FM$ are concurrent.

Brazitikos Silouanos, Greece
2 replies
parmenides51
Sep 14, 2021
GioOrnikapa
18 minutes ago
Another SL problem about fibonacci numbers :3
MathLuis   13
N 22 minutes ago by hgomamogh
Source: ISL 2020 C4
The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$.

Proposed by Croatia
13 replies
MathLuis
Jul 20, 2021
hgomamogh
22 minutes ago
USAMO 1983 Problem 2 - Roots of Quintic
Binomial-theorem   28
N an hour ago by Marcus_Zhang
Source: USAMO 1983 Problem 2
Prove that the roots of\[x^5 + ax^4 + bx^3 + cx^2 + dx + e = 0\] cannot all be real if $2a^2 < 5b$.
28 replies
Binomial-theorem
Aug 16, 2011
Marcus_Zhang
an hour ago
Find the period
Anto0110   0
an hour ago
Let $a_1, a_2, ..., a_k, ...$ be a sequence that consists of an initial block of $p$ positive distinct integers that then repeat periodically. This means that $\{a_1, a_2, \dots, a_p\}$ are $p$ distinct positive integers and $a_{n+p}=a_n$ for every positive integer $n$. The terms of the sequence are not known and the goal is to find the period $p$. To do this, at each move it possible to reveal the value of a term of the sequence at your choice.
If $p$ is one of the first $k$ prime numbers, find for which values of $k$ there exist a strategy that allows to find $p$ revealing at most $8$ terms of the sequence.
0 replies
Anto0110
an hour ago
0 replies
circle geometry showing perpendicularity
Kyj9981   2
N an hour ago by Double07
Two circles $\omega_1$ and $\omega_2$ intersect at points $A$ and $B$. A line through $B$ intersects $\omega_1$ and $\omega_2$ at points $C$ and $D$, respectively. Line $AD$ intersects $\omega_1$ at point $E \neq A$, and line $AC$ intersects $\omega_2$ at point $F \neq A$. If $O$ is the circumcenter of $\triangle AEF$, prove that $OB \perp CD$.
2 replies
Kyj9981
Today at 11:53 AM
Double07
an hour ago
Diophantine equation
PaperMath   9
N an hour ago by gaussiemann144
Find the $5$ smallest positive solutions of $x$ that has an integer $k$ that satisfies $x^2=3k^2+4$
9 replies
PaperMath
Mar 12, 2025
gaussiemann144
an hour ago
How many ordered pairs of numbers can we find?
BR1F1SZ   2
N 2 hours ago by BR1F1SZ
Source: 2024 Argentina TST P6
Given $2024$ non-negative real numbers $x_1, x_2, \dots, x_{2024}$ that satisfy $x_1 + x_2 + \cdots + x_{2024} = 1$, determine the maximum possible number of ordered pairs $(i, j)$ such that
\[
x_i^2 + x_j \geqslant \frac{1}{2023}.
\]
2 replies
BR1F1SZ
Jan 25, 2025
BR1F1SZ
2 hours ago
IMO 2009, Problem 5
orl   87
N 2 hours ago by asdf334
Source: IMO 2009, Problem 5
Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths
\[ a, f(b) \text{ and } f(b + f(a) - 1).\]
(A triangle is non-degenerate if its vertices are not collinear.)

Proposed by Bruno Le Floch, France
87 replies
orl
Jul 16, 2009
asdf334
2 hours ago
1978 USAMO #1
Mrdavid445   54
N 2 hours ago by Marcus_Zhang
Given that $a,b,c,d,e$ are real numbers such that

$a+b+c+d+e=8$,
$a^2+b^2+c^2+d^2+e^2=16$.

Determine the maximum value of $e$.
54 replies
Mrdavid445
Aug 16, 2011
Marcus_Zhang
2 hours ago
The return of a legend inequality
giangtruong13   4
N 2 hours ago by Double07
Source: Legacy
Given that $0<a,b,c,d<1$.Prove that: $$ (1-a)(1-b)(1-c)(1-d) > 1-a-b-c-d $$
4 replies
giangtruong13
5 hours ago
Double07
2 hours ago
degree of f=2^k
Sayan   15
N 3 hours ago by Gejabsk
Source: ISI 2012 #8
Let $S = \{1,2,3,\ldots,n\}$. Consider a function $f\colon S\to S$. A subset $D$ of $S$ is said to be invariant if for all $x\in D$ we have $f(x)\in D$. The empty set and $S$ are also considered as invariant subsets. By $\deg (f)$ we define the number of invariant subsets $D$ of $S$ for the function $f$.

i) Show that there exists a function $f\colon S\to S$ such that $\deg (f)=2$.

ii) Show that for every $1\leq k\leq n$ there exists a function $f\colon S\to S$ such that $\deg (f)=2^{k}$.
15 replies
Sayan
May 13, 2012
Gejabsk
3 hours ago
Local-global with Fibonacci numbers
MarkBcc168   26
N 3 hours ago by pi271828
Source: ELMO 2020 P2
Define the Fibonacci numbers by $F_1 = F_2 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n\geq 3$. Let $k$ be a positive integer. Suppose that for every positive integer $m$ there exists a positive integer $n$ such that $m \mid F_n-k$. Must $k$ be a Fibonacci number?

Proposed by Fedir Yudin.
26 replies
MarkBcc168
Jul 28, 2020
pi271828
3 hours ago
Cauchy functional equations
syk0526   10
N 3 hours ago by imagien_bad
Source: FKMO 2013 #2
Find all functions $ f : \mathbb{R}\to\mathbb{R}$ satisfying following conditions.
(a) $ f(x) \ge 0 $ for all $ x \in \mathbb{R} $.
(b) For $ a, b, c, d \in \mathbb{R} $ with $ ab + bc + cd = 0 $, equality $ f(a-b) + f(c-d) = f(a) + f(b+c) + f(d) $ holds.
10 replies
syk0526
Mar 24, 2013
imagien_bad
3 hours ago
Three circles are concurrent
Twoisaprime   21
N 3 hours ago by L13832
Source: RMM 2025 P5
Let triangle $ABC$ be an acute triangle with $AB<AC$ and let $H$ and $O$ be its orthocenter and circumcenter, respectively. Let $\Gamma$ be the circle $BOC$. The line $AO$ and the circle of radius $AO$ centered at $A$ cross $\Gamma$ at $A’$ and $F$, respectively. Prove that $\Gamma$ , the circle on diameter $AA’$ and circle $AFH$ are concurrent.
Proposed by Romania, Radu-Andrew Lecoiu
21 replies
Twoisaprime
Feb 13, 2025
L13832
3 hours ago
p + q + r + s = 9 and p^2 + q^2 + r^2 + s^2 = 21
who   28
N Sunday at 11:00 PM by asdf334
Source: IMO Shortlist 2005 problem A3
Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.
28 replies
who
Jul 8, 2006
asdf334
Sunday at 11:00 PM
p + q + r + s = 9 and p^2 + q^2 + r^2 + s^2 = 21
G H J
G H BBookmark kLocked kLocked NReply
Source: IMO Shortlist 2005 problem A3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
who
190 posts
#1 • 4 Y
Y by Davi-8191, Adventure10, Mango247, and 1 other user
Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
silouan
3952 posts
#2 • 12 Y
Y by tenplusten, B.J.W.T, rashah76, Vieta827, Adventure10, megarnie, SerdarBozdag, Jalil_Huseynov, teomihai, Quidditch, Mango247, and 1 other user
WLOG assume that $p\geq q\geq r\geq s$ .
Easily $pq+rs+pr+qs+ps+qr\leq 30$ and from the first $pq+rs\geq 10$ . Now put $p+q=t$

Then $t^{2}+(t-9)^{2}\geq 41$ so $(t-4)(t-5)\geq 0$ and since
$t\geq r+s$ we find that $25\leq 21-r^{2}-s^{2}+2pq\leq 21+2(pq-rs)$ and QED
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
campos
411 posts
#3 • 6 Y
Y by dangerousliri, rashah76, Adventure10, Mango247, bin_sherlo, and 1 other user
use that $2(x^{2}+y^{2})=(x+y)^{2}+(x-y)^{2}$. then,

$84=4(p^{2}+q^{2}+r^{2}+s^{2})=(p+q+r+s)^{2}+(p+q-r-s)^{2}+(p+r-q-s)^{2}+(p+s-q-r)^{2}$

this implies that $(p+q-r-s)^{2}+(p+r-q-s)^{2}+(p+s-q-r)^{2}=3$, then

$\max\{|p+q-r-s|,|p+r-q-s|,|p+s-q-r|\}\geq 1$.

suppose wlog that $|p+q-r-s|\geq 1$, then this implies that

$2(p+q)-9=p+q-r-s\geq 1$ or $2(r+s)-9=r+s-p-q\geq 1$

the first case implies that $p+q\geq 5$, while the second that $r+s\geq 5$. suppose wlog that $p+q\geq 5$

then, $21+2(pq-rs)=(p+q)^{2}+(r-s)^{2}\geq 25$, from where we conclude that $pq-rs\geq 2$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mathias_DK
1312 posts
#4 • 2 Y
Y by Adventure10, Mango247
who wrote:
Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.
Let $a \ge b \ge c \ge d$.
$ab-cd \ge \frac{1}{2}(c+d)(a+b-c-d) \iff$
$2ab+c^2+d^2 \ge ac+ad+bc+bd$. Since $c^2+d^2 \ge 2cd$ it suffices to prove:
$2ab+2cd \ge ac+ad+bc+bd \iff$
$(a-d)(b-c) + (a-c)(b-d) \ge 0$.
And:
$3(a+b-c-d)^2 \ge 3 = 4(a^2+b^2+c^2+d^2)-(a+b+c+d)^2 \iff$
$2ab+2cd \ge ac+ad+bc+bd$ is true, so $a+b-c-d \ge 1$.
Let $a+b-c-d = t$. Then $\frac{1}{2}(c+d)(a+b-c-d) = \frac{1}{4}(2c+2d)(a+b-c-d) = \frac{1}{4}(9-t)t$, which is increasing on $(-\infty;4.5]$ so $\frac{1}{4}(9-t)t \ge \frac{1}{4}(9-1)\cdot1 = 2$, so $ab-cd \ge 2$.
(There is equality only for $(a,b,c,d) = (3,2,2,2)$)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Zhero
2043 posts
#5 • 1 Y
Y by Adventure10
Here's another solution. It's not nearly as elegant, but in my opinion it is much more straightforward:

WLOG, let $p \geq q \geq r \geq s$. I claim that $pq - rs \geq 2$. I also claim that the result true not only when $p^2 + q^2 + r^2 + s^2 = 21$, but also when $p^2 + q^2 + r^2 + s^2 \geq 21$, provided that $s > \frac{1}{4}$.

But we may always suppose that $s > \frac{1}{4}$! If $s \leq \frac{1}{4}$, then $p+q+r = 9-s \geq \frac{71}{4}$. It follows that $p^2 + q^2 + r^2 \geq \left(\frac{p+q+r}{3}\right)^2 \geq \left(\frac{71}{12}\right)^2 > 5^2 = 25 > 21$, which is a contradiction, so we may indeed always suppose that $s \geq \frac{1}{4}$.

Replacing $p$ and $q$ with $p_0 = p+q - r$ and $q_0 = r$ preserves $p_0 \geq q_0 \geq r \geq s$, $p_0 + q_0 + r + s \geq 2$, and $p_0^2 + q_0^2 + r^2 + s^2 \geq 21$. In addition, $p_0q_0 - rs = pr + qr - r^2 - rs \leq pq - rs$ (since $(p-r)(q-r) \geq 0$.) Hence, we may suppose without loss of generality that $q=r$.

We reformulate our problem as follows: when $p \geq q \geq s \geq \frac{1}{4}$, $p+2q+s = 9$, and $p^2 + 2q^2 + s^2 \geq 21$, then $q(p-s) \geq 2$.

Let $k = \frac{q-s}{2}$. Let $p' = p + k$, $s' = s + k$, and $q' = q - k$. We see that $p' + 2q' + s' = 9$, $q'(p-s') = (q-k)(p-s) \leq q(p-s)$, and that
\begin{align*}
p'^2 + 2q'^2 + s'^2 
&= p^2 + 2q^2 + s^2 + 4k^2 + 2k(p+s-2q) \\
&= p^2 + 2q^2 + s^2 + (p-s)^2 + (p-s)(p+s-2q) \\
&= p^2 + 2q^2 + s^2 + 2(p-q)(q-s) \\
&\geq p^2 + 2q^2 + s^2 \geq 21. \end{align*}
Observing that $s' = q'$ and that $s' \geq s$, we see that it is sufficient to prove this inequality when $q=s$.

We reformulate our problem again: when $p \geq q \geq \frac{1}{4}$, $p+3q = 9$, and $p^2 + 3q^2 \geq 21$, then $pq - q^2 \geq 2$. $9 = p + 3q \leq 4q$, so $q \leq \frac{9}{4}$. $p^2 + 3q^2 = (9-3q)^2 + 3q^2 \geq 21$, so $12q^2 - 54q + 81 \geq 21$, so $2q^2 - 9q + 10 \geq 0$, so $(q-2)(2q-5) \geq 0$, so $q \leq 2$ or $q \geq \frac{5}{2}$. But $q \leq \frac{9}{4}$, so we must have that $q \leq 2$.

$pq - q^2 = (9-3q)q - q^2 = 9q - 4q^2$. Since $9q - 4q^2$ is concave in $q$, it attains its minimum when $q$ is either maximized or minimized. $\frac{1}{4} < q \leq 2$; but at both $q = \frac{1}{4}$ and $q = 2$, $9q - 4q^2 = 2$, so we see that $pq - q^2$ must always be greater than or equal to 2, which completes our proof.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math154
4302 posts
#6 • 2 Y
Y by Adventure10, Mango247
I'm posting this for the same reason as Zhero.

Let $p\ge q\ge r\ge s$ as everyone else did, and note that by Cauchy-Schwarz, we have
\[0\le 3(21-s^2)-(9-s)^2=2(2s-3)(3-s),\]whence $3/2\le s\le 3$. In particular, $s>0$. Now define nonnegative reals $m,n$ such that
\[(p+q,p^2+q^2,r+s,r^2+s^2)=(9/2+m,21/2+n,9/2-m,21/2-n).\]Then
\[2pq-2rs=(p+q)^2-(r+s)^2-(p^2+q^2)+(r^2+s^2)=18m-2n\]and
\begin{align*}
0\le(p-q)^2=2(p^2+q^2)-(p+q)^2=(21+2n)-(9/2+m)^2=3/4+2n-9m-m^2\\
0\le(r-s)^2=2(r^2+s^2)-(r+s)^2=(21-2n)-(9/2-m)^2=3/4-2n+9m-m^2.
\end{align*}By the latter, we have
\[pq-rs-2=9m-n-2\ge9m-(3/8+9m/2-m^2/2)-2=(2m-1)(2m+19)/8.\]Thus it suffices to show that $m\ge1/2$. But this is clear: since $q\ge r$, we obtain
\[q=(9/2+m)-\sqrt{(p-q)^2}\ge(9/2-m)+\sqrt{(r-s)^2}=r,\]or
\[2m\ge\sqrt{(p-q)^2}+\sqrt{(r-s)^2}\ge\sqrt{(p-q)^2+(r-s)^2}=\sqrt{3/2-2m^2},\]whence
\[4m^2\ge3/2-2m^2\implies m\ge1/2,\]as desired.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Wolstenholme
543 posts
#7 • 5 Y
Y by Swag00, ValidName, ehuseyinyigit, Adventure10, Mango247
Assume WLOG that $ p \ge q \ge r \ge s $. Note that $ pq + pr + ps + qr + qs + rs = \frac{(p + q + r + s)^2 - (p^2 + q^2 + r^2 + s^2)}{2} = 30 $. By the rearrangement inequality, we have that $ pq + rs = \max(pq + rs, pr + qs, ps + qr) $ and so $ pq + rs \ge 10 $. Letting $ x = p + q $ we have that $ x^2 + (x - 9)^2 = 21 + 2(pq + rs) \ge 41 $ which becomes $ (x - 4)(x - 5) \ge 0 \Longrightarrow x \ge 5 $. This means that $ 2\sqrt{rs} \le r + s \le 4 \Longrightarrow rs \le 4 $. But since $ pq + rs \ge 10 $ this means that $ pq \ge 6 $ and so we are done.

Now I want to discuss motivation. After some playing around we see the only equality case is $ (p, q, r, s) = (3, 2, 2, 2) $. Now, looking at this, we want the extreme values of the sum of the two biggest or the two smallest to be greater than $ 5 $ and less than $ 4 $ respectively, so letting $ x = p + q $ we want to get exactly the equation $ (x - 4)(x - 5) \ge 0 $. Now we want an $ x - 9 $ in there somewhere, and rearranging it turns out we want $ x^2 + (x - 9)^2 \ge 41. $ But this is the same as $ pq + rs \ge 10 $, and when looking at a sum like this, the rearrangement inequality should come to mind immediately.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Th3Numb3rThr33
1247 posts
#8 • 1 Y
Y by Adventure10
Solved with eisirrational. We believe that this solution, although ``ugly" (compared to, say, post 2), is straightforward. (Of course, here, the solution is presented backwards.)

Without loss of generality assume $p \leq q \leq r \leq s$. The central claim is $p+q \leq 4$. Set $(x,y) = (p+q,p^2+q^2)$. Then
\begin{align*}
q &= \frac{1}{2}((p+q) + |p-q|) = \frac{1}{2}\left(x + \sqrt{2y-x^2}\right), \\
r &= \frac{1}{2}((r+s) - |r-s|) = \frac{1}{2}\left((9-x) - \sqrt{2(21-y) - (9-x)^2}\right).
\end{align*}Then we have $q \leq r$, which yields
$$x + \sqrt{2y-x^2} \leq (9-x) - \sqrt{2(21-y) - (9-x)^2} \implies \sqrt{(2y-x^2)(2(21-y) - (9-x)^2)} \leq 3(x-4)(x-5),$$so $3(x-4)(x-5) \geq 0$, id est $x \leq 4$ (as $p+q \leq \tfrac{1}{2}(p+q+r+s) = 4.5$).

Then by Cauchy-Schwarz,
$$(p-4.5)^2 + (q-4.5)^2 \geq \frac{(p+q-9)^2}{2} \geq 12.5.$$But this expands to $p^2 + q^2 - 9p - 9q \geq -28$, which yields
\begin{align*}
2 &\leq p^2 + q^2 - 9p - 9q + 30 \\
&= \frac{1}{2}((9-p-q)^2 - (21 - p^2 - q^2)) - pq \\
&= \frac{1}{2}((r+s)^2 - (r^2+s^2)) - pq \\
&= rs - pq,
\end{align*}as desired. Equality holds when $p+q = 4$, id est when $(p,q,r,s) = (2,2,2,3)$.
This post has been edited 1 time. Last edited by Th3Numb3rThr33, Nov 29, 2019, 4:47 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
teomihai
2944 posts
#9 • 2 Y
Y by Adventure10, Mango247
nice solutions!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
william122
1576 posts
#10 • 2 Y
Y by teomihai, Adventure10
WLOG $p\ge q\ge r\ge s$. If $s$ is negative, then $p+q+r\ge 9\implies p+q\ge 6$. So, $$(p+q)^2+(r-s)^2>36>25\implies 2(pq-rs)>4$$Hence, we can assume that $s\ge 0$. Now, the permutation which maximizes $ab-cd$ is $(p,q,r,s)$, so assume the contrary, namely that $pq-rs<2$. Now, consider replacing $(r,s)\to\left(\frac{r+s}{2},\frac{r+s}{2}\right)$, and $(p,q)$ with suitable numbers such that both conditions are still preserved. Obviously, we still have $p\ge q\ge r\ge s\ge 0$, and this decreases $pq-rs$, hence we only need to prove the case where $r=s$.

In this case, $p+q=9-2s$, $p^2+q^2=21-2s^2\implies 2pq=6s^2-36s+60\implies (p-q)^2=-8s^2+36s-39$. Solving, $q=\frac{1}{2}\left(9-2s-\sqrt{-8s^2+36s-39}\right)$. On the other hand, $pq<2+s^2\implies 3s^2-18s+30<2+s^2\implies s^2-9s+14<0\implies s>2$. As $s$ is the smallest, it lies in the interval $2<s<2.25$. As $s$ increases in this range, both $2s$ and $-8s^2+36s-39$ increase, so $q$ decreases. Hence, $q<\frac{1}{2}\left(9-4-\sqrt{1}\right)=2$, and we get $q<s$, which is a contradiction, as desired.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Wizard_32
1566 posts
#11 • 3 Y
Y by teomihai, amar_04, A-Thought-Of-God
who wrote:
Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.
Assume that $\max\{pq,pr,ps,rq,rs,qs\}=pq,$ and assume on the contrary that $pq<rs+2.$ Since $pq+pr+ps+rq+rs+qs=60,$ hence $pq \geqslant 10.$ In particular, this means $2+rs>10 \implies rs>8>0.$ Then since $p^2,q^2,r^2,s^2$ are positive reals, hence by AM-GM
\begin{align*}
    8^2 < (rs)^2 \leqslant pqrs \leqslant \left( \frac{p^2+q^2+r^2+s^2}{4}\right)^2 \implies 8^2 \cdot 4^2 < 21^2
\end{align*}which is clearly false. $\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
TheUltimate123
1739 posts
#12 • 3 Y
Y by teomihai, eazy_math, guptaamitu1
Let \(p\ge q\ge r\ge s\). Observe that \[(pq+rs)+(pr+qs)+(ps+qr)=\frac{(p+q+r+s)^2-\left(p^2+q^2+r^2+s^2\right)}2=30,\]but by Rearrangement, \(pq+rs\ge pr+qs\ge ps+qr\), so \(pq+rs\ge10\).

Note the following: \begin{align*}     (p+q)+(r+s)&=9\\     (p+q)^2+(r+s)^2&\ge41. \end{align*}Since \(p+q\ge r+s\), we must have \(p+q\ge5\).

Finally, \[25\le(p+q)^2+(r-s)^2=21+2(pq-rs),\]so \(pq-rs\ge2\), as needed. Equality holds at \((p,q,r,s)=(3,2,2,2)\)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sqing
41080 posts
#13
Y by
Let $a, b, c,$ and $d$ be real numbers such that $a \geq b \geq c \geq d$ and $a+b+c+d = 13,a^2+b^2+c^2+d^2=43.$ Show that $$ab-cd \geq 3 .$$Equality holds for $(4,3,3,3).$
2021 Philippine
Attachments:
This post has been edited 3 times. Last edited by sqing, Apr 9, 2021, 1:43 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hydo2332
435 posts
#14 • 1 Y
Y by teomihai
TheUltimate123 wrote:
Let \(p\ge q\ge r\ge s\). Observe that \[(pq+rs)+(pr+qs)+(ps+qr)=\frac{(p+q+r+s)^2-\left(p^2+q^2+r^2+s^2\right)}2=30,\]but by Rearrangement, \(pq+rs\ge pr+qs\ge ps+qr\), so \(pq+rs\ge10\).

Note the following: \begin{align*}     (p+q)+(r+s)&=9\\     (p+q)^2+(r+s)^2&\ge41. \end{align*}Since \(p+q\ge r+s\), we must have \(p+q\ge5\).

Finally, \[25\le(p+q)^2+(r-s)^2=21+2(pq-rs),\]so \(pq-rs\ge2\), as needed. Equality holds at \((p,q,r,s)=(3,2,2,2)\)

"$(p+q)+(r+s)=9   (p+q)^2+(r+s)^2 \ge41.$ Since $ (p+q\ge r+s )$, we must have $(p+q\ge5).$"

How do you get $p+q \geq $ ?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hydo2332
435 posts
#15
Y by
Wizard_32 wrote:
who wrote:
Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.
Assume that $\max\{pq,pr,ps,rq,rs,qs\}=pq,$ and assume on the contrary that $pq<rs+2.$ Since $pq+pr+ps+rq+rs+qs=60,$ hence $pq \geqslant 10.$ In particular, this means $2+rs>10 \implies rs>8>0.$ Then since $p^2,q^2,r^2,s^2$ are positive reals, hence by AM-GM
\begin{align*}
    8^2 < (rs)^2 \leqslant pqrs \leqslant \left( \frac{p^2+q^2+r^2+s^2}{4}\right)^2 \implies 8^2 \cdot 4^2 < 21^2
\end{align*}which is clearly false. $\square$

$pq+pr+ps+rq+rs+qs=60$ ; this is false, actually we have $(p+q+r+s)^2 = p^2 + q^2 + r^2 + s^2 + 2(pq + pr+ps+rq+rs+qs ) = 81 = 21 + 2(pq + pr+ps+rq+rs+qs )$, and hence $pq+pr+ps+rq+rs+qs=30$. Notice this implies $5 \leq pq$, which means your solution is wrong.
This post has been edited 1 time. Last edited by hydo2332, May 1, 2021, 2:33 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathForesterCycle1
79 posts
#16
Y by
dame dame
This post has been edited 1 time. Last edited by MathForesterCycle1, Oct 17, 2021, 5:14 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
IAmTheHazard
5000 posts
#17 • 2 Y
Y by teomihai, centslordm
Here's a different solution with a weird substitution.
WLOG suppose that $p \geq q \geq r \geq s$. I will show that $pq-rs \geq 2$. Since $p+q+r+s=9$, we can substitute
\begin{align*}
p&=\frac{9}{4}+k+x\\
q&=\frac{9}{4}+k-x\\
r&=\frac{9}{4}-k+y\\
s&=\frac{9}{4}-k-y,
\end{align*}where $k,x,y\geq 0$. Since $q \geq r$, we require $2k \geq x+y$. Using the substitution, the condition $p^2+q^2+r^2+s^2=21$ becomes
$$\frac{81}{4}+\frac{9}{2}(k+x+k-x-k+y-k-y)+(k+x)^2+(k-x)^2+(k+y)^2+(k-y)^2=\frac{81}{4}+4k^2+2x^2+2y^2=21\implies 2k^2+x^2+y^2=\frac{3}{8}.$$Finally, the inequality $pq-rs\geq 2$ is equivalent to
$$9k+y^2-x^2\geq 2$$Suppose now that we fix $k$. Then it is clear that
$$9k+y^2-x^2\geq 9k-4k^2,$$and since the inequality $9k-4k^2\geq 2$ holds for $\tfrac{1}{4} \leq k \leq 2$, $pq-rs\geq 2$ holds in that range of $k$ as well. If $k>2$, then
$$2k^2+x^2+y^2\geq 2k^2>8>\frac{3}{8},$$so we cannot have $p^2+q^2+r^2+s^2=21$ in that case. Thus we can discard the case of $k>2$. If $k<\tfrac{1}{4}$, then we have
$$\frac{3}{8}=2k^2+x^2+y^2<\frac{1}{8}+x^2+y^2 \implies x^2+y^2>\frac{1}{4} \implies (x+y)^2>\frac{1}{4} \implies x+y>\frac{1}{2}>2k,$$which contradicts $2k\geq x+y$. Thus we can also discard $k<\tfrac{1}{4}$, leaving only $k \in [\tfrac{1}{4},2]$ which we already proved $pq-rs\geq 2$ for. Thus we're done. $\blacksquare$
This post has been edited 1 time. Last edited by IAmTheHazard, Aug 1, 2022, 2:13 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Afternonz
24 posts
#20
Y by
WLOG $p\ge q\ge r\ge s$. We claim that $pq-rs \ge 2$.
If $s\le 0$, then, by Cauchy-Schwarz, $21 = p^2+q^2+r^2+s^2 \ge \frac{1}{3}(p+q+r)^2+s^2 \ge \dfrac{1}{3}(9)^2+s^2 \Rightarrow s^2\le -6$ which is clearly absurd. Hence, $p,q,r,s \in \mathbb{R}^+$.
We have
\begin{align*}
	&(9-q-r-s)^2+q^2+r^2+s^2=21 \\
	\Leftrightarrow \quad &2q^2-2(9-r-s)q+(9-r-s)^2+r^2+s^2-21=0 \\
	 \Leftrightarrow \quad &q=\dfrac{2(9-r-s)\pm \sqrt{42-(2r^2+2s^2+(9-r-s)^2)}}{2}
\end{align*}If $q=\dfrac{(9-r-s)+ \sqrt{42-(2r^2+2s^2+(9-r-s)^2)}}{2}$, then
$q\le p = 9-q-r-s = q-\sqrt{42-(2r^2+2s^2+(9-r-s)^2)} \le q$ so $42-(2r^2+2s^2+(9-r-s)^2) = 0$ which will be included in the other case.
Therefore, we can assume that $q=\dfrac{(9-r-s)- \sqrt{42-(2r^2+2s^2+(9-r-s)^2)}}{2}$. We will show that $r+s\le 4$. Suppose, ftsoc, that $r+s > 4$. We have
\begin{align*}
	&\dfrac{(9-r-s)- \sqrt{42-(2r^2+2s^2+(9-r-s)^2)}}{2} \ge r \\
	\Leftrightarrow \quad &3r^2+(2s-18)r+(s^2-9s+30)\ge 0 \\
	\Leftrightarrow \quad &3\left(r+\dfrac{s-9}{3}\right)^2+\dfrac{2s^2-9s+9}{3}\ge 0
\end{align*}
Claim: $\dfrac{3}{2}\le s \le \dfrac{9}{4}$

Proof: If $s< \dfrac{3}{2}$, then $p+q+r+s \ge 3r+s > 3(4-s)+s > 12-2(\dfrac{3}{2}) = 9$, a contradiction. So $s \ge \dfrac{3}{2}$. Also, since $p+q+r+s=9$, $s\le \dfrac{9}{4}.$ $\blacksquare$

By the claim, $2s^2-9s+9= (2s-3)(s-3)\le 0$. We can now consider 2 possible cases.

Case 1: $r\ge\dfrac{9-s}{3}+\sqrt{\dfrac{-2s^2+9s-9}{9}}$
$9=p+q+r+s \ge 3r+s \ge (9-s)+3\sqrt{\dfrac{-2s^2+9s-9}{9}} +s =9+3\sqrt{\dfrac{-2s^2+9s-9}{9}}$ so $2s^2-9s+9=0 \Leftrightarrow s=3, \dfrac{3}{2}$ and $p=q=r$. By claim, $s= \dfrac{3}{2}$ giving $p=q=r=\dfrac{5}{2}.$ Thus, $r+s = 4$, a contradiction.

Case 2: $r\le\dfrac{9-s}{3}-\sqrt{\dfrac{-2s^2+9s-9}{9}}$
$s\le \dfrac{9-s}{3}-\sqrt{\dfrac{-2s^2+9s-9}{9}} \Leftrightarrow 2s^2-9s+10 \Leftrightarrow (2s-5)(s-2)\ge 0$. By claim, $s\le 2$.
However, $4-s < r \le\dfrac{9-s}{3}-\sqrt{\dfrac{-2s^2+9s-9}{9}} \Rightarrow 2s^2-7s+6>0 \Leftrightarrow (s-2)(2s-3)>0$, which is a oontradiction since $\dfrac{3}{2}\le s\le2$.

We therefore have that $r+s \le 4$ and
\begin{align*}
	pq-rs &= (9-q-r-s)q-rs\\
	&= \dfrac{81-((9-q-r-s)^2+q^2+r^2+s^2)}{2}+(r^2+s^2)-9(r+s) \\
	&= 30 +(r^2+s^2)-9(r+s) \\
	&= 22 + (r^2+4) +(s^2+4) -9(r+s) \\
	&\ge 22 -5(r+s) \\
	&\ge 2
\end{align*}as desired.
This post has been edited 1 time. Last edited by Afternonz, Aug 28, 2021, 7:21 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
guptaamitu1
656 posts
#21 • 1 Y
Y by teomihai
Here's a different solution (which is a bit longer, though every step is easily motivated):
WLOG $p \le q \le r \le s$. We will show $pq - rs \ge 2$. Observe,
$$\sum_{\text{sym}} pq = \frac{p^2 - 21}{2} = 30 \implies \sum_{\text{sym}} (p-q)^2 = 3 \cdot 21 - 2 \cdot 30 = 3 \qquad \qquad (1)$$Let $p-q = x, p - r = y, p -s = z$. Observe $0 \le x \le y \le z$. Then $p = \frac{p+x+y+z}{4}$, thus
\begin{align*}
T &= pq - rs = p(p-x) - (p-y)(p-z) = p^2 - px - p^2 + p(y+z) - yz = p(y+z-x) - yz \\
&= \frac{(9 + x + y +z)(y+z-x)}{4} - yz = \frac{\left( y +z + \frac{9}{2} \right) - \left(x + \frac{9}{2} \right) }{4} - yz \\
&= \frac{ y^2 + z^2 + 9y + 9z + 2yz - x^2 - 9x }{4} - \frac{yz}{2} = \frac{9(y+z-x) + y^2 + z^2 - x^2}{4} - \frac{yz}{2} \\
&= \frac{9(y+z-x) + (z-y)^2 - x^2}{4} \ge \frac{9(y+z-x) - x^2}{4}
\end{align*}So it suffices to show $S = 9(y+z-x) - x^2 \ge 8$.

Claim: $x \le 1$ and $3z^2 + y - x \ge 3$.
Proof: Using $(1)$ we have $3 \ge x^2 + y^2 + z^2 = 3x^2$, giving $x \le 1$. Also,
\begin{align*}
3 - 3z^2 &= x^2 + y^2 + z^2 + (x-y)^2 + (y-z)^2 + (z-x)^2 - 3z^2 = 3(x^2 + y^2) - 2z(x+y) - 2xy  \\
&= x(3x - 2z - 2y) + y(3y - 2z) \le x(3x - 4y) + y^2 = (y-x)(y-3x) \le y-x
\end{align*}This proves our claim. $\square$

Now if $z \ge 1$, then $S \ge 9z - x^2 \ge 9 - 1 = 8$. Otherwise, if $z \le 1$ then
\begin{align*}
S \ge 9(3 + z - 3z^2) - 1 = 26 + 9z - 27z^2 = 8 + 9(2 + z - 3z^2) = 8 + 9(1-z)(2+z) \ge 8
\end{align*}This completes the proof. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math90
1474 posts
#22 • 1 Y
Y by teomihai
Nothing new here.

WLOG assume that $p\ge q\ge r\ge s$.

Note that
$$pq+rs+pr+qs+ps+qr=\frac{(p+q+r+s)^2-(p^2+q^2+r^2+s^2)}{2}=30.$$Since $p\ge q\ge r\ge s$ we have $pq+rs=\max(pq+rs,pr+qs,ps+qr)$. Hence $pq+rs\ge 10$. This proves that
$$(p+q)^2+(r+s)^2=(p^2+q^2+r^2+s^2)+2(pq+rs)\ge 21+2\cdot 10=41.$$Now let $t\doteqdot p+q$. Then $t^2+(9-t)^2\ge 41$, or equivalently $(t-4)(t-5)\ge 0$. As $t\ge 4.5$ we obtain $t\ge 5$. Therefore
$$(p+q)^2\ge 25=p^2+q^2+r^2+s^2+4\ge p^2+q^2+2rs+4.$$This rearranges to $pq-rs\ge 2$.
This post has been edited 1 time. Last edited by math90, May 10, 2022, 8:22 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
awesomeming327.
1664 posts
#23 • 2 Y
Y by teomihai, lian_the_noob12
Note that we have $pq+pr+ps+qr+qs+rs=30.$ Let $p\ge q\ge r\ge s$ and consider $pq-rs.$ Note that $pq+rs\ge pr+qs\ge ps+qr$ so $pq+rs\ge 10.$ Let $a=p+q$ and $b=r+s$ then $(p+q)^2\ge 4pq$ gives:
\[a+b=9\]\[a^2+b^2\ge 40\]Thus, $-(a-b)^2=(a^2+b^2+2ab)-2(a^2+b^2)\le -1$ so $a-b\ge 1.$ This implies $a\ge 5.$ Therefore, we have $(p+q)^2+(r-s)^2\ge 25.$ On the other hand $(p+q)^2+(r-s)^2=p^2+q^2+r^2+s^2+2(pq-rs)=21+2(pq-rs)$ so $pq-rs\ge 4$ as desired.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DakuMangalSingh
72 posts
#24 • 1 Y
Y by teomihai
ISL Marabot Solve

WLOG, $p\geq q\geq r\geq s$. We will prove, $pq-rs\geq 2$.

FTSOC, let $pq-rs < 2$.
Now $\sum_{sym} pq = \frac{(p+q+r+s)^2-(p^2+q^2+r^2+s^2)}{2}=30$, So, by rearrangement inequality, $pq+rs\geq 10$. If $rs < 4$ then $pq-rs= pq+rs - 2rs > 10-8=2$, But as we assumed, this is not true. So, $rs\geq 4 \implies \frac{r^2+s^2}{2}\geq rs \geq 4\implies r^2+s^2\geq 8$ (By, AM-GM). Now, $p^2+q^2-r^2-s^2=\sum p^2 - 2(r^2+s^2)\leq 21-2\times 16=5$.

Now let $p+q=x, r+s=9-x$ So, $\sum p^2 + 2(pq+rs)\geq 21+2\times 10=41 \implies (p+q)^2+(r+s)^2=(x^2)+(9-x)^2\geq 41$ $\implies (x-5)(x-4)\geq 0 \implies x\geq 5$ or $x\leq 4$, Since $p\geq q\geq r\geq s$ and $\sum p = 9$, so, $x=p+q\geq 5$ and $9-x=r+s\leq 4$

So, $(p+q)^2-(r+s)^2= p^2+q^2-r^2-s^2+2(pq-rs)\geq 5^2-4^2=9 \implies 2(pq-rs)\geq 9-(p^2+q^2-r^2-s^2)\geq 9-5=4$ $\implies pq-rs\geq2$. But we guessed, $pq-rs<2$. So, by contradiction, $pq-rs\geq 2$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
VicKmath7
1385 posts
#25 • 1 Y
Y by teomihai
Solution
This post has been edited 3 times. Last edited by VicKmath7, May 25, 2023, 12:38 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
lian_the_noob12
173 posts
#26
Y by
$\color{green} \boxed{\textbf{SOLUTION}}$

We have,
$$(p+q+r+s)^2=p^2+q^2+r^2+s^2+2(pq+pr+ps+qr+qs+rs)=81 \implies pq+pr+ps+qr+qs+rs=30$$
Assume, $p \ge q \ge r \ge s$

We need to show, $pq-rs \ge 2$

By Rearrangement Inequality,
$$ pq+rs \ge pr+qs \ge ps+qr$$
So, $pq+rs \ge 10$

Now, $$(p+q)^2 + (r+s)^2=p^2+q^2+r^2+s^2+2(pq+rs) \ge 41$$
$$2[(p+q)^2+(r+s)^2]=[(p+q)+(r+s)]^2 + [(p+q)-(r+s)]^2 \implies -[(p+q)-(r+s)]^2=[(p+q)+(r+s)]^2-2[(p+q)^2+(r+s)^2] \le 81-82= -1$$So, $(p+q)-(r+s) \ge 1$
And, $p+q \ge 5$

$$2(pq-rs)=p^2+q^2+r^2+s^2+2pq-2rs-21=(p+q)^2 + (r-s)^2 - 21 \ge 25+(r-s)^2-21 \ge 4 \implies pq-rs \ge 2 \blacksquare$$
This post has been edited 5 times. Last edited by lian_the_noob12, Jun 9, 2023, 9:26 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
huashiliao2020
1292 posts
#27 • 1 Y
Y by teomihai
who wrote:
Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.

This problem reminds me of several similar ones relating $a_1+...+a_n=k$ with $a_1^2+...+a_n^2=l^2$ and trying to maximize an element lol (for example in particular that AMSP test 3 Level 2 question or smth or that USAMO 1978 or smth like that
WLOG $p\ge q\ge r\ge s.$ We see that $$pq+rs+pr+ps+qr+qs=30\implies pq+rs\ge 10$$by rearrangement ineq. Then note that we want to find maximum of rs so that we can subtract it. To do this, we want to maximize the sum r+s, so we are motivated to set t=r+s, otherwise it would be hard to show a maximum sum that also satisfies the second equality. Now, $$t^2+(9-t)^2=p^2+q^2+2pq+r^2+s^2+2rs=41\implies (t-4)(t-5)\ge 0\iff 4\ge t=r+s,$$where the last step is because $r+s\le 9/2<5$ so it couldn't be bounded below by 5. Indeed, we see that maximum of rs=4 when r=s=2, and the inequality still holds since $$pq+4\ge 10\iff pq\ge 6\implies pq-rs\ge 2. \blacksquare$$
This post has been edited 1 time. Last edited by huashiliao2020, Jul 31, 2023, 4:42 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
meduh6849
354 posts
#28
Y by
WLOG $p >= q >= r >= s$. Then we aim to prove that $pq - rs >= 2$.
We know that $r + s = 9 - p - q$, and that $r^2 + s^2 = 21 - p^2 - q^2$
So, $r^2 + s^2 + 2rs = 81 + p^2 + q^2 - 18p - 18q - 2pq$, or that
$2rs = 60 + 2p^2 + 2q^2 - 18p - 18q - 2pq$
$rs - pq = 30 + p^2 + q^2 - 9p - 9q - 2pq$
$pq - rs = 2pq - p^2 - q^2 + 9p + 9q - 30$
So, we have that $pq - rs >= 2$ is the same as $2pq - p^2 - q^2 + 9p + 9q - 30 >= 2$
Or, $9(p+q) >= 32 + (p-q)^2$
Clearly, $(p+q) >= \frac{9}{2}$, so $9(p+q) >= \frac{81}{2}$
So, we have $\frac{17}{2} >= (p-q)^2$.
The maximum value of ${p,q,r,s}$ is $3$, and the minimum value is $\frac{3}{2}$, so $p-q$ cannot exceed $3/2$, or $(p-q)^2$ cannot exceed $9/4 < 17/2$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
shendrew7
792 posts
#29 • 2 Y
Y by teomihai, Safal
Assume WLOG $p \ge q \ge r \ge s$. We aim to show $pq-rs \ge 2$. Notice
\[\sum_{\text{cyc}} ab = \tfrac 12(9^2-21) = 30 \implies pq+rs \ge 10\]
by Rearrangement inequality. We also have
\[(p+q)^2+(r+s)^2 = 21+2(pq+rs) \ge 41 \implies p+q \ge 5\]
from the first condition and $p+q \ge r+s$. Finally,
\[25 \leq (p+q)^2+(r-s)^2 = 21+2(pq-rs) \implies pq-rs \ge 2. \quad \blacksquare\]
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
OronSH
1720 posts
#30
Y by
Make the substitution $(p,q,r,s)=(a+2,b+2,c+2,d+2)$ such that $a+b+c+d=1,a^2+b^2+c^2+d^2=1.$ WLOG $a\ge b\ge c\ge d.$ If $c,d\le 0$ then $c+d\le 0.$ If $d>0$ then $1>a,b,c,d>0$ but $a>a^2$ in this range, impossible.

Now suppose $a\ge b\ge c\ge 0\ge d$ and $c+d>0.$ Notice we can get $ab+bc+cd+da+ac+bd=(a+b)(c+d)+ab+cd=0,$ and $a+b\ge c+d>0$ so $ab+cd<0.$ Now $ab$ is positive and $cd$ is negative so $|ab|<|cd|.$ Since $|b|>|c|$ we have $|a|<|d|$ so $a+d<0.$

Now \[a+d<0\implies b+c>1\implies b^2+c^2>\tfrac12\implies a^2+d^2<\tfrac12\implies a^2<\tfrac14\implies a<\tfrac12\implies b,c<\tfrac12\implies b+c<1,\]contradiction. Thus $c+d\le 0.$

We have shown $c+d\le 0$ always, so $a+b\ge 1$ and $p+q\ge 5.$ Then $(p+q)^2+(r-s)^2=21+2(pq-rs)\ge 25,$ done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
asdf334
7580 posts
#31 • 1 Y
Y by OronSH
had a bad bashy method that i couldn't finish so here goes the better solution with some of what i thought could be nice motivation.

also missed @above method which also fits into this idea of "doing some algebra-y tricks" i guess i should try putting that idea into my toolkit ig
Assume that $p\ge q\ge r\ge s$. Evidently the signs of $(p,q,r,s)$ must be one of $(+,+,-,-)$, $(+,+,+,-)$, or $(+,+,+,+)$, as $(-,-,-,-)$ obviously fails and having only $p$ positive would cause $p^2>21$.

In the latter two cases, the optimal permutation that maximizes the value of $ab-cd$ is evidently the original order of $(p,q,r,s)$, so that it remains to prove $pq-rs\ge 2$. In the first case, this is also true; we will ultimately have to subtract two numbers of the same sign, so we should make the magnitude of one product as large as possible, which is achieved with $pq$ (as these two have a magnitude of sum which is larger than the magnitude of sum of $r$ and $s$).

Hence it remains to prove only that $pq-rs\ge 2$, so that we have dropped the "exists a permutation" condition---effectively we just have a single concrete statement to prove. It's technically "stronger" in the sense that it may not be the best difference of two products that we could have picked, but it turns out it works.
Okay this is where I started to bash. But following the idea of just doing a little amount of algebra-y tricks, let's realize that $pq$ is closely related to $p^2+2pq+q^2$. In light of this, let's consider
\[(p+q)^2+(r-s)^2=p^2+q^2+r^2+s^2+2pq-2rs=21+2pq-2rs\]which is especially nice as it uses a condition given in the problem (sum of the squares) while also using $pq-rs$, the expression of interest.

Here's the sort of sketchy part. The way I'm going to look at this is from the perspective of "brainstorming"---it's not the kind of thing that you know is going to work right off the bat, but it's an idea that you have to brainstorm and then as you brainstorm other ideas you realize that the idea I'm about to talk about proves useful.

We know that $\sum{pq}=30$ from squaring the first given condition and subtracting the second. Then, seeing that we are working with $pq$ minus $rs$, it is quite reasonable and even important if we're keeping track of things that could be useful in the future to note that $pq+rs\ge 10$ by Rearrangement (which I need to look at along with other inequality theorems and inequalities in general).

At this point, the brainstorming idea of using $(p+q)^2$ is back. This time, we still want the final expression to have $p^2+q^2+r^2+s^2$, but we also want $pq$ to be ADDED to $rs$. When we realize that the resulting expression of
\[(p+q)^2+(r+s)^2=21+2pq+2rs\ge 41\]also uses $r+s$, it becomes even better: we can write $t=p+q$ to get
\[t^2+(9-t)^2=2t^2-18t+81\ge 41\implies (t-4)(t-5)\ge 0\]and that means $t=p+q\ge 5$, since we also have $p+q\ge r+s$.
Now we're just done: we have brainstormed all of this nice information, and it comes together in the following:
\[25\le (p+q)^2\le (p+q)^2+(r-s)^2=21+2pq-2rs\implies 2\le pq-rs.\]yahoo that was actually quite fun to write okay and we're done and i feel like i sort of learned something here about knowing how to brainstorm even and committing to thinking of just any ideas that might be useful even if i don't see a path to the solution or progress immediately which is nice hopefully that serves me well on usamo dunno tho locked in next question here goes ig guh sus yoink $\blacksquare$
Z K Y
N Quick Reply
G
H
=
a