Stay ahead of learning milestones! Enroll in a class over the summer!

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
(a-1)(b-1)(c-1) is a divisor of abc-1
ehsan2004   22
N 25 minutes ago by reni_wee
Source: IMO 1992, Day 1, Problem 1
Find all integers $\,a,b,c\,$ with $\,1<a<b<c\,$ such that \[ (a-1)(b-1)(c-1)  \] is a divisor of $abc-1.$
22 replies
ehsan2004
Jan 22, 2005
reni_wee
25 minutes ago
Balkan MO 2025 p1
Mamadi   0
36 minutes ago
Source: Balkan MO 2025
An integer \( n > 1 \) is called good if there exists a permutation \( a_1, a_2, \dots, a_n \) of the numbers \( 1, 2, 3, \dots, n \), such that:

\( a_i \) and \( a_{i+1} \) have different parities for every \( 1 \le i \le n - 1 \)

the sum \( a_1 + a_2 + \dots + a_k \) is a quadratic residue modulo \( n \) for every \( 1 \le k \le n \)

Prove that there exist infinitely many good numbers, as well as infinitely many positive integers which are not good.

Remark: Here an integer \( z \) is considered a quadratic residue modulo \( n \) if there exists an integer \( y \) such that \( y^2 \equiv z \pmod{n} \).
0 replies
2 viewing
Mamadi
36 minutes ago
0 replies
Number theory
MathsII-enjoy   3
N an hour ago by KevinYang2.71
Prove that when $x^p+y^p$ | $(p^2-1)^n$ with $x,y$ are positive integers and $p$ is prime ($p>3$), we get: $x=y$
3 replies
MathsII-enjoy
Yesterday at 3:22 PM
KevinYang2.71
an hour ago
Inspired by Bet667
sqing   1
N an hour ago by ytChen
Source: Own
Let $ a,b $ be a real numbers such that $a^2+kab+b^2\ge a^3+b^3.$Prove that$$a+b\leq k+2$$Where $ k\geq 0. $
1 reply
sqing
5 hours ago
ytChen
an hour ago
4-var inequality
sqing   1
N an hour ago by arqady
Source: SXTB (4)2025 Q2837
Let $ a,b,c,d> 0  $. Prove that
$$   \frac{1}{(3a+1)^4}+ \frac{1}{(3b+1)^4}+\frac{1}{(3c+1)^4}+\frac{1}{(3d+1)^4} \geq \frac{1}{16(3abcd+1)}$$
1 reply
sqing
5 hours ago
arqady
an hour ago
Extremaly hard inequality
blug   1
N an hour ago by arqady
Source: Polish Math Olympiad Training Camp 2024
Let $a, b, c$ be non-negative real numbers. Prove that
$$a+b+c+\sqrt{a^2+b^2+c^2-ab-bc-ca}\geq \sqrt{a^2-ab+b^2}+\sqrt{b^2-bc+c^2}+\sqrt{c^2-ca+c^2}.$$Looking for an algebraic solution!
1 reply
blug
2 hours ago
arqady
an hour ago
Common external tangents of two circles
a1267ab   56
N an hour ago by wassupevery1
Source: USA Winter TST for IMO 2020, Problem 2, by Merlijn Staps
Two circles $\Gamma_1$ and $\Gamma_2$ have common external tangents $\ell_1$ and $\ell_2$ meeting at $T$. Suppose $\ell_1$ touches $\Gamma_1$ at $A$ and $\ell_2$ touches $\Gamma_2$ at $B$. A circle $\Omega$ through $A$ and $B$ intersects $\Gamma_1$ again at $C$ and $\Gamma_2$ again at $D$, such that quadrilateral $ABCD$ is convex.

Suppose lines $AC$ and $BD$ meet at point $X$, while lines $AD$ and $BC$ meet at point $Y$. Show that $T$, $X$, $Y$ are collinear.

Merlijn Staps
56 replies
a1267ab
Dec 16, 2019
wassupevery1
an hour ago
That's Vietnamese geo!
wassupevery1   8
N 2 hours ago by cj13609517288
Source: 2025 Vietnam National Olympiad - Problem 3
Let $ABC$ be an acute, scalene triangle with circumcenter $O$, circumcircle $(O)$, orthocenter $H$. Line $AH$ meets $(O)$ again at $D \neq A$. Let $E, F$ be the midpoint of segments $AB, AC$ respectively. The line through $H$ and perpendicular to $HF$ meets line $BC$ at $K$.
a) Line $DK$ meets $(O)$ again at $Y \neq D$. Prove that the intersection of line $BY$ and the perpendicular bisector of $BK$ lies on the circumcircle of triangle $OFY$.
b) The line through $H$ and perpendicular to $HE$ meets line $BC$ at $L$. Line $DL$ meets $(O)$ again at $Z \neq D$. Let $M$ be the intersection of lines $BZ, OE$; $N$ be the intersection of lines $CY, OF$; $P$ be the intersection of lines $BY, CZ$. Let $T$ be the intersection of lines $YZ, MN$ and $d$ be the line through $T$ and perpendicular to $OA$. Prove that $d$ bisects $AP$.
8 replies
wassupevery1
Dec 25, 2024
cj13609517288
2 hours ago
Equation has no integer solution.
Learner94   33
N 2 hours ago by bjump
Source: INMO 2013
Let $a,b,c,d \in \mathbb{N}$ such that $a \ge b \ge c \ge d $. Show that the equation $x^4 - ax^3 - bx^2 - cx -d = 0$ has no integer solution.
33 replies
Learner94
Feb 3, 2013
bjump
2 hours ago
Problem 1 — Symmetric Squares, Symmetric Products
RockmanEX3   8
N 2 hours ago by Baimukh
Source: 46th Austrian Mathematical Olympiad National Competition Part 1 Problem 1
Let $a$, $b$, $c$, $d$ be positive numbers. Prove that

