Plan ahead for the next school year. Schedule your class today!

G
Topic
First Poster
Last Poster
k a July Highlights and 2025 AoPS Online Class Information
jwelsh   0
Jul 1, 2025
We are halfway through summer, so be sure to carve out some time to keep your skills sharp and explore challenging topics at AoPS Online and our AoPS Academies (including the Virtual Campus)!

[list][*]Over 60 summer classes are starting at the Virtual Campus on July 7th - check out the math and language arts options for middle through high school levels.
[*]At AoPS Online, we have accelerated sections where you can complete a course in half the time by meeting twice/week instead of once/week, starting on July 8th:
[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC Problem Series[/list]
[*]Plus, AoPS Online has a special seminar July 14 - 17 that is outside the standard fare: Paradoxes and Infinity
[*]We are expanding our in-person AoPS Academy locations - are you looking for a strong community of problem solvers, exemplary instruction, and math and language arts options? Look to see if we have a location near you and enroll in summer camps or academic year classes today! New locations include campuses in California, Georgia, New York, Illinois, and Oregon and more coming soon![/list]

MOP (Math Olympiad Summer Program) just ended and the IMO (International Mathematical Olympiad) is right around the corner! This year’s IMO will be held in Australia, July 10th - 20th. Congratulations to all the MOP students for reaching this incredible level and best of luck to all selected to represent their countries at this year’s IMO! Did you know that, in the last 10 years, 59 USA International Math Olympiad team members have medaled and have taken over 360 AoPS Online courses. Take advantage of our Worldwide Online Olympiad Training (WOOT) courses
and train with the best! Please note that early bird pricing ends August 19th!
Are you tired of the heat and thinking about Fall? You can plan your Fall schedule now with classes at either AoPS Online, AoPS Academy Virtual Campus, or one of our AoPS Academies around the US.

Our full course list for upcoming classes is below:
All classes start 7:30pm ET/4:30pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Wednesday, Jul 16 - Oct 29
Sunday, Aug 17 - Dec 14
Tuesday, Aug 26 - Dec 16
Friday, Sep 5 - Jan 16
Monday, Sep 8 - Jan 12
Tuesday, Sep 16 - Jan 20 (4:30 - 5:45 pm ET/1:30 - 2:45 pm PT)
Sunday, Sep 21 - Jan 25
Thursday, Sep 25 - Jan 29
Wednesday, Oct 22 - Feb 25
Tuesday, Nov 4 - Mar 10
Friday, Dec 12 - Apr 10

Prealgebra 2 Self-Paced

Prealgebra 2
Friday, Jul 25 - Nov 21
Sunday, Aug 17 - Dec 14
Tuesday, Sep 9 - Jan 13
Thursday, Sep 25 - Jan 29
Sunday, Oct 19 - Feb 22
Monday, Oct 27 - Mar 2
Wednesday, Nov 12 - Mar 18

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Tuesday, Jul 15 - Oct 28
Sunday, Aug 17 - Dec 14
Wednesday, Aug 27 - Dec 17
Friday, Sep 5 - Jan 16
Thursday, Sep 11 - Jan 15
Sunday, Sep 28 - Feb 1
Monday, Oct 6 - Feb 9
Tuesday, Oct 21 - Feb 24
Sunday, Nov 9 - Mar 15
Friday, Dec 5 - Apr 3

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Jul 2 - Sep 17
Sunday, Jul 27 - Oct 19
Monday, Aug 11 - Nov 3
Wednesday, Sep 3 - Nov 19
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Friday, Oct 3 - Jan 16
Sunday, Oct 19 - Jan 25
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
Tuesday, Jul 15 - Sep 30
Wednesday, Aug 13 - Oct 29
Friday, Sep 12 - Dec 12
Sunday, Oct 26 - Feb 1
Monday, Dec 1 - Mar 2

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Friday, Jul 18 - Nov 14
Thursday, Aug 7 - Nov 20
Monday, Aug 18 - Dec 15
Sunday, Sep 7 - Jan 11
Thursday, Sep 11 - Jan 15
Wednesday, Sep 24 - Jan 28
Sunday, Oct 26 - Mar 1
Tuesday, Nov 4 - Mar 10
Monday, Dec 1 - Mar 30

Introduction to Geometry
Monday, Jul 14 - Jan 19
Wednesday, Aug 13 - Feb 11
Tuesday, Aug 26 - Feb 24
Sunday, Sep 7 - Mar 8
Thursday, Sep 11 - Mar 12
Wednesday, Sep 24 - Mar 25
Sunday, Oct 26 - Apr 26
Monday, Nov 3 - May 4
Friday, Dec 5 - May 29

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)
Sat & Sun, Sep 13 - Sep 14 (1:00 - 4:00 PM PT/4:00 - 7:00 PM ET)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22
Friday, Aug 8 - Feb 20
Tuesday, Aug 26 - Feb 24
Sunday, Sep 28 - Mar 29
Wednesday, Oct 8 - Mar 8
Sunday, Nov 16 - May 17
Thursday, Dec 11 - Jun 4

