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

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

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

Summer camps are starting next month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have an enriching summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

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

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

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

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

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

Introduction to Geometry
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

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

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

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

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

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

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

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

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

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

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


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

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

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

Physics

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

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

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

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Balkan Mathematical Olympiad
ABCD1728   0
6 minutes ago
Can anyone provide the PDF version of the book "Balkan Mathematical Olympiads" by Mircea Becheanu and Bogdan Enescu (published by XYZ press in 2014), thanks!
0 replies
ABCD1728
6 minutes ago
0 replies
An amazing functional equation over positive reals
ariopro1387   0
36 minutes ago
Source: Iran Team selection test 2025 - P6
Find all functions $f:\mathbb{R}^+ \rightarrow \mathbb{R}^+$, such that:
$f(f(f(xy))+x^2)=f(y)(f(x)-f(x+y))$
for all $x, y>0$.
0 replies
1 viewing
ariopro1387
36 minutes ago
0 replies
Nice "if and only if" function problem
ICE_CNME_4   10
N 44 minutes ago by maromex
Let $f : [0, \infty) \to [0, \infty)$, $f(x) = \dfrac{ax + b}{cx + d}$, with $a, d \in (0, \infty)$, $b, c \in [0, \infty)$. Prove that there exists $n \in \mathbb{N}^*$ such that for every $x \geq 0$
\[
f_n(x) = \frac{x}{1 + nx}, \quad \text{if and only if } f(x) = \frac{x}{1 + x}, \quad \forall x \geq 0.
\](For $n \in \mathbb{N}^*$ and $x \geq 0$, the notation $f_n(x)$ represents $\underbrace{(f \circ f \circ \dots \circ f)}_{n \text{ times}}(x)$. )

Please do it at 9th grade level. Thank you!
10 replies
1 viewing
ICE_CNME_4
Yesterday at 7:23 PM
maromex
44 minutes ago
Inequality olympiad algebra
Foxellar   0
2 hours ago
Given that \( a, b, c \) are nonzero real numbers such that
\[
\frac{1}{abc} + \frac{1}{a} + \frac{1}{c} = \frac{1}{b},
\]let \( M \) be the maximum value of the expression
\[
\frac{4}{a^2 + 1} + \frac{4}{b^2 + 1} + \frac{7}{c^2 + 1}.
\]Determine the sum of the numerator and denominator of the simplified fraction representing \( M \).
0 replies
Foxellar
2 hours ago
0 replies
Integers on a cube
Rushil   6
N 2 hours ago by SomeonecoolLovesMaths
Source: Indian RMO 2004 Problem 2
Positive integers are written on all the faces of a cube, one on each. At each corner of the cube, the product of the numbers on the faces that meet at the vertex is written. The sum of the numbers written on the corners is 2004. If T denotes the sum of the numbers on all the faces, find the possible values of T.
6 replies
Rushil
Feb 28, 2006
SomeonecoolLovesMaths
2 hours ago
Tangents to circle concurrent on a line
Drytime   9
N 2 hours ago by Autistic_Turk
Source: Romania TST 3 2012, Problem 2
Let $\gamma$ be a circle and $l$ a line in its plane. Let $K$ be a point on $l$, located outside of $\gamma$. Let $KA$ and $KB$ be the tangents from $K$ to $\gamma$, where $A$ and $B$ are distinct points on $\gamma$. Let $P$ and $Q$ be two points on $\gamma$. Lines $PA$ and $PB$ intersect line $l$ in two points $R$ and respectively $S$. Lines $QR$ and $QS$ intersect the second time circle $\gamma$ in points $C$ and $D$. Prove that the tangents from $C$ and $D$ to $\gamma$ are concurrent on line $l$.
9 replies
Drytime
May 11, 2012
Autistic_Turk
2 hours ago
Quadratic
Rushil   8
N 2 hours ago by SomeonecoolLovesMaths
Source: Indian RMO 2004 Problem 3
Let $\alpha$ and $\beta$ be the roots of the equation $x^2 + mx -1 = 0$ where $m$ is an odd integer. Let $\lambda _n = \alpha ^n + \beta ^n , n \geq 0$
Prove that
(A) $\lambda _n$ is an integer
(B) gcd ( $\lambda _n , \lambda_{n+1}$) = 1 .
8 replies
Rushil
Feb 28, 2006
SomeonecoolLovesMaths
2 hours ago
$n^{22}-1$ and $n^{40}-1$
v_Enhance   6
N 2 hours ago by BossLu99
Source: OTIS Mock AIME 2024 #13
Let $S$ denote the sum of all integers $n$ such that $1 \leq n \leq 2024$ and exactly one of $n^{22}-1$ and $n^{40}-1$ is divisible by $2024$. Compute the remainder when $S$ is divided by $1000$.