$$(a^2 + b^2 + c^2 + d^2)^2 \ge (a+b)(b+c)(c+d)(d+a)$$
When does equality hold?

(Georg Anegg)
8 replies
RockmanEX3
Jul 14, 2018
Baimukh
2 hours ago
Math solution
Techno0-8   0
2 hours ago
Solution
0 replies
Techno0-8
2 hours ago
0 replies
D1027 : Super Schoof
Dattier   0
2 hours ago
Source: les dattes à Dattier
Let $p>11$ a prime number with $a=\text{card}\{(x,y) \in \mathbb Z/ p \mathbb Z: y^2=x^3+1\}$ and $b=\dfrac 1 {((p-1)/2)! \times ((p-1)/3)! \times ((p-1)/6)!} \mod p$ when $p \mod 3=1$.



Is it true that if $p \mod 3=1$ then $a \in \{b,p-b, \min\{b,p-b\}+p\}$ else $A=p$.
0 replies
Dattier
2 hours ago
0 replies
Interesting inequality
sealight2107   0
3 hours ago
Source: Own
Let $a,b,c>0$ such that $a+b+c=3$. Find the minimum value of:
$Q=\frac{a}{b}+\frac{b}{c}+\frac{c}{a}+\frac{1}{a^3+b^3+abc}+\frac{1}{b^3+c^3+abc}+\frac{1}{c^3+a^3+abc}$
0 replies
sealight2107
3 hours ago
0 replies
Bosnia and Herzegovina 2022 IMO TST P1
Steve12345   3
N 3 hours ago by waterbottle432
Let $ABC$ be a triangle such that $AB=AC$ and $\angle BAC$ is obtuse. Point $O$ is the circumcenter of triangle $ABC$, and $M$ is the reflection of $A$ in $BC$. Let $D$ be an arbitrary point on line $BC$, such that $B$ is in between $D$ and $C$. Line $DM$ cuts the circumcircle of $ABC$ in $E,F$. Circumcircles of triangles $ADE$ and $ADF$ cut $BC$ in $P,Q$ respectively. Prove that $DA$ is tangent to the circumcircle of triangle $OPQ$.
3 replies
Steve12345
May 22, 2022
waterbottle432
3 hours ago
Composite sum
rohitsingh0812   39
N Apr 23, 2025 by YaoAOPS
Source: INDIA IMOTC-2006 TST1 PROBLEM-2; IMO Shortlist 2005 problem N3
Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$.
Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.
39 replies
rohitsingh0812
Jun 3, 2006
YaoAOPS
Apr 23, 2025
Composite sum
G H J
Source: INDIA IMOTC-2006 TST1 PROBLEM-2; IMO Shortlist 2005 problem N3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rohitsingh0812
105 posts
#1 • 8 Y
Y by yayitsme, centslordm, Adventure10, HWenslawski, megarnie, SatisfiedMagma, and 2 other users
Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$.
Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Davron
484 posts
#2 • 41 Y
Y by mathbuzz, mjuk, HarvardMit, div5252, Swag00, jt314, Anar24, A_Math_Lover, Wizard_32, richrow12, Pluto1708, green_leaf, rashah76, Toinfinity, Illuzion, mathleticguyyy, yayitsme, Wizard0001, centslordm, hakN, Adventure10, HWenslawski, megarnie, W.R.O.N.G, arinastronomy, Mango247, rstenetbg, Ab_Rin, Stuffybear, kiyoras_2001, aidan0626, Sedro, and 9 other users
All the coefficients of $f(x)=(x+a)(x+b)(x+c)-(x-d)(x-e)(x-f)=$ $Sx^2+(ab+bc+ca-de-ef-fd)x+(abc+def)$ are multiples of $S$. Evaluating $f$ at $d$ we get that $f(d)=(a+d)(b+d)(c+d)$ is a multiple of $S$.
So this implies that $S$ is composite, since $a+d,b+d,c+d$ are all strictly less than $S$.

davron
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
spider_boy
210 posts
#3 • 2 Y
Y by centslordm, Adventure10
My solution (some kind of minimality idea).

