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

G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Apr 2, 2025
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. 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 events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 22nd (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/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, 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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
Apr 2, 2025
0 replies
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

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


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


More specifically:

For new threads:


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

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


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

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


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


For answers to already existing threads:


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

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



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


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

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Putnam 2001 A2
ahaanomegas   18
N 19 minutes ago by Rohit-2006
For each $k$, $\mathcal{C}_k$ is biased so that, when tossed, it has probability $\tfrac{1}{(2k+1)}$ of falling heads. If the $n$ coins are tossed, what is the probability that the number of heads is odd? Express the answer as a rational function $n$.
18 replies
ahaanomegas
Feb 26, 2012
Rohit-2006
19 minutes ago
Two Orthocenters and an Invariant Point
Mathdreams   2
N 39 minutes ago by hukilau17
Source: 2025 Nepal Mock TST Day 1 Problem 3
Let $\triangle{ABC}$ be a triangle, and let $P$ be an arbitrary point on line $AO$, where $O$ is the circumcenter of $\triangle{ABC}$. Define $H_1$ and $H_2$ as the orthocenters of triangles $\triangle{APB}$ and $\triangle{APC}$. Prove that $H_1H_2$ passes through a fixed point which is independent of the choice of $P$.

(Kritesh Dhakal, Nepal)
2 replies
Mathdreams
Today at 1:30 PM
hukilau17
39 minutes ago
Cute inequality in equilateral triangle
Miquel-point   0
an hour ago
Source: Romanian IMO TST 1981, Day 3 P5
Let $ABC$ be an equilateral triangle, $M$ be a point inside it, and $A',B',C'$ be the intersections of $AM,\; BM,\; CM$ with the sides of $ABC$. If $A'',\; B'',\; C''$ are the midpoints of $BC$, $CA$, $AB$, show that there is a triangle with sides $A'A''$, $B'B''$ and $C'C''$.

Laurențiu Panaitopol
0 replies
Miquel-point
an hour ago
0 replies
perpendicularity involving ex and incenter
Erken   19
N an hour ago by Primeniyazidayi
Source: Kazakhstan NO 2008 problem 2
Suppose that $ B_1$ is the midpoint of the arc $ AC$, containing $ B$, in the circumcircle of $ \triangle ABC$, and let $ I_b$ be the $ B$-excircle's center. Assume that the external angle bisector of $ \angle ABC$ intersects $ AC$ at $ B_2$. Prove that $ B_2I$ is perpendicular to $ B_1I_B$, where $ I$ is the incenter of $ \triangle ABC$.
19 replies
Erken
Dec 24, 2008
Primeniyazidayi
an hour ago
Putnam 2000 B4
ahaanomegas   5
N an hour ago by ZeroAlephZeta
Let $f(x)$ be a continuous function such that $f(2x^2-1)=2xf(x)$ for all $x$. Show that $f(x)=0$ for $-1\le x \le 1$.
5 replies
+1 w
ahaanomegas
Sep 6, 2011
ZeroAlephZeta
an hour ago
Locus of sphere cutting three spheres along great circles
Miquel-point   0
an hour ago
Source: Romanian IMO TST 1981, Day 2 P3
Consider three fixed spheres $S_1, S_2, S_3$ with pairwise disjoint interiors. Determine the locus of the centre of the sphere intersecting each $S_i$ along a great circle of $S_i$.

Stere Ianuș
0 replies
Miquel-point
an hour ago
0 replies
Locus problem with circles in space
Miquel-point   0
2 hours ago
Source: RNMO 1979 10.4
Consider two circles $\mathcal C_1$ and $\mathcal C_2$ lying in parallel planes. Describe the locus of the midpoint of $M_1M_2$ when $M_i$ varies along $\mathcal C_i$ for $i=1,2$.

Ioan Tomescu
0 replies
Miquel-point
2 hours ago
0 replies
sum of some = product of others (in ring)
Miquel-point   0
2 hours ago
Source: RNMO SHL 2025, grade 12
Determine all finite commutative rings $A$ with at least four elements such that for every $S\subsetneq A^*=A\setminus \{0\}$ with $|S|\ge 2$ we have
\[\sum_{x\in S}x=\prod_{x\in A^*\setminus S}x.\]
Ștefan Solomon
0 replies
Miquel-point
2 hours ago
0 replies
abc=a+b+c in ring
Miquel-point   0
2 hours ago
Source: RNMO SHL 2025, grade 12
In which finite rings can we find three (not necessarily distinct) nonzero elements so that their sum equals their product?

David-Andrei Anghel
0 replies
Miquel-point
2 hours ago
0 replies
Geometry
youochange   3
N 2 hours ago by Double07
m:}
Let $\triangle ABC$ be a triangle inscribed in a circle, where the tangents to the circle at points $B$ and $C$ intersect at the point $P$. Let $M$ be a point on the arc $AC$ (not containing $B$) such that $M \neq A$ and $M \neq C$. Let the lines $BC$ and $AM$ intersect at point $K$. Let $P'$ be the reflection of $P$ with respect to the line $AM$. The lines $AP'$ and $PM$ intersect at point $Q$, and $PM$ intersects the circumcircle of $\triangle ABC$ again at point $N$.