Raymond Zhu

6 replies
v_Enhance
Jan 16, 2024
BossLu99
2 hours ago
Parallelogram in the Plane
Taco12   8
N 2 hours ago by lpieleanu
Source: 2023 Canada EGMO TST/2
Parallelogram $ABCD$ is given in the plane. The incircle of triangle $ABC$ has center $I$ and is tangent to diagonal $AC$ at $X$. Let $Y$ be the center of parallelogram $ABCD$. Show that $DX$ and $IY$ are parallel.
8 replies
Taco12
Feb 10, 2023
lpieleanu
2 hours ago
Combinatorial
|nSan|ty   7
N 3 hours ago by SomeonecoolLovesMaths
Source: RMO 2007 problem
How many 6-digit numbers are there such that-:
a)The digits of each number are all from the set $ \{1,2,3,4,5\}$
b)any digit that appears in the number appears at least twice ?
(Example: $ 225252$ is valid while $ 222133$ is not)
[weightage 17/100]
7 replies
|nSan|ty
Oct 10, 2007
SomeonecoolLovesMaths
3 hours ago
pairs (m, n) such that a fractional expression is an integer
cielblue   0
3 hours ago
Find all pairs $(m,\ n)$ of positive integers such that $\frac{m^3-mn+1}{m^2+mn+2}$ is an integer.
0 replies
cielblue
3 hours ago
0 replies
the same prime factors
andria   6
N 3 hours ago by MathLuis
Source: Iranian third round number theory P4
$a,b,c,d,k,l$ are positive integers such that for every natural number $n$ the set of prime factors of $n^k+a^n+c,n^l+b^n+d$ are same. prove that $k=l,a=b,c=d$.
6 replies
andria
Sep 6, 2015
MathLuis
3 hours ago
Inspired by RMO 2006
sqing   1
N 4 hours ago by SomeonecoolLovesMaths
Source: Own
Let $ a,b >0  . $ Prove that
$$  \frac {a^{2}+1}{b+k}+\frac { b^{2}+1}{ka+1}+\frac {2}{a+kb}  \geq \frac {6}{k+1}  $$Where $k\geq 0.03 $
$$  \frac {a^{2}+1}{b+1}+\frac { b^{2}+1}{a+1}+\frac {2}{a+b}  \geq 3  $$
1 reply
sqing
Today at 3:24 PM
SomeonecoolLovesMaths
4 hours ago
Problem 4 of RMO 2006 (Regional Mathematical Olympiad-India)
makar   7
N 4 hours ago by SomeonecoolLovesMaths
Source: Combinatorics (Box Principle)
A $ 6\times 6$ square is dissected in to 9 rectangles by lines parallel to its sides such that all these rectangles have integer sides. Prove that there are always two congruent rectangles.
7 replies
makar
Sep 13, 2009
SomeonecoolLovesMaths
4 hours ago
Connecting chaos in a grid
Assassino9931   3
N Apr 25, 2025 by dgrozev
Source: Bulgaria National Olympiad 2025, Day 1, Problem 2
Exactly \( n \) cells of an \( n \times n \) square grid are colored black, and the remaining cells are white. The cost of such a coloring is the minimum number of white cells that need to be recolored black so that from any black cell \( c_0 \), one can reach any other black cell \( c_k \) through a sequence \( c_0, c_1, \ldots, c_k \) of black cells where each consecutive pair \( c_i, c_{i+1} \) are adjacent (sharing a common side) for every \( i = 0, 1, \ldots, k-1 \). Let \( f(n) \) denote the maximum possible cost over all initial colorings with exactly \( n \) black cells. Determine a constant $\alpha$ such that
\[
\frac{1}{3}n^{\alpha} \leq f(n) \leq 3n^{\alpha}
\]for any $n\geq 100$.
3 replies
Assassino9931
Apr 8, 2025
dgrozev
Apr 25, 2025
Connecting chaos in a grid
G H J
Source: Bulgaria National Olympiad 2025, Day 1, Problem 2
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Assassino9931
1364 posts
#1 • 1 Y
Y by cubres
Exactly \( n \) cells of an \( n \times n \) square grid are colored black, and the remaining cells are white. The cost of such a coloring is the minimum number of white cells that need to be recolored black so that from any black cell \( c_0 \), one can reach any other black cell \( c_k \) through a sequence \( c_0, c_1, \ldots, c_k \) of black cells where each consecutive pair \( c_i, c_{i+1} \) are adjacent (sharing a common side) for every \( i = 0, 1, \ldots, k-1 \). Let \( f(n) \) denote the maximum possible cost over all initial colorings with exactly \( n \) black cells. Determine a constant $\alpha$ such that
\[
\frac{1}{3}n^{\alpha} \leq f(n) \leq 3n^{\alpha}
\]for any $n\geq 100$.
This post has been edited 1 time. Last edited by Assassino9931, Apr 9, 2025, 8:54 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
internationalnick123456
135 posts
#2 • 1 Y
Y by cubres
Answer
Solution
This post has been edited 3 times. Last edited by internationalnick123456, Apr 9, 2025, 10:15 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Assassino9931
1364 posts
#3 • 1 Y
Y by internationalnick123456
Answer