Suppose $S$ is prime.
We observe that if $(a, b, c, d, e ,f)$ is a solution then $(a-1, b-1, c-1, d+1, e+1, f+1)$ is also a solution. Note that $S$ does not change. Denote $X=\min\{a,b,c\}$. We can claim that $(a-X, b-X, c-X, d+X, e+X, f+X)$ also satisfies the conditions.
So we get $S \mid (d+X)(e+X)(f+X)$. But this is impossible, since $d+X,e+X, f+X$ are all $<S$. :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Particle
179 posts
#4 • 2 Y
Y by centslordm, Adventure10
Hidden due to length
This post has been edited 1 time. Last edited by Particle, May 21, 2013, 2:29 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
subham1729
1479 posts
#5 • 3 Y
Y by centslordm, Adventure10, Mango247
Well, note $(a+d)(b+d)(c+d)=A+dB+d^2S$ now so we get $S|(a+d)(b+d)(c+d)$ , suppose $S$ is prime then it must be less than one of $a+d,b+d,c+d$ but as $S=a+b+c+d$ so absurd and done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ksun48
1514 posts
#6 • 4 Y
Y by centslordm, Adventure10, Mango247, and 1 other user
Assume $S$ is a prime. Then $(x-a)(x-b)(x-c)$ and $(x+d)(x+e)(x+f)$ are the same polynomial, mod $S$, so by Lagrange's theorem $\{a,b,c\} = \{-d,-e,-f\}$. Thus $a+b+c+d+e+f \ge 3S > S$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AMN300
563 posts
#7 • 3 Y
Y by centslordm, Adventure10, Mango247
Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RayThroughSpace
426 posts
#8 • 3 Y
Y by centslordm, Adventure10, Mango247
For the sake of contradiction, let $S$ be prime. Note $S$ divides $(x-a)(x-b)(x-c) - (x+d)(x+e)(x+f)$. Substitute $x= a,b,c,-d,-e,-f,$ we get $S$ divides $(d+a)(d+b)(d+c) , (e+a)(e+b)(e+c), (f+a)(f+b)(f+c)$ and

$S|(a+d)(a+e)(a+f)$
$S|(b+d)(b+e)(b+f)$
$S|(c+d)(c+e)(c+f)$

From the first set of 3 conditions, WLOG, we can let $S|(a+d)$, $S|(b+e)$ and $S|(c+f)$. However, each of $(a+d),(b+e), (c+f)$ are smaller than $S$, a contradiction.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
v_Enhance
6877 posts
#9 • 15 Y
Y by Wizard_32, RAMUGAUSS, Gems98, rashah76, Cindy.tw, v4913, Robokop, SerdarBozdag, centslordm, hakN, mathleticguyyy, lahmacun, HamstPan38825, Adventure10, Mango247
Let $p$ be a fixed prime. We say a $6$-tuple $(a,b,c,d,e,f)$ of integers is good if $a+b+c+d+e+f = p$ and $p \mid abc+def$ and $p \mid ab+bc+ca-de-ef-fd$.

Claim: If $(a,b,c,d,e,f)$ is good then so is $(a+1, b+1, c+1, d-1, e-1, f-1)$.

Proof. Direct computation. $\blacksquare$

We claim there exists no good $6$-tuple of positive integers. If not, WLOG $f$ is the smallest of the six numbers. Then by repeating the claim, the tuple $(a+f, b+f, c+f, d-f, e-f, 0)$ is good. But now $p \mid (a+f)(b+f)(c+f)$ and $p > \max(a+f, b+f, c+f)$, contradiction.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
yayups
1614 posts
#10 • 3 Y
Y by centslordm, Adventure10, Mango247
We see that
\begin{align*}
a+b+c&\equiv -(d+e+f)\pmod{S} \\
ab+bc+ca&\equiv -(de+ef+fd)\pmod{S} \\
abc &\equiv -def\pmod{S}.
\end{align*}Now, assuming that $S$ is prime, we see that
\[(X-a)(X-b)(X-c)=(X+d)(X+e)(X+f)\]over $\mathbb{F}_S[X]$, so because of unique factorization, we have WLOG that $a\equiv -d\pmod{S}$, $b\equiv -e\pmod{S}$, and $c\equiv -f\pmod{S}$. In particular, this means that $S\mid a+d$. However, $S>a+d$, so this isn't possible. Therefore, $S$ couldn't have been prime to start with. $\blacksquare$
This post has been edited 1 time. Last edited by yayups, Apr 5, 2019, 9:30 PM
Reason: latex align fix
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Zorger74
760 posts
#11 • 1 Y
Y by centslordm
Solution
This post has been edited 1 time. Last edited by Zorger74, Jan 23, 2021, 12:41 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Spacesam
596 posts
#12 • 1 Y
Y by centslordm
AFSOC $S = p$ for some prime $p$. Define \begin{align*}
    P(x) &= (x + a)(x + b)(x + c) = x^3 + x^2(a + b + c) + x(ab + bc + ca) + abc \\
    Q(x) &= (x - d)(x - e)(x - f) = x^3 - x^2(d + e + f) + x(de + ef + fd) - def,
\end{align*}and consider \begin{align*}
    R(x) &= P(x) - Q(x) \\
    &= x^2 \cdot p + x(ab + bc + ca - de - ef - fd) + abc + def.