Intermediate Counting & Probability
Sunday, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

Intermediate Number Theory
Wednesday, Sep 24 - Dec 17

Precalculus
Wednesday, Aug 6 - Jan 21
Tuesday, Sep 9 - Feb 24
Sunday, Sep 21 - Mar 8
Monday, Oct 20 - Apr 6
Sunday, Dec 14 - May 31

Advanced: Grades 9-12

Calculus
Sunday, Sep 7 - Mar 15
Wednesday, Sep 24 - Apr 1
Friday, Nov 14 - May 22

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Wednesday, Sep 3 - Nov 19
Tuesday, Sep 16 - Dec 9
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Oct 6 - Jan 12
Thursday, Oct 16 - Jan 22
Tues, Thurs & Sun, Dec 9 - Jan 18 (meets three times a week!)

MATHCOUNTS/AMC 8 Advanced
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Tuesday, Aug 26 - Nov 11
Thursday, Sep 4 - Nov 20
Friday, Sep 12 - Dec 12
Monday, Sep 15 - Dec 8
Sunday, Oct 5 - Jan 11
Tues, Thurs & Sun, Dec 2 - Jan 11 (meets three times a week!)
Mon, Wed & Fri, Dec 8 - Jan 16 (meets three times a week!)

AMC 10 Problem Series
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 10 - Nov 2
Thursday, Aug 14 - Oct 30
Tuesday, Aug 19 - Nov 4
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Mon, Wed & Fri, Oct 6 - Nov 3 (meets three times a week!)
Tue, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 10 Final Fives
Friday, Aug 15 - Sep 12
Sunday, Sep 7 - Sep 28
Tuesday, Sep 9 - Sep 30
Monday, Sep 22 - Oct 13
Sunday, Sep 28 - Oct 19 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, Oct 8 - Oct 29
Thursday, Oct 9 - Oct 30

AMC 12 Problem Series
Wednesday, Aug 6 - Oct 22
Sunday, Aug 10 - Nov 2
Monday, Aug 18 - Nov 10
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Tues, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 12 Final Fives
Thursday, Sep 4 - Sep 25
Sunday, Sep 28 - Oct 19
Tuesday, Oct 7 - Oct 28

AIME Problem Series A
Thursday, Oct 23 - Jan 29

AIME Problem Series B
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
Tuesday, Sep 16 - Dec 9
Friday, Oct 17 - Jan 30

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, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Friday, Oct 3 - Jan 16

USACO Bronze Problem Series
Wednesday, Sep 3 - Dec 3
Thursday, Oct 30 - Feb 5
Tuesday, Dec 2 - Mar 3

Physics

Introduction to Physics
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26
0 replies
jwelsh
Jul 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
Quadratic equations
Streit31415   1
N 2 minutes ago by AbhayAttarde01
Let (p) and (q) be integers. Knowing that x² + px + q is positive for all integer (x), prove that the equation x² + px + q = 0 has no real solution.
1 reply
Streit31415
an hour ago
AbhayAttarde01
2 minutes ago
Trigonometry equation practice
ehz2701   26
N 14 minutes ago by vanstraelen
There is a lack of trigonometric bash practice, and I want to see techniques to do these problems. So here are 10 kinds of problems that are usually out in the wild. How do you tackle these problems? (I had ChatGPT write a code for this.). Please give me some general techniques to solve these kinds of problems, especially set 2b. I’ll add more later.