Construction for upper bound

Argument for lower bound

By accident, the constants actually matter!
This post has been edited 1 time. Last edited by Assassino9931, Apr 9, 2025, 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.
dgrozev
2464 posts
#4 • 1 Y
Y by Miquel-point
Here is an argument using a spannong tree for the lower bound.

We may think of the configuration as a graph $G$ with $n^2$ vertices (cells) and edges that connect each two adjacent cells (sharing a side). We want to choose $m$ such that a grid with distance $m$ between two consecutive columns/rows contains at least $n$ cells. So $m$ must satisfy:
$$\left(\left\lfloor \frac{n-1}{m}\right\rfloor+1\right)^2\ge n.$$An easy calculation shows that it's enough to take $m:=\left\lfloor\sqrt{n}-\frac{1}{\sqrt{n}}\right\rfloor$. Let $V'$ be the set of $n$ cells, any two of them of distance at least $m$ between them. Let $T(V)$ be a connected subgraph of $G$ with a vertex-set $V$ such that $V'\subset V$. In what follows below, given an edge $e=uv$, by |uv| we denote its length, that is, the number of hops needed to reach $v$ from $u$, or, in other words, the so called manhattan distance between $u$ and $v$. |T| denotes the total length of $T$, that is, the sum of lengths of its edges.

Clearly $T$ is a tree, because we can remove the redundant edges until $T$ is still connected. Note that the claim is trivial in case $V'=V$, because in this case $|V|=n$ and each edge of $T$ has a length at least $m$, hence $|T|\ge (n-1)m$. (There was a glitch in the originally proposed solution, since it took for granted that $V'=V$, which cannot be guaranteed).

So, a bit more care is needed in case $V'\subsetneq V$. Let us refer to the vertices in $V\setminus V'$ as to the white vertices and to the vertices in $V'$ as to the black vertices. Let $v_0$ be a white vertex of $T$. We refer further to it as the root of $T$. We apply the following

Procedure. We delete all white leaves of $T$ (except of $v_0$). Take a leaf $v$ of $T$ with the largest number of vertices between $v$ and $v_0$. Let $v'$ be the neighbor of $v$. If $v'$ is black, we delete the edge $v'v$ whose length is at least $m$ and start the procedure from the beginning.

Assume now, $v'$ is white. If $\deg(v')=2$, we can assume that there is no need of $v'$ and just prolong the two edges that $v'$ is incident with. Let $v_1=v, v_2,\ldots,v_k$ be all the leaves that $v'$ is connected to, and $k\ge 2$. We have:
$$|v'v_i|+|v'v_{i+1}|\ge |v_iv_{i+1}|, i=1,2,\ldots,k,$$where we assume $v_{k+1}=v_1$. Note that $|v_iv_{i+1}|\ge m$ since all $v_i$ are black. Summing up these inequalities, we get:
$$\sum_{i=1}^k|v'v_i|\ge \frac{1}{2}\sum_{i=1}^k \left |v_i v_{i+1}\right|\ge \frac{km}{2}.$$Now, we delete the vertex $v'$. With this, we delete edges with length at least $mk/2$.
Repeat the procedure till we are left with the root $v_0$, which is white.

Note that each time we delete a set of $k$ black vertices, the corresponding deleted edges have total length at least $mk/2$, that is, the number of cells not in $V'$ that cover these edges is at least $mk/2-k=k(m-2)/2$. Therefore, the total number of cells not in $V'$ that cover $T$ is at least:
$$|V'|\cdot (m-2)/2=\frac{1}{2}n \cdot (m-2) \ge \frac{n(\sqrt{n}-3-1/\sqrt{n})}{2}\ge \frac{n^{3/2}}{3},$$as $n\ge 100$.
Z K Y
N Quick Reply
G
H
=
a