\end{align*}Taking mod $p$, we find that $P(x) \equiv Q(x) \pmod p$.

However, plug in $x = d$. We know $Q$ has a root at $d$, so \begin{align*}
    P(d) = (d + a)(d + b)(d + c) \equiv 0\pmod p,
\end{align*}but $p > d + a, d + b, d + c$ and so we are done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mano
46 posts
#13 • 1 Y
Y by centslordm
$S\geq6$, so assume for the sake of contradiction that $S$ is prime. Let $P(x)\coloneqq (x-a)(x-b)(x-c)$ and $Q(x)\coloneqq (x+a)(x+b)(x+c)$. Multiplying out, we get that $P(x)\equiv Q(x)\;(\text{mod}\,S)$ for all integers $x$. In particular, we get that for an integer $x$, $S$ divides $P(x)$ if and only if $S$ divides $Q(x)$, which, because $S$ is assumed to be a prime, means that $\{a, b, c\}$ is just some permutation of $\{-d, -e, -f\}$ modulo $S$. WLOG, assume that $a\equiv -d$, $b\equiv -e$ and $c\equiv -f$ modulo $S$. But this means that $a+d$, $b+e$ and $c+f$ are all multiples of $S$, which is impossible, because they are positive integers which sum up to $S$.
This post has been edited 1 time. Last edited by Mano, Apr 28, 2021, 9:35 AM
Reason: 6, not 1
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bever209
1522 posts
#14 • 1 Y
Y by centslordm
Note that $(x+a)(x+b)(x+c)-(x-d)(x-e)(x-f)$ has all of its coefficients divisible by $S$. This implies $S|(d+a)(d+b)(d+c)$. FTSOC assume $S$ is prime. Then it must divide either $d+a,d+b,d+c$, all of which are smaller than $S$, a contradiction, so we are done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bora_olmez
277 posts
#15
Y by
Assume for the sake of contradiction that $S$ is prime. Notice that $$S \mid (a+k)(b+k)(c+k)+(d-k)(e-k)(f-k)$$for all $k \in \mathbb{Z}$.
Then taking $k$ to be $-a,-b,-c$ we have that $\{d,e,f\} = \{-a,-b,-c\}$ in $\mathbb{F}_S$ using that $S$ is prime, yet, adding any such values of $a,b,c,d,e,f$, we have that $$S = a+b+c+d+e+f \geq 3S$$which is a contradiction. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Sprites
478 posts
#16
Y by
Suppose that $S$ is a prime and let $x=-d,y=-e,z=-f$,so that $abc \equiv xyz \pmod S$
Now consider the polynomial $ (a+k)(b+k)(c+k)+(d-k)(e-k)(f-k)$ and clearly inputting $x,y,z$ implies $S|(a+d)(a+e)(a+f)$,which implies that $S$ divides one of $(a+d),(a+e),(a+f)$,a contradiction.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AwesomeYRY
579 posts
#17 • 1 Y
Y by trying_to_solve_br
Note that the polynomial $f(x) = (x-a)(x-b)(x-c)-(x+d)(x+e)(x+f) = (ab+ac+bc-de-ef-df)x-(abc+def)$ is divisible by $S$ for all integers $x$. Thus,
\[S\mid f(a) = -(a+d)(a+e)(a+f)\]To finish, $S$ cannot be prime because $a+d,a+e,a+f<a+b+c+d+e+f = S$, so we're done. $\blacksquare$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HoRI_DA_GRe8
597 posts
#18
Y by
Sol
This post has been edited 1 time. Last edited by HoRI_DA_GRe8, Dec 18, 2021, 3:56 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mogmog8
1080 posts
#19 • 1 Y
Y by centslordm
Notice \begin{align*}S\mid f(x)&=Sx^2+(ab+bc+ca-de-df-fd)x+(abc+def)\\&=(x+a)(x+b)(x+c)-(x-d)(x-e)(x-f)\end{align*}Letting $x=d,$ we have $S\mid (d+a)(d+b)(d+c),$ which is absurd if $S$ is prime as $S>d+a,d+b,d+c.$ $\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
awesomeming327.
1712 posts
#20
Y by
Assume for the sake of contradiction $S$ is prime, and take polynomials $P(x)=(x-a)(x-b)(x-c)$ and $Q(x)=(x+d)(x+e)(x+f).$ Note that \[P(x)\equiv x^3 - (a+b+c)x^2 + (ab+bc+ca)x-abc \pmod S\]Note that on the other hand, \[Q(x)\equiv x^3 + (d+e+f)x^2 + (de+ef+fd)x+def \pmod S\]Now, $Q(x)-P(x)=Sx^2+(de+ef+fd-ab-bc-ca)x+abc+def.$ Note that this is divisible by $S.$ In particular, $Q(a)-P(a)=(a+d)(a+e)(a+f)$ is divisible by $S.$ Note that each of those factors are less than $S$ but $S$ is prime, which is a contradiction.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HamstPan38825
8859 posts
#21
Y by
Observe that we have the system of congruences
\begin{align*}
a+b+c &\equiv -d-e-f \pmod S \\
ab+bc+ca &\equiv de+ef+fd \pmod S \\
abc &\equiv -def \pmod S.
\end{align*}This means that $$(x-a)(x-b)(x-c) \equiv (x+d)(x+e)(x+f) \pmod S$$for all $x \in \mathbb Z$ as the resulting polynomials are equivalent under modulo $S$. Letting $x=a$, $$S \mid (a+d)(a+e)(a+f),$$but $a+d, a+e, a+f < S$, and thus $S$ must be composite.
This post has been edited 1 time. Last edited by HamstPan38825, Jul 20, 2022, 12:02 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Kimchiks926
256 posts
#22 • 2 Y
Y by mkomisarova, Mango247
Suppose otherwise that $S$ is prime $p$. Then we have the following equations.
\begin{align*} 
a+b+c \equiv -(d+e+f) \pmod p \\ 
ab+bc+ca \equiv de+ef+df \pmod p \\ 
abc \equiv -def \pmod p 
\end{align*}We will construct numbers $a_1,b_1, c_1, d_1, e_1, f_1$ such that:
\begin{align*} 
a_1+b_1+c_1 \equiv -(d_1+e_1+f_1) \pmod p \\ 
a_1b_1+b_1c_1+c_1a_1 \equiv d_1e_1+e_1f_1+d_1f_1 \pmod p \\ 
a_1b_1c_1 \equiv -d_1e_1f_1 \pmod p 
\end{align*}In fact, this is not so hard to do. It is just enough to take $a_1=a+1, b_1=b+1, c_1 =c_1$ and $d_1 =d-1, e_1 =e-1, f_1 =f-1$. It is easy to see that they satisfy the first congruence. Note that:
\begin{align*} 
(a+1)(b+1)+(b+1)(c+1)+(c+1)(a+1) \equiv (d-1)(e-1)+(e-1)(f-1)+(f-1)(d-1) \pmod p\\ 
ab+bc+ca +2(a+b+c)+3 \equiv de+ef+fd -2(d+e+f)+3 \pmod p
\end{align*}We see that the second desired congruence is also satisfied by given congruences. Also, observe that:
\begin{align*} 
(a+1)(b+1)(c+1) \equiv -(d-1)(e-1)(f-1)  \pmod p \\
a+b+c+(ab+bc+ca)+abc+1 \equiv -((d+e+f)-(de+ef+fd)+def-1) \pmod p \\
(a+b+c+de+f) +(ab+bc+ca-de-ef-fd)+(abc+def) \equiv 0 \pmod p
\end{align*}We see that the third desired congruence is also satisfied by given congruences.