Leaderboard and Solved Problems

problem set 1a (1-10)

problem set 2a (1-20)

problem set 2b (1-20)
answers 2b

General techniques so far:

Trick 1: one thing to keep in mind is

[center] $\frac{1}{2} = \cos 36 - \sin 18$. [/center]

Many of these seem to be reducible to this. The half can be written as $\cos 60 = \sin 30$, and $\cos 36 = \sin 54$, $\sin 18 = \cos 72$. This is proven in solution 1a-1. We will refer to this as Trick 1.
26 replies
ehz2701
Jul 12, 2025
vanstraelen
14 minutes ago
Find the value of angle C
markosa   12
N 18 minutes ago by sunken rock
Given a triangle ABC with base BC

angle B = 3x
angle C = x
AP is the bisector of base BC (i.e.) BP = PC
angle APB = 45 degrees

Find x

I know there are multiple methods to solve this problem using cosine law, coord geo
But is there any pure geometrical solution?
12 replies
markosa
Yesterday at 12:45 PM
sunken rock
18 minutes ago
My first proof problem
OWOW   8
N an hour ago by TedBot
In the equation $\sum_{i=0}^n i$ prove (or disprove) that there exists infinitely many positive integers n in which $\sum_{i=0}^n i$ sums to k! where k is a positive integer. (examples, 1+2+3=3! and 1+2+3+4+5+6+7+8+9+10+11+12+13+14+15=5!

Also this is my first proof problem so don't get mad at me if it's really bad. (Technically I'm a middle schooler so I should post this in the middle school threads but I'm thinking proofs are more high school level so I'm posting it here.)
8 replies
OWOW
Yesterday at 11:44 PM
TedBot
an hour ago
N-M where M,N two 5-digit ''consecutive'' palindromes
parmenides51   1
N an hour ago by AlexCenteno2007
Source: Mathematics Regional Olympiad of Mexico Center Zone 2018 P1
Let $M$ and $N$ be two positive five-digit palindrome integers, such that $M <N$ and there is no other palindrome number between them. Determine the possible values of $N-M$.
1 reply
parmenides51
Nov 13, 2021
AlexCenteno2007
an hour ago
Finding the minimal number of coins to pay without change
nAalniaOMliO   2
N an hour ago by nAalniaOMliO
Source: Belarusian-Iranian Friendly Competition 2025
In the magic land there are coins of all integer denominations from $1$ to $100$. Vlad has $n \geq 3$ coins, the sum of denominations of which is $200$. Find the minimal possible value of $n$ at which we can confidently say that Vlad is able to pay $100$ without change.
2 replies
nAalniaOMliO
Jun 14, 2025
nAalniaOMliO
an hour ago
Peru Ibero TST 2022
diegoca1   1
N 2 hours ago by grupyorum
Source: Peru Ibero TST 2022 D2 P1
For every positive integer $m > 1$, let $p(m)$ be the largest prime number that divides $m$. For $m = 1$, define $p(1) = 1$.

a) Prove that there exists a positive integer $n$ such that the numbers $p(n - 2022)$, $p(n)$, and $p(n + 2022)$ are all less than $\frac{\sqrt{n}}{20}$.

b) Given a positive integer $N$, prove that there exists a positive integer $n$ such that the numbers $p(n - 2022)$, $p(n)$, and $p(n + 2022)$ are all less than $\frac{\sqrt{n}}{N}$.
1 reply
diegoca1
Today at 5:00 AM
grupyorum
2 hours ago
Equivalence between sides - Portuguese MO, Problem 2, 2008
Joao Pedro Santos   4
N 2 hours ago by Fly_into_the_sky
Let $AEBC$ be a cyclic quadrilateral. Let $D$ be a point on the ray $AE$ which is outside the circumscribed circumference of $AEBC$. Suppose that $\angle CAB=\angle BAE$. Prove that $AB=BD$ if and only if $DE=AC$.
4 replies
Joao Pedro Santos
Aug 31, 2010
Fly_into_the_sky
2 hours ago
Equality sums on many variables
Assassino9931   0
2 hours ago
Source: Bulgaria Regional Round 2020 Grade 10
Fix a positive integer $k$. Determine all $k$-tuples $(a_1,a_2,\ldots,a_k)$ of real numbers which satisfy the equality
\[ b_1^2 + b_2^2 + \cdots + b_k^2 = 4\left(a_1^2 + a_2^2 + \cdots +a_k^2\right)\]where $b_n = \frac{a_1 + a_2 + \cdots + a_n}{n}$ for $n=1,2,\ldots,k$.
0 replies
Assassino9931
2 hours ago
0 replies
Symmetric inequality
nexu   12
N 3 hours ago by nexu
Source: own
Let $x,y,z \ge 0$. Prove that:
$$  \sum_{\mathrm{cyc}}{\left( y-z \right) ^2\left( 7x^2-y^2-z^2 \right) ^2}\ge 112\left( x-y \right) ^2\left( y-z \right) ^2\left( z-x \right) ^2. $$
12 replies
nexu
Feb 12, 2023
nexu
3 hours ago
interesting problem
Giahuytls2326   2
N 3 hours ago by Pal702004
Source: my teacher
Find all pairs of positive integers \((m, n)\) with \(m, n > 1\) such that \(m \mid a^n - 1\) for every \(a \in \{1, 2, \ldots, n\}\).
2 replies
Giahuytls2326
5 hours ago
Pal702004
3 hours ago
Perpendicular lines due to circle
Kezer   4
N 3 hours ago by Fly_into_the_sky
Source: Germany 2016 - BWM Round 1, #3
Let $A,B,C$ and $D$ be points on a circle in this order. The chords $AC$ and $BD$ intersect in point $P$. The perpendicular to $AC$ through C and the perpendicular to $BD$ through $D$ intersect in point $Q$.
Prove that the lines $AB$ and $PQ$ are perpendicular.
4 replies
Kezer
Nov 12, 2016
Fly_into_the_sky
3 hours ago
SAMO 2013 Senior Round 3 Problem 3 - Tangent to Circumcircle
DylanN   8
N 3 hours ago by TigerOnion
Let ABC be an acute-angled triangle and AD one of its altitudes (D on BC). The line through D parallel to AB is denoted by $l$, and t is the tangent to the circumcircle of ABC at A. Finally, let E be the intersection of $l$ and t. Show that CE and t are perpendicular to each other.
8 replies
DylanN
Sep 17, 2013
TigerOnion
3 hours ago
Four variables (4)
Nguyenhuyen_AG   1
N 3 hours ago by arqady
Let $a,\,b,\,c,\,d$ be non-negative real numbers. Prove that
\[\frac{3(a^2 + b^2 + c^2 + d^2)}{ab + bc + ca + da + db + dc} + \frac{256abcd}{(a + b + c + d)^4} \geqslant  3.\]
1 reply
Nguyenhuyen_AG
5 hours ago
arqady
3 hours ago
Polynomial Minimization
ReticulatedPython   4
N May 21, 2025 by jasperE3
Consider the polynomial $$p(x)=x^{n+1}-x^{n}$$, where $x, n \in \mathbb{R+}.$