Prove that the point $Q$ lies on the circumcircle of $\triangle ANK$.
3 replies
youochange
Today at 11:27 AM
Double07
2 hours ago
Sequence of projections is convergent
Filipjack   0
3 hours ago
Source: Romanian National Olympiad 1997 - Grade 10 - Problem 3
A point $A_0$ and two lines $d_1$ and $d_2$ are given in the space. For each nonnegative integer $n$ we denote by $B_n$ the projection of $A_n$ on $d_2,$ and by $A_{n+1}$ the projection of $B_n$ on $d_1.$ Prove that there exist two segments $[A'A''] \subset d_1$ and $[B'B''] \subset d_2$ of length $0.001$ and a nonnegative integer $N$ such that $A_n \in [A'A'']$ and $B_n \in [B'B'']$ for any $n \ge N.$
0 replies
Filipjack
3 hours ago
0 replies
Right-angled triangle if circumcentre is on circle
liberator   76
N 4 hours ago by numbertheory97
Source: IMO 2013 Problem 3
Let the excircle of triangle $ABC$ opposite the vertex $A$ be tangent to the side $BC$ at the point $A_1$. Define the points $B_1$ on $CA$ and $C_1$ on $AB$ analogously, using the excircles opposite $B$ and $C$, respectively. Suppose that the circumcentre of triangle $A_1B_1C_1$ lies on the circumcircle of triangle $ABC$. Prove that triangle $ABC$ is right-angled.

Proposed by Alexander A. Polyansky, Russia
76 replies
liberator
Jan 4, 2016
numbertheory97
4 hours ago
APMO 2016: Great triangle
shinichiman   26
N 4 hours ago by ray66
Source: APMO 2016, problem 1
We say that a triangle $ABC$ is great if the following holds: for any point $D$ on the side $BC$, if $P$ and $Q$ are the feet of the perpendiculars from $D$ to the lines $AB$ and $AC$, respectively, then the reflection of $D$ in the line $PQ$ lies on the circumcircle of the triangle $ABC$. Prove that triangle $ABC$ is great if and only if $\angle A = 90^{\circ}$ and $AB = AC$.

Senior Problems Committee of the Australian Mathematical Olympiad Committee
26 replies
shinichiman
May 16, 2016
ray66
4 hours ago
IMO ShortList 2001, geometry problem 2
orl   48
N 5 hours ago by legogubbe
Source: IMO ShortList 2001, geometry problem 2
Consider an acute-angled triangle $ABC$. Let $P$ be the foot of the altitude of triangle $ABC$ issuing from the vertex $A$, and let $O$ be the circumcenter of triangle $ABC$. Assume that $\angle C \geq \angle B+30^{\circ}$. Prove that $\angle A+\angle COP < 90^{\circ}$.
48 replies
orl
Sep 30, 2004
legogubbe
5 hours ago
Range of solutions to the log equation
obihs   3
N Apr 4, 2025 by solyaris
Source: Own
Let $n$ be a positive integer, and consider the equation:
$$(\log x)^n - x + 1 = 0\quad\cdots(\heartsuit)$$Answer the following questions. You may assume that $2.7<e<2.72$ is known.

$(1)\quad$ Determine the number of real solutions of equation $(\heartsuit)$ for each $n$.

$(2)\quad$ For $n\ge 3$ , let $r_n$ be the segond largest real solution of $(\heartsuit)$.

$(\i)\quad$ Find $\alpha$ such that $\lim_{n\to\infty} r_n =\alpha.$

$(\i\i)\quad$ Find $\lfloor\beta\rfloor$, where $\beta$ is defined as

$$\lim_{n\to\infty}n(r_n-\alpha)=\beta.$$
3 replies
obihs
Apr 1, 2025
solyaris
Apr 4, 2025
Range of solutions to the log equation
G H J
G H BBookmark kLocked kLocked NReply
Source: Own
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
obihs
2 posts
#1
Y by
Let $n$ be a positive integer, and consider the equation:
$$(\log x)^n - x + 1 = 0\quad\cdots(\heartsuit)$$Answer the following questions. You may assume that $2.7<e<2.72$ is known.