Since $a,b,c, d,e,f$ are positive integers and their sum it $p$, then they all are less than $p$. WLOG $a$ is the largest among $a,b,c$. With each construction we increase $a,b,c$ by $1$ and decrease $d,e,f$ by $1$. We can keep doing it until $a$ becomes $p$. Suppose that we needed for that $k$ constructions, in other words $a+k =p=a_k$. Consider congruence:
$$ a_kb_kc_k \equiv d_ke_kf_k \equiv 0 \pmod p $$We see that it implies that $d_ke_kf_k \equiv 0 \pmod p$. WLOG assume that $d_k = d-k$ is the one which is divisible by $p$. Then $0 \equiv a_k + d_k = a+k+d-k = a+ d \pmod p$, which is contradiction, since it forces $b,c,e,f$ to be $0$.

Our initial assumption was wrong, therefore $S$ composite as desired.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SatisfiedMagma
458 posts
#23 • 1 Y
Y by kamatadu
I'm not smart as others to see that you can really form a polynomial... Anyways here is a solution by induction which kind of makes the polynomial in a different way which I feel is intuitive too...

Solution. Assume on the contrary that $S$ is prime. We will make use of these handy identities in the solution.
\begin{align}
        (a+1)(b+1)(c+1) &= abc + (ab+bc+ca) + (a+b+c) + 1 \\
        (d-k)(e-k)(f-k) &= def - (de+ef+df) + (d+e+f) - 1
    \end{align}The following claim is the crux of the problem.

Claim: $S \mid (a+x)(b+x)(c+x) + (d-x)(e-x)(f-x)$ for all $x \in \mathbb{Z}_{\ge 0}$.

Proof: The proof is by induction with the base case being trivial. As an induction hypothesis, assume that $S \mid (a+k)(b+k)(c+k) + (d-k)(e-k)(f-k)$. For ease of notation label $a+k = A$, $d - k = D$ and so on. Now finally for the inductive step, we will just work backward.
\begin{align*}
            S \mid (A+1)(B+1)(C+1) &+ (D-1)(E-1)(F-1) \\
            \iff S \mid (ABC + DEF) + (AB+BC+CA) &- (DE+EF+FA) + (A+B+C+\ldots)
        \end{align*}By the induction hypothesis, we will cancel of $ABC + DEF$ term. It is not hard to see that $S \mid (A+B+C+D+E+F)$ as well.
\begin{align*}
            \iff S \mid AB + BC + CA - DE - EF - FA
        \end{align*}It isn't hard to expand this out and realize its a tautology. So, the induction is complete.$\square$