(a) Prove that the minimum value of $p(x)$ always occurs at $x=\frac{n}{n+1}.$
4 replies
ReticulatedPython
May 6, 2025
jasperE3
May 21, 2025
Polynomial Minimization
G H J
G H BBookmark kLocked kLocked NReply
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ReticulatedPython
743 posts
#1
Y by
Consider the polynomial $$p(x)=x^{n+1}-x^{n}$$, where $x, n \in \mathbb{R+}.$

(a) Prove that the minimum value of $p(x)$ always occurs at $x=\frac{n}{n+1}.$
This post has been edited 5 times. Last edited by ReticulatedPython, May 6, 2025, 5:16 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
clarkculus
255 posts
#2 • 1 Y
Y by centslordm
Take a derivative.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
lgx57
63 posts
#3
Y by
ReticulatedPython wrote:
Consider the polynomial $$p(x)=x^{n+1}-x^{n}$$, where $x, n \in \mathbb{R+}.$

(a) Prove that the minimum value of $p(x)$ always occurs at $x=\frac{n}{n+1}.$

$p'(x)=(n+1)x^n-nx^{n-1}=x^{n-1}[(n+1)x-n]=0 \Rightarrow x_1=\dfrac{n}{n+1}, x_2=0(\text{not satisfy}) $

