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
D1015 : A strange EF for polynomials
Dattier   1
N 9 minutes ago by Dattier
Source: les dattes à Dattier
Find all $P \in \mathbb R[x,y]$ with $P \not\in \mathbb R[x] \cup \mathbb R[y]$ and $\forall g,f$ homeomorphismes of $\mathbb R$, $P(f,g)$ is an homoemorphisme too.
1 reply
Dattier
Mar 16, 2025
Dattier
9 minutes ago
Plane normal to vector
RenheMiResembleRice   0
14 minutes ago
Source: Bian Wei
Solve the attached
0 replies
RenheMiResembleRice
14 minutes ago
0 replies
Complex numbers should be easy
RenheMiResembleRice   1
N 24 minutes ago by RenheMiResembleRice
Source: Wenjing Kong
I cant do the last part. :(
1 reply
RenheMiResembleRice
36 minutes ago
RenheMiResembleRice
24 minutes ago
Strange NT
magicarrow   20
N 24 minutes ago by Yuvi01
Source: Romanian Masters in Mathematics 2020, Problem 6
For each integer $n \geq 2$, let $F(n)$ denote the greatest prime factor of $n$. A strange pair is a pair of distinct primes $p$ and $q$ such that there is no integer $n \geq 2$ for which $F(n)F(n+1)=pq$.

Prove that there exist infinitely many strange pairs.
20 replies
+1 w
magicarrow
Mar 1, 2020
Yuvi01
24 minutes ago
No more topics!
Eisenstein Irreducibility Criterion revisited
orl   34
N Jul 28, 2024 by almagest3001
Source: IMO 1993, Day 1, Problem 1
Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$
34 replies
orl
Nov 19, 2005
almagest3001
Jul 28, 2024
Eisenstein Irreducibility Criterion revisited
G H J
Source: IMO 1993, Day 1, Problem 1
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
orl
3647 posts
#1 • 6 Y
Y by Davi-8191, Inconsistent, Adventure10, Rounak_iitr, Amir Hossein, and 1 other user
Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
joshua_mex
48 posts
#2 • 2 Y
Y by Adventure10, Mango247
well i think is an easy one...lets say that $g(x)=x^g+a_{g-1}x^{g-1}+...+a_{0}$ and $q(x)=x^q+b_{q-1}x^{q-1}+...+b_{0}$ then $a_{0}b_{0}=3$ so WLOG $b_{0}$ is multiple of 3 so lets prove by induction that $b_{n}$ is multiple of 3
first lets see that $b_{0}$ is and we know that the coefficient of $x^1$ in $p(x)$ is 0 so $b_{0}a_{1}+b_{1}a_{0}=0$ or $b_{0}a_{1}=-b_{1}a_{0]}$ and $a_{0}$ is not multiple of 3 so $b_{1}$ must be and that way you can get the result.

that is looking for the coefficient 0 of $x^{n}$ in $p(x)$ and having that $b_{i}=3k$ for $i=0,1,...,n-1$ all that is sufficient if the coefficient is 0 in $x^{q}$ and doesnt occur if $q=n-1$ if that is true then $g(x)=x+g$ with g not multiple of 3. so then $g^n+5g^{n-1}=g^{n-1}(g+5)=-3$ for some integrer g, but then $g^{n-1}$ divides 3, so $g=1$ or $g=+/-3,n=2$ and both are wrong :!: :D

is it right? :roll: :lol: ?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Joao Pedro Santos
152 posts
#3 • 3 Y
Y by Illuzion, Adventure10, and 1 other user
We want to prove that $ f(x)$ is irreducible over $ \mathbb{Z}$. Since $ f(x)$ largest degree's term is $ 1$, its factors' largest degree's terms are $ 1$. By the Extended Eisenstein Criterion, $ f(x)$ has an irreducible factor over $ \mathbb{Z}$ with degree larger that $ n-2$. So it has an irreducible factor over $ \mathbb{Z}$ with degree $ n-1$ or $ n$. Let's suppose $ f(x)$ has an irreducible factor $ \mathbb{Z}$ with degree $ n-1$. So it also has an irreducible factor with degree $ 1$, and since its largest degree's term is $ 1$, it has a zero over $ \mathbb{Z}$, which means $ f(x)$ also has a zero over $ \mathbb{Z}$. But $ f(x)$ is always odd, therefore it can't be $ 0$. Contradiction! So $ f(x)$ has a irreducible factor over $ \mathbb{Z}$ with degree $ n$, which is $ f(x)$, QED.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
darij grinberg
6555 posts
#4 • 2 Y
Y by Adventure10, Mango247
Just edited my post at http://www.mathlinks.ro/viewtopic.php?t=37593 to include this problem as well. Just take $ p = 3$ (which is prime) and $ q = 1$ (which is squarefree and not divisible by $ p$). And consider the case $ n=2$ separately.