Finally choose $x = d$. This would give
\[S = a + b + c + d + e + f \mid (a + d)(b + d)(c+d).\]Since $S$ is a prime, it must divide one of the factors. But since all the factors are positive and less than $S$, its the desired contradiction. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sman96
136 posts
#24 • 1 Y
Y by lian_the_noob12
Let's allow $0$ as value of $d,e,f$.
FTSOC, let's assume that $S = p$ is a prime.
Here, \begin{align*}
S &= a+b+c+d+e+f\\ &= (a+1) + (b+1)+(c+1) + (d-1)+(e-1)+(f-1)
\end{align*}
Now, $p\mid a+b+c+d+e+f$, $p\mid abc+def$ and $p\mid ab+bc+ca-de-ef-df$. Summing these up gives, $$p\mid (a+1)(b+1)(c+1) + (d-1)(e-1)(f-1)$$Also, \begin{align*}
&\sum_{cyc}(a+1)(b+1) - \sum_{cyc}(d-1)(e-1)\\
=& ab+bc+ca-de-ef-df +2(a+b+c+d+e+f)
\end{align*}
Therefore, $\displaystyle p\mid \sum_{cyc}(a+1)(b+1) - \sum_{cyc}(d-1)(e-1)$.
So, if $(a,b,c,d,e,f)$ is a solution then, $(a+1, b+1, c+1, d-1,e-1,f-1)$ is also a solution with $S= p$.

Now we continue this process until one of the elements becomes $0$. WLOG that be $f$.
Then we will get, $p\mid abc$. But therefore $p$ must divide one of $a,b,c$ which isn't possible as, $p = a+b+c+d+e$. This gives a contradiction. $\blacksquare$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
IAmTheHazard
5001 posts
#25 • 1 Y
Y by centslordm
Suppose that $S$ was prime. Then the polynomials $(x+a)(x+b)(x+c)$ and $(x-d)(x-e)(x-f)$ have equivalent expansions modulo $p$, hence we must have $\{-a,-b,-c\} \equiv \{d,e,f\} \pmod{S} \implies \{S-a,S-b,S-c\}=\{d,e,f\}$. But then $d+e+f=3S-a-b-c \implies S=a+b+c+d+e+f=3S$: contradiction. $\blacksquare$
This post has been edited 1 time. Last edited by IAmTheHazard, Aug 12, 2023, 5:46 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
lifeismathematics
1188 posts
#26
Y by
Consider $P(x)=(x+a)(x+b)(x+c)-(x-d)(x-e)(x-f)$

$P(x)=Sx^2+x(ab+bc+ca-ed-ef-df)+(abc+def) \implies S|P(x)$ $\forall x \in \mathbb{Z}$

$P(d)=(a+d)(b+d)(c+d)$ hence as $S|P(d)$. Now , $\mathrm{FTSOC}$ assume $S$ is prime, then as we have $S|(a+d)(b+d)(c+d)$ we have at least one of $(a+d), (b+d) , (c+d)> S$ but since $S=a+b+c+d+e+f$ this is absurd for $a,b,c,d,e, f \in \mathbb{Z}^{+}$ , hence our assumption false and hence $S$ is composite $\blacksquare$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sixoneeight
1138 posts
#27 • 1 Y
Y by fuzimiao2013
Solved with xor, xook, and xonk, also known as fuzimiao2013, sixoneeight, popop614.

We can rewrite the condition as
\[
(t-a)(t-b)(t-c) \equiv (t+d)(t+e)(t+f) \pmod{S}
\]for all integer $t$. Suppose for the sake of contradiction that $S$ was prime. Take $t=a$. Then, $S$ divides one of $a+d$, $a+e$, $a+f$. However, since $a,b,c,d,e,f$ are positive integers, that would mean that one of $a+d, a+e, a+f$ is equal to $S$. This is a contradiction as the rest of the variables could not be positive, so $S$ must be composite.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math_comb01
662 posts
#28
Y by
FTSOC let $S$ be a prime
$a+b+c \equiv -(d+e+f)$
$abc \equiv (-d)(-e)(-f)$
$ab+bc+ca \equiv (-d)(-e)+(-e)(-f)+(-d)(-f)$
In $\mathbb{F}_S$
$(x-a)(x-b)(x-c) \equiv (x+d)(x+e)(x+f)$
therefore $\{a,b,c\} \equiv \{-d,-e,-f\}$ in $\mathbb{F}_S$
$\therefore$ we're done.
This post has been edited 2 times. Last edited by math_comb01, Dec 27, 2023, 11:57 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
EpicBird08
1751 posts
#29 • 2 Y
Y by GeoKing, torch
Thanks to torch for suggesting this problem to me!

Let $k$ be an integer. Note that $S$ divides the quantity $$abc + def + k(ab+bc+ca-de-ef-fd) + k^2(a+b+c+d+e+f) + 1 - 1 = (a+k)(b+k)(c+k) - (d-k)(e-k)(f-k).$$Now there are $2$ cases.