And easy to see $x=\dfrac{n}{n+1}$ is a sign reversal zero point of $p(x)$.

So $p(x)_{\text{min}}=p(\dfrac{n}{n+1})$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathIQ.
46 posts
#4
Y by
We are given the polynomial $p(x) = x^{n+1} - x^n$, where $x, n \in \mathbb{R}^+$. We want to prove that its minimum value for $x>0$ occurs at $x = \frac{n}{n+1}$.

To find the minimum, we first find the derivative of $p(x)$ with respect to $x$:
$$p'(x) = \frac{d}{dx}(x^{n+1} - x^n) = (n+1)x^n - nx^{n-1}.$$
Next, we set $p'(x) = 0$ to find critical points:
$$(n+1)x^n - nx^{n-1} = 0.$$Since $x \in \mathbb{R}^+$, $x > 0$. We can factor out $x^{n-1}$ (which is non-zero):
$$x^{n-1}((n+1)x - n) = 0.$$As $x^{n-1} \neq 0$, we must have:
$$(n+1)x - n = 0 \implies (n+1)x = n \implies x = \frac{n}{n+1}.$$Let $x_c = \frac{n}{n+1}$. Since $n \in \mathbb{R}^+$, $n>0$. Thus $0 < n < n+1$, which implies $0 < x_c < 1$. This critical point is in the domain $x \in \mathbb{R}^+$.

To determine if this is a minimum, we examine the sign of $p'(x) = x^{n-1}((n+1)x - n)$.
Since $x>0$, $x^{n-1} > 0$. The sign of $p'(x)$ is thus determined by the sign of the term $((n+1)x - n)$.

If $0 < x < x_c = \frac{n}{n+1}$, then $(n+1)x < (n+1)\frac{n}{n+1} = n$. This implies $(n+1)x - n < 0$, so $p'(x) < 0$. Thus, $p(x)$ is decreasing on the interval $(0, x_c)$.

If $x > x_c = \frac{n}{n+1}$, then $(n+1)x > (n+1)\frac{n}{n+1} = n$. This implies $(n+1)x - n > 0$, so $p'(x) > 0$. Thus, $p(x)$ is increasing on the interval $(x_c, \infty)$.

Since $p(x)$ decreases before $x_c$ and increases after $x_c$, $x_c = \frac{n}{n+1}$ is a local minimum.

To confirm it is a global minimum for $x>0$:
The value of $p(x)$ at $x_c$ is $p(x_c) = \left(\frac{n}{n+1}\right)^{n+1} - \left(\frac{n}{n+1}\right)^n = \left(\frac{n}{n+1}\right)^n \left(\frac{n}{n+1} - 1\right) = -\frac{n^n}{(n+1)^{n+1}}$.
Since $n>0$, $p(x_c) < 0$.
As $x \to 0^+$, $p(x) = x^n(x-1) \to 0(-1) = 0$.
As $x \to \infty$, $p(x) = x^n(x-1) \to \infty$.
Since $x_c$ is the only critical point in $(0, \infty)$ and $p(x_c) < 0$, while the function approaches $0$ at one end of its domain and $\infty$ at the other, the local minimum at $x_c$ is the global minimum.

Thus, the minimum value of $p(x)$ for $x \in \mathbb{R}^+$ occurs at $x = \frac{n}{n+1}$.
This post has been edited 1 time. Last edited by MathIQ., May 21, 2025, 12:54 AM
Reason: type
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jasperE3
11449 posts
#5
Y by
There's also some AM-GM solution like:
$$\frac1nx\cdot\frac1nx\cdots\frac1nx\cdot(1-x)\le(n+1)^{-n-1}$$which implies it.
Z K Y
N Quick Reply
G
H
=
a