darij
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#5 • 2 Y
Y by Adventure10, Mango247
It is a direct consequence of extended Eisenstein's criterion and rational root theorem
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mmmath
14 posts
#6 • 2 Y
Y by popdit, Adventure10
you can use peron criterion it's obvious with peron
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#7 • 1 Y
Y by Adventure10
What is Peron criterion?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
darij grinberg
6555 posts
#8 • 1 Y
Y by Adventure10
He wants to say Perron. It's Theorem A in http://rms.unibuc.ro/bulletin/pdf/53-3/perron.pdf . Applying it here is pretty much overkill, though.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
filetmignon821
292 posts
#9 • 8 Y
Y by Supercali, Adventure10, Mango247, aidan0626, and 4 other users
You could use perron's, but saying 5>4 is a little boring, don't you think?

Another way to do this problem is to reduce it mod 3. We have $x^n+5x^{n-1}+3 \equiv x^n+2x^{n-1}$ (mod 3). Simplifying gives $x^{n-1}(x-2)$. Suppose f(x)=g(x)h(x), for some $g, h \in \mathbb{Z}[x]$ nonconstant. Since x and x-2 are irreducible in $\mathbb{F}_3[x]$, we have (WLOG) $g(x)=x^k+3g_1(x)$ and $h(x)=x^{n-k-1}(n-2)+3h_1(x)$, for some integer polynomials $g_1$ and $h_1$. First we consider the case where k=0. This means that g is nonconstant, a contradiction. If k=n-1, then h(x) is a linear polynomial, so f must have an integer root. We can easily check that this is false. Finally, if 1<k<n-1, multiplying g and h gives $x^{n-1}(x-2)+3g_1(x)x^{n-k-1}(x-2)+3h_1(x)x^k+9g_1(x)h_1(x)$. Setting this equal to our original polynomial and plugging in x=0 gives $9g_1(0)h_1(0)=3$. Since $g_1, h_1 \in \mathbb{Z}[x]$, this is clearly a contradiction. Thus, our polynomial is irreducible in $\mathbb{Z}[x]$.

I think this problem could also be classified as number theory. Irreducible polynomials is one of the biggest overlaps of NT and algebra.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
arkanark
255 posts
#10 • 2 Y
Y by Adventure10, Mango247
EDIT: Ignore this.
This post has been edited 1 time. Last edited by arkanark, Jul 3, 2013, 1:57 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mavropnevma
15142 posts
#11 • 6 Y
Y by arkanark, coolcheetah157, FlakeLCR, quangminhltv99, Adventure10, Mango247
So, first, from $f(a_i) = a_i^n + 5a_i^{n-1} + 3 = 0$, you deduce $a_i^n + 5a_i^{n-1} = -3$, which is correct, only that you write $f(a_i) = a_i^n + 5a_i^{n-1} = -3$. Nice piece of algebra! All we have is $f(a_i) -3 = a_i^n + 5a_i^{n-1} = -3$. And now we will have $g(a_i)h(a_i) -3 = -3$, i.e. $g(a_i)h(a_i) = 0$; obviously, since $g,h$ are the factors of $f$.

Therefore $(g(a_i), h(a_i)) = (\pm 1, \mp 3)$ is clearly wrong, since at least one of them must be $0$. Moreover, in your mistaken way, you miss the possibility $(g(a_i), h(a_i)) = (\pm 3, \mp 1)$.