Case 1: The smallest of $a,b,c,d,e,f$ is one of $a,b,c.$ WLOG suppose it is $a.$ Letting $k = -a$ gives $S \mid -(d+a)(e+a)(f+a),$ so switching the positive sign yields $$S \mid (d+a)(e+a)(f+a).$$If $S$ was prime, then it would have to divide at least one of these factors, say $d+a$ (the other cases are symmetrical to this). Then $a+b+c+d+e+f \mid d+a,$ which is a contradiction due to size issues.

Case 2: The smallest of $a,b,c,d,e,f$ is one of $d,e,f.$ WLOG suppose it is $d.$ Letting $k = d$ gives $S \mid (a+d)(b+d)(c+d),$ and repeat the size argument from the previous case.

Therefore, in any case, $S$ must be composite, as desired.
This post has been edited 1 time. Last edited by EpicBird08, Jun 21, 2024, 10:31 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
PEKKA
1848 posts
#30
Y by
Used a whole bunch of ARCH Hints after 30 min of failing:
FTSOC $S=p$ for some prime $p.$
Let $d_0=-d, e_0=-e, f_0=-f.$ Then we get a vieta-like relation modulo $P.$ This implies that $a,b,c$ and $d_0,e_0,f_0$ are roots to the same polynomial with coefficients modulo $p.$
Now WLOG $a-d_0 \equiv 0\pmod{p},b-e_0 \equiv 0\pmod{p}, c-f_0 \equiv 0\pmod{p}.$
Therefore, $a+d, b+e, c+f$ are multiples of $p$
Therefore, $S=a+d+b+e+c+f=p(k)$ for some integer $k>1$ which violates the condition that $S=p,$ or $S$ is prime. Therefore $S$ must be composite.
This post has been edited 1 time. Last edited by PEKKA, Jun 23, 2024, 7:03 PM
Reason: edit
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
cursed_tangent1434
621 posts
#31
Y by
Really cute problem. I'm surprised I found the nice solution! We consider ordered pairs of sets $(\{a,b,c\},\{d,e,f\})$ which satisfy the given conditions. We call such a pair a good pair and if $a+b+c+d+e+f=k$ then we say that it is a $k-$good pair. We start off by proving the following nice result about $k-$good pairs.

Claim : For all integers $k$ for which there exists a $k-$good pair $(\{a,b,c\},\{d,e,f\})$, the pairs $(\{a-1,b-1,c-1\},\{d+1,e+1,f+1\})$ and $(\{a+1,b+1,c+1\},\{d-1,e-1,f-1\})$ are also $k-$good.

Proof : It is not hard to see that they must be $k-$good if they are good at all, since the sum $a+b+c+d+e+f$ does not change in either instance. We show that if $(\{a,b,c\},\{d,e,f\})$ is good then the pair $(\{a-1,b-1,c-1\},\{d+1,e+1,f+1\})$ must also be good. This is a mere calculation. Note that,
\[    (a-1)(b-1)(c-1)+(d+1)(e+1)(f+1) = (abc+def) -(ab+bc+ca-de-ef-fd) + (a+b+c+d+e+f)\]where each of the bracketed terms are known to be multiples of $a+b+c+d+e+f$. The proof of the other is entirely similar, so this finishes the proof of the claim.