$(1)\quad$ Determine the number of real solutions of equation $(\heartsuit)$ for each $n$.

$(2)\quad$ For $n\ge 3$ , let $r_n$ be the segond largest real solution of $(\heartsuit)$.

$(\i)\quad$ Find $\alpha$ such that $\lim_{n\to\infty} r_n =\alpha.$

$(\i\i)\quad$ Find $\lfloor\beta\rfloor$, where $\beta$ is defined as

$$\lim_{n\to\infty}n(r_n-\alpha)=\beta.$$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rchokler
2953 posts
#2 • 1 Y
Y by obihs
Note that $\heartsuit'=\frac{n\ln^{n-1}x}{x}-1$ and $\heartsuit''=\frac{n(n-1)\ln^{n-2}x-nx\ln^{n-1}x}{x^2}=\frac{n(n-1-x\ln x)\ln^{n-2}x}{x^2}$

$\heartsuit''=0\implies x\ln x=n-1$. Since $(x\ln x)'=\ln x+1$ is monotonic increasing with $\heartsuit''$ has minimum $-\frac{1}{e}$ at $x=\frac{1}{e}$. Note that $\lim_{x\to 0^+}x\ln x=0$ and $\lim_{x\to\infty}x\ln x=\infty$. So $\heartsuit''=0$ has only one solution $x^*$.

This means $\heartsuit'$ is monotonic on $(0,x^*)$ and monotonic on $(x^*,\infty)$, so $\heartsuit$ has at most one critical point in each of these intervals.

But also note $\lim_{x\to\infty}\ln^n x=\infty$ and $\lim_{x\to 0^+}\ln^nx=\begin{cases}\infty&\quad\text{even }n\\-\infty&\quad\text{odd }n\end{cases}$. Also $\heartsuit'(1)=-1$ and $\heartsuit(1)=0$.

Therefore at $n\geq 3$ when $n\geq 3$, $\heartsuit=0$ has $2$ real solutions for $n$ even, and $3$ real solutions for $n$ odd.

At $n=1$ and $n=2$ only one root.

The second largest solution is $r_n=1$, so $\alpha=\lim_{n\to\infty} r_n=1$ and $\alpha=\lim_{n\to\infty} n(r_n-\alpha)=0$.

It is more interesting for the largest root of $\heartsuit$, since that solution is decreasing with limit $e$, and the smallest solution in the odd $n$ cases, since that solution is decreasing with limit $\frac{1}{e}$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
obihs
2 posts
#3
Y by
@rchokler
Thank you for answering!!!!
But actually, when $n=3$, there are $4$ real solutions of $(\heartsuit)$.
about $x=0.438, 1, 4.688, 96.258$
I hope this helps you :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
solyaris
616 posts
#4 • 1 Y
Y by obihs
Nice problem! Let $f(x) = \ln(x)^n - x + 1$. We have $f'(x) = n \ln(x)^{n-1} \frac 1 x - 1$ and $f''(x) = n \ln(x)^{n-2} \frac 1 {x^2} (n-1 - \ln(x))$. So $f$ is concave on $[e,e^{n-1}]$ and convex on $[e^{n-1},\infty)$. On the other hand $f(e) = 2-e < 0$, $f(e^{n-1}) = (n-1)^n - e^{n-1} + 1 > 0$ for $n \ge 4$ and $f(x) \to -\infty$ for $x \to \infty$. By convexity/concavity this implies that we have exactly one zero in $[e,e^{n-1}]$ and exactly one zero in $[e^{n-1},\infty)$.

For the asymptotics of the second largest zero $r_n$ we note that $f(e) < 0$ and
$$
f(e^{1+\frac e n}) = (1 + \frac e n)^n - e^{1 + \frac e n} + 1 \to e^e -e+1 > 0 \text{ for } n \to \infty. 
$$This implies that $r_n \in [e,e^{1 + \frac e n}]$ for $n$ sufficiently large. This already gives $\alpha = e$. For finer asymptotics we write $r_n = e^{1 + \frac {s_n} n}$. By the above $s_n \in [0,e]$ and in particular $s_n$ is bounded. We have
$$
e^{s_n} \sim (1 + \frac {s_n} n)^n = e^{1 + \frac {s_n} n} - 1 \to e-1 \text{ for } n \to \infty, 
$$which implies that $s_n \to \ln(e-1)$ for $n \to \infty$ and thus
$$
n(r_n - e) = n( e^{1 + \frac {s_n} n} - e) = ne ( e^{\frac {s_n} n} - 1) \to e \ln(e-1).  
$$
Z K Y
N Quick Reply
G
H
=
a