Nevermind, indeed under these wrong conclusions we would have $p(a_i) = g(a_i)+h(a_i) \in \{-2,2\}$, which you then write $p(a_i) =\pm 2$. True, $\deg p \leq n-1$. But you don't know that the $a_i$'s, $1\leq i \leq n$ are distinct, and even if they were, this does not contradict that Fundamental Theorem (rather the simple theorem that a polynomial cannot have more roots than its degree), since $\pm 2$ is not just one value; for example for the polynomial $p(x) = x^2-3$ we have $p(\pm 1) = -2$ and $p(\pm\sqrt{5}) = 2$. So even if your argumentation up to this point were correct, you still have no contradiction. When only knowing $\deg p \leq n-1$, you need $p(x) = \pm 2$ for at least $2n-1$ distinct arguments, in order to get a contradiction.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
neelanjan
382 posts
#14 • 2 Y
Y by Adventure10, Mango247
Suppose
f(x) = $(x^r + a_{r-1}x^{r-1} + ... + a_1x + 3)(x^s + b_{s-1}x^{s-1} + ... + b_1x + 1)$. We show that all the a's are divisible by 3 and using that we will establish a contradiction .[Here , we will show using only + ve sign of 3 , the other case is
f(x) = $(x^r + a_{r-1}x^{r-1} + ... + a_1x - 3)(x^s + b_{s-1}x^{s-1} + ... + b_1x - 1)$ , in which constant terms contains only - ve terms and the casee follows only the + ve case . So , we will show here only the first case] .
r and s must be greater than 1.Because
for if r = 1, then 3 is a root . Now we will make two cases :
case 1:
n is even, then it follows that 0 = $3^n +5\cdot$$3^{n- 1} + 3 = 3^{n-1}( 3 +5)+ 3$, which is false since 3+5 = 8.
case 2 :
if n is odd we would have 0 = $3^{n-1}(3 + 5) + 3$, which is false since 3 + 5 = 8.
If s = 1, then 1 is a root and we will argue by contradiction in the same way .
So r$\leq$n - 2, and hence the coefficients of x, $x^2, ... , x^r$ are all zero. Since the coefficient of x is zero, we have: $a_1+3b_1 = 0$, so $a_1$ is divisible by 3.
Now , we will use the induction hypothesis .
We can
now proceed by induction.
Assume $a_1, ... , a_t$ are all divisible by 3. Then
consider the coefficient of $x_{t+1}$. If s-1 $\geq $t+1, then $a_{t+1}$ = linear combination of $a_1,... , a_t + 3b_{t+1}$. If s-1 $\leq$ t+1, then $a_{t+1}$ = linear combination of some or all of $a_1,... , a_t.$
Either way, $a_{t+1}$ is divisible by 3.
Now we will consider the coefficients of x, $x^2$,
... , $x^{r-1}$ which gives us that all the a's are multiples of 3. Now consider the coefficientof $x^r$ which is also zero.
Now we will get , that is a sum of of terms which are multiples of 3 .
Then it does not becomes 0.
So , follows a contradiction !
So , the factorization is not possible .( proved ).
-NEELANJAN MONDAL.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AlgebraFC
512 posts
#16 • 3 Y
Y by Hedy, 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.
ubermensch
820 posts
#17 • 2 Y
Y by Adventure10, Mango247
Extended Eisenstein $->$ RRT $->$ $\mod 2$ $->$ Done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ubermensch
820 posts
#18 • 2 Y
Y by Adventure10, Mango247
My point is, would your solution even count if you directly apply Eisenstein on this problem, because it completely trivialises the problem... (apparently any use of a theorem is prohibited if it trivialises the problem, and this theorem certainly does, right?)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Idio-logy
206 posts
#19 • 1 Y
Y by Adventure10
It is a direct result of Perron's criterion. Alternatively, suppose $x^n+5x^{n-1}+3 = f(x)g(x)$. Reduce it modulo 3 to get $f(x)g(x) \equiv x^{n-1}(x+5)$, so we can assume that $f(x) = x^{p}(x+5) + 3F(x)$, $g(x) = x^{q} + 3G(x)$. Multiply them to get $x^qF(x)+x^p(x+5)G(x)+3F(x)G(x) = 1$. Plug in $x=0$, then $3F(0)G(0)=1$, clearly impossible.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
pi_is_3.141
145 posts
#20 • 1 Y
Y by Mango247
Click to reveal hidden text
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
vvluo
1574 posts
#21
Y by
pi_is_3.141 wrote:
Click to reveal hidden text

oh lol someone is taking AMSP Alg 3...
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathiscool12
80 posts
#22
Y by
Solution 1
Solution 2
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
fukano_2
492 posts
#24
Y by
$                    $
This post has been edited 3 times. Last edited by fukano_2, Oct 27, 2021, 10:50 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
CALCMAN
249 posts
#25 • 1 Y
Y by Frestho
fukano_2 wrote:
one liner
-_- Remark