We wish to show that there exists no $p-$good pairs for any prime $p$. By way of contradiction, say there exists such a prime $p$ and a $p-$good pair $(\{a,b,c\},\{d,e,f\})$. Then, WLOG say the minimum element of the set $\{a,b,c,d,e,f\}$ is $a$. By way of our claim, it follows that the pair $(\{0,b-a,c-a\},\{d+a,e+a,f+a\})$ is also $p-$good. Note that here, $d'=d+a$ , $e'=e+a$ and $f'=f+a$ are all positive integers. Then,
\[p|(0)(b-a)(c-a)+(d+a)(e+a)(f+a)=d'e'f'\]Since $p$ is a prime, this implies that $p$ divides one of $d'$ , $e'$ and $f'$. But, since $p=0 + (b-a) + (c-a) + (d+a) + (e+a) + (f+a)$ where the first 3 terms are non-negative and the last two terms are strictly positive,
\[p = (b-a) + (c-a) + (d+a) + (e+a) + (f+a) \ge d'+e'+f' > d',e',f' \]which is a clear contradiction. Thus, there cannot exist such a prime $p$ which proves the desired result.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kingu
220 posts
#32
Y by
Same solution as everyone else.
Storage
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
john0512
4187 posts
#33
Y by
a bit silly, statement reminded me of usa tst 2021/1

Suppose FTSOC $a+b+c+d+e+f=p$.

Claim: For any integer $t$,
$$(a+t)(b+t)(c+t)+(d-t)(e-t)(f-t)\equiv 0\pmod p.$$
We have
$$(abc+def)+t(ab+ac+bc-de-df-ef)+t^2(a+b+c+d+e+f)+(t^3-t^3)\equiv 0\pmod{p}.$$
In particular, if $t=d$, then $p\mid (a+d)(b+d)(c+d)$. However, $a+d,b+d,c+d$ are all less than $p$, contradiction if $p$ is prime.

code golf because this is funny
This post has been edited 1 time. Last edited by john0512, Nov 15, 2024, 8:46 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
emi3.141592
71 posts
#34
Y by
Suppose that \(S\) is prime. Observe that
\[
a + b + c \equiv -d - e - f \pmod{S}
\]\[
abc \equiv -def \pmod{S}
\]\[
ab + bc + ca \equiv de + ef + fd \pmod{S}
\]By Vieta, we have that for every positive integer \(n\), the following relation holds:
\[
(n + a)(n + b)(n + c) \equiv (n - d)(n - e)(n - f) \pmod{S}.
\]By setting \(n = -a\), we obtain that \(S\) divides one of the numbers \(-a-d\), \(-a-e\), or \(-a-f\).

By symmetry, we can assume without loss of generality that \(S \mid -a-d\). In particular, we have \(-d \equiv a \pmod{S}\), i.e., \(S \mid d+a\).

However, this is a contradiction, since
\[
a + d < a + b + c + d + e + f = S.
\]
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AshAuktober
1005 posts
#35
Y by
Note that by Vieta, we have $S \mid P(x) = (x-a)(x-b)(x-c) - (x+d)(x+e)(x+f)$.
But putting $x = a$ we get $S$ cannot be prime, qed.
This post has been edited 1 time. Last edited by AshAuktober, Dec 20, 2024, 3:11 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mr.Sharkman
498 posts
#36
Y by
Assume for the sake of contradiction that $a+b+c+d+e+f$ is prime. Then, $a+b+c \equiv -d-e-f,$ $ab+bc+ca \equiv de+df+ef,$ and $abc \equiv -def,$ when taken modulo $a+b+c+d+e+f.$ Let $i_{1} \equiv -i,$ for $i \in \{a,b,c\}.$ It is clear that $a_{1}+b_{1}+c_{1} \equiv d+e+f,$ and $a_{1}b_{1}+a_{1}c_{1}+b_{1}c_{1} \equiv de+ef+df,$ and $a_{1}b_{1}c_{1} \equiv de+ef+df.$ So, $\{a_{1}, a_{2}, a_{3}\}, \{d, e, f\}$ are the solutions of some cubic modulo $p.$ But, by Lagrange's Theorem, this can only have at most $3$ solutions, so these sets are the same, in some order. So, $i+j \equiv 0,$ where $i \in \{a,b,c\},$ and $j \in \{d,e,f\}.$ But, then $i+j < a+b+c+d+e+f,$ so we have a contradiction.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Perelman1000000
110 posts
#37
Y by
v_Enhance wrote:
Let $p$ be a fixed prime. We say a $6$-tuple $(a,b,c,d,e,f)$ of integers is good if $a+b+c+d+e+f = p$ and $p \mid abc+def$ and $p \mid ab+bc+ca-de-ef-fd$.

Claim: If $(a,b,c,d,e,f)$ is good then so is $(a+1, b+1, c+1, d-1, e-1, f-1)$.

Proof. Direct computation. $\blacksquare$

We claim there exists no good $6$-tuple of positive integers. If not, WLOG $f$ is the smallest of the six numbers. Then by repeating the claim, the tuple $(a+f, b+f, c+f, d-f, e-f, 0)$ is good. But now $p \mid (a+f)(b+f)(c+f)$ and $p > \max(a+f, b+f, c+f)$, contradiction.

When i first saw this problem on math class in 15 minutes i had exactly same solution as you :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Ilikeminecraft
616 posts
#38
Y by
Note that this implies that the polynomials $P(x) = (x + d)(x + e)(x + f), Q(x) = (x - a)(x - b)(x - c)$ are congruent modulo $S.$ Thus, $P(x) - Q(x) \equiv 0\pmod S.$ However, $P(a) - Q(a) = (a + d)(a + e)(a + f) \equiv 0 \pmod S.$ However, each of the factors are less than $S,$ which finishes.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
alexanderhamilton124
391 posts
#39
Y by
Suppose, FTSOC, it is a prime. Let $a + b + c + d + e + f = p$. We have $p \mid ab + bc + ca - de - ef - df \implies p \mid abc + c^2(a + b) - dec - efc - dfc \implies p \mid - def + c^2(-c - d - e - f) - dec - efc - dfc \implies p \mid c^3 + c^2d + c^2e + c^2f + dec + efc + dfc + def = (c + d)(c + e)(c + f)$.

So, $p$ must divide one of them but all three are less than $a + b + c + d + e + f$, a contradiction. So, $S$ is composite.
This post has been edited 1 time. Last edited by alexanderhamilton124, Feb 4, 2025, 7:50 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
YaoAOPS
1540 posts
#40
Y by
This means that $S$ divides the coefficients of
\[
	(x+a)(x+b)(x+c) - (x-d)(x-e)(x-f).
\]If $S$ was prime, then this means that $\{a, b, c\} \equiv \{-d, -e, -f\} \pmod{S}$, however then $p$ divides one of $a+d, a+e, a+f$, giving a contradiction by size.
This post has been edited 1 time. Last edited by YaoAOPS, Apr 23, 2025, 2:44 PM
Z K Y
N Quick Reply
G
H
=
a