I think this is wrong? $\overline{f(x)}$ only needs to be irreducible $\pmod 5$, not completely irreducible (for example, if I took $f(x)=x^2+2x+1$ and had $x^2+2x+1\equiv x^2+1\pmod 2$, $x^2+1$ being irreducible doesn't imply $x^2+2x+1$ is irreducible, since $x^2+1$ could still be reducible $\pmod 2$).
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
R-sk
429 posts
#26
Y by
This can be done by using perrons criterian
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jasperE3
11101 posts
#27
Y by
By pure coincidence, I had been looking at irreducibility criterion when I encountered this problem. Perron's kills it.

Since $5>1+3$, $f$ is irreducible over $\mathbb Z[x]$. $\square$
This post has been edited 1 time. Last edited by jasperE3, Apr 2, 2021, 4:00 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
OlympusHero
17018 posts
#28
Y by
What on earth?!

Solution
This post has been edited 1 time. Last edited by OlympusHero, Aug 10, 2021, 7:17 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RedFlame2112
1444 posts
#29 • 1 Y
Y by centslordm
orl wrote:
Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$

1 liner by Perron's

By IG's inequality, $5$ is a greater number than $1+3=4$. Hence, we are done since Perron's finishes over $\mathbb{Z}\left[x\right]$ $\square$

Good thing i still have my irreducibility handouts :gleam:

it's also not too hard to prove perron's irreducibility criterion in olympiads, assume the assertion and suppose that $f(x)=g(x)h(x)$. This means that $f$ has only 1 root of modulus greater than 1, which means either $g$ or $h$ has roots not outside the unit circle. You'll reach a contradiction that $|g(0)| < 1$ yet $g(0)$ is, by definition, a nonnegative integer.
This post has been edited 3 times. Last edited by RedFlame2112, Aug 10, 2021, 8:36 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bryanguo
1031 posts
#30 • 2 Y
Y by channing421, centslordm
Everyone says "Perron's" but there's no explanation of what Perron's Criterion is, so I'll put the general statement here.
Quote:
Let $f(X)=X^n+a_{n-1}X^{n-1}+\cdots+a_1X+a_0$ be a polynomial with integer coefficients such that $a_0\neq 0$ and \[|a_{n-1}|>1+|a_{n-2}+\cdots+|a_1|+|a_0|.\]Then $f(X)$ is irreducible in $\mathbb{Z}[X].$
We come back to the original problem.
Quote:
Prove that the polynomial $X^n + 5X^{n-1} + 3$ is irreducible in $\mathbb{Z}[X].$

Direct application of Perron's gives $5>1+3,$ so the polynomial is irreducible as required. Below is an alternate solution through Eisenstein's Criterion, of which here is the statement:
Quote:
Let $f(X)=a_nX^n+a_{n-1}X^{n-1}+\cdots+a_1X+a_0$ be a polynomial with integer coefficients. Then $f(X)$ is irreducible in $\mathbb{Z}[X]$ if there exists a prime $p$ such that
(i) $p \mid a_0, p \mid a_1, \cdots, p \mid a_{n-1},$ and
(i) $p \nmid a_n, p^2 \nmid a_0.$

It is easy to verify by the rational root theorem that no linear factors divide $X^n+5X^{n-1}+3.$ Assume on the contrary that $P(X)=X^n+5X^{n-1}+3=f(X)g(X).$ Taking mod three, we get \[f(X)g(X)\equiv X^{n-1}(X-1)\pmod 3.\]Let $f(X)\equiv X^a\pmod 3,g(X)\pmod X^b(x-1)\pmod 3.$ Now, $a,b\neq 0$ since $f(X),g(X)$ both have degree at least two. Thus, we have $3\mid f(0)$ and $3\mid g(0)$ so $9\mid P(0)$ which is clearly false because $P(0)=3.$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
djmathman
7934 posts
#31
Y by
Wow, I have finally done an irreducibility problem. Let's not use Perron's Criterion.

Write $x^n + 5x^{n-1} + 3 = g(x) h(x)$ for some polynomials $g\in \mathbb Z[x]$ and $h\in \mathbb Z[x]$. Plugging in $x = 0$ yields $g(0)h(0) = 3$, so without loss of generality $3\nmid h(0)$. However, taking $f$ modulo $3$ yields
\[
x^n - x^{n-1} \equiv \bar g(x) \bar h(x)\pmod 3.
\]Thus, $x$ cannot divide $\bar h(x)$.

There are two cases to consider. In the first case, $g(x) = x^{n-1} + 3p(x)$ and $h(x) = x - 1 + 3q(x)$ for some polynomials $p\in \mathbb Z[x]$ and $q\in\mathbb Z[x]$. Since $\deg g \geq n - 1$ and $\deg h \geq 1$, these inequalities are actually equalities. That is, $h$ is linear and $f$ has a rational root. But the only rational roots $f$ can possibly have are $-1$ and $-3$ (RRT combined with the fact that $f$ has no positive roots), and both of these fail.

In the second case, $g(x) = x^n - x^{n-1} + 3p(x)$ and $h(x) = 1 + 3q(x)$ for some polynomials $p\in \mathbb Z[x]$ and $q\in\mathbb Z[x]$. Comparing degrees in the same way implies that $h$ is a constant. In turn, $f$ is irreducible.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ZETA_in_olympiad
2211 posts
#32
Y by
orl wrote:
Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$

Also PEN Q7
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
#33 • 1 Y
Y by Rounak_iitr
For storage:

FTSOC assume the contrary and set $f(x)=h(x)\cdot g(x)$ where $h(x),g(x) \in \mathbb{Z}[x]$. plugging in $x=0$ yields $h(0)g(0)=3$ and plugging $x=-5$ we get $h(-5)g(-5)=3$.

now by RRT, we can clearly observe that there is no integer root of $f(x)$ hence $h(x)$ and $g(x)$ are not linear.

set $h(x)=(x-z_{1})(x-z_{2})\cdots (x-z_{r})$ where $\text{deg(h(x))}=r$ and $z_{i}$'s are root of $h(x)$ for $1\leqslant i \leqslant r$

now WLOG take $h(0)=\pm 1$ ( since $h(x) \in \mathbb{Z}[x]$)

we get $\left|\prod_{i=1}^{r} z_{i}\right|=1$

and $\left|\prod_{i=1}^{r}(z_{i}+5)\right|=|(z_{1}+5)(z_{2}+5)\cdots (z_{r}+5)|$

now notice for $z_{l} \in \{z_{1},z_{2},\cdots z_{r}\}$ we get $z_{l}^{n-1}(z_{l}+5)=-3$ hence we get:

$\left|\prod_{i=1}^{r}(z_{i}+5)\right|=\left|\prod_{i=1}^{r}\frac{-3}{z_{i}^{n-1}}\right|=3^{r}$ which gives that $|h(-5)|=3^{r}$

but also since $|h(-5)||3$ ( as $h(-5)g(-5)=3$ and $h(x)\in \mathbb{Z}[x]$) we have that $3^{r}|3$ for $r>1$ which gives a contradiction , and hence the result follows $\blacksquare$
This post has been edited 6 times. Last edited by lifeismathematics, Mar 16, 2023, 8:58 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Haris1
63 posts
#34
Y by
Using Einstein's Criterion we take p=3, in this case 3 divides a0 , 3 dosent divide an and 3^2 dosent divide 3 therefore by Einstein's criterion it implies that f(x) is irreducible.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
djmathman
7934 posts
#35
Y by
@above: that doesn't work. Eisenstein's Criterion requires $p = 3$ to divide every coefficient except the leading one. Because $3$ does not divide $5$, you can't naively use Eisenstein here.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Haris1
63 posts
#36
Y by
Yes my mistake
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
almagest3001
6 posts
#37
Y by
It is enough to show that $f$ is irreducible in $\mathbb{Q}$ since it is primitive. Observe that $p(x) = 5x^{n-1} + 3$ is irreducible in $\mathbb{Q}$ by Eisenstein. Then $x^n+p \in \mathbb{Q}[x][x]$, where $p$ is taken as the constant coefficient, is irreducible in $\mathbb{Q}[x]$ by the general Eisenstein criterion, hence $f$ is irreducible in $\mathbb{Q}$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
djmathman
7934 posts
#38
Y by
That doesn't work. Unless I'm misunderstanding your argument, by that logic, if $p(x)$ is any irreducible polynomial of degree less than $k$, then $x^k + p(x)$ is also irreducible. This is clearly false, take $p(x) = 3x^2 + 3x + 1$ and $k = 3$.

(Also, what is $\mathbb Q[x][x]$? If you mean "the ring of polynomials in $x$ whose coefficients are polynomials in $x$", then this really is the same thing as $\mathbb Q[x]$. In particular, given a ring $K$, the polynomial ring $K[X]$ can be thought of taking the ring $K$ and adding a new variable $X$ which commutes with elements of $K$ but otherwise has no additional properties. This means something like $\mathbb Q[x][x]$ is inherently problematic, because the first $x$ and the second $x$ interact with each other nontrivially.)
This post has been edited 3 times. Last edited by djmathman, Jul 28, 2024, 5:52 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
almagest3001
6 posts
#39
Y by
You're right. I misremembered the generalized Eisenstein criterion.
This post has been edited 2 times. Last edited by almagest3001, Jul 28, 2024, 6:53 PM
Reason: Removed note to delete post
Z K Y
N Quick Reply
G
H
=
a