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
Romanian National Olympiad 1996 – Grade 11 – Problem 4
Filipjack   0
3 minutes ago
Source: Romanian National Olympiad 1996 – Grade 11 – Problem 4
Let $A,B,C,D \in \mathcal{M}_n(\mathbb{C}),$ $A$ and $C$ invertible. Prove that if $A^k B = C^k D$ for any positive integer $k,$ then $B=D.$
0 replies
Filipjack
3 minutes ago
0 replies
Periodic functions (Romania 1996)
Filipjack   0
9 minutes ago
Source: Romanian National Olympiad 1996 – Grade 11 – Problem 2
a) Let $f_1,f_2,\ldots,f_n: \mathbb{R} \to \mathbb{R}$ be periodical functions such that the function $f: \mathbb{R} \to \mathbb{R},$ $f=f_1+f_2+\ldots+f_n$ has finite limit at $\infty.$ Prove that $f$ is constant.

b) If $a_1,a_2,a_3$ are real numbers such that $a_1 \cos(a_1x) + a_2 \cos (a_2x) + a_3 \cos(a_3x) \ge 0$ for every $x \in \mathbb{R},$ then $a_1a_2a_3=0.$
0 replies
Filipjack
9 minutes ago
0 replies
Derivatives have IVP (Romania 1996)
Filipjack   0
16 minutes ago
Source: Romanian National Olympiad 1996 – Grade 11 – Problem 1
Let $I \subset \mathbb{R}$ be a nondegenerate interval and $f:I \to \mathbb{R}$ a differentiable function. We denote $J= \left\{ \frac{f(b)-f(a)}{b-a} : a,b \in I, a<b \right\}.$ Prove that:

$a)$ $J$ is an interval;
$b)$ $J \subset f'(I),$ and the set $f'(I) \setminus J$ contains at most two elements;
$c)$ Using parts $a)$ and $b),$ deduce that $f'$ has the intermediate value property.
0 replies
Filipjack
16 minutes ago
0 replies
Tricky Determinant
Saucepan_man02   2
N 2 hours ago by Saucepan_man02
$$A=\begin{bmatrix}
1+x^2-y^2-z^2 & 2xy+2z & 2zx-2y\\
2xy-2z & 1+y^2-x^2-z^2 & 2yz+2x\\
2xz+2y & 2yz-2x & 1+z^2-x^2-y^2\\
\end{bmatrix}$$Find $\det(A)$.
2 replies
Saucepan_man02
Yesterday at 12:16 PM
Saucepan_man02
2 hours ago
IMC 2018 P1
ThE-dArK-lOrD   3
N 3 hours ago by Fibonacci_math
Source: IMC 2018 P1
Let $(a_n)_{n=1}^{\infty}$ and $(b_n)_{n=1}^{\infty}$ be two sequences of positive numbers. Show that the following statements are equivalent:
[list=1]
[*]There is a sequence $(c_n)_{n=1}^{\infty}$ of positive numbers such that $\sum_{n=1}^{\infty}{\frac{a_n}{c_n}}$ and $\sum_{n=1}^{\infty}{\frac{c_n}{b_n}}$ both converge;[/*]
[*]$\sum_{n=1}^{\infty}{\sqrt{\frac{a_n}{b_n}}}$ converges.[/*]
[/list]

Proposed by Tomáš Bárta, Charles University, Prague
3 replies
ThE-dArK-lOrD
Jul 24, 2018
Fibonacci_math
3 hours ago
Infinite series involving tau function
bakkune   1
N 3 hours ago by Safal
For each positive integer $n$, let $\tau(n)$ be the number of positive divisors of $n$. Evaluate
$$
\sum_{n=1}^{+\infty} (-1)^n \frac{\tau(n)}{n}
$$
1 reply
bakkune
Today at 4:35 AM
Safal
3 hours ago
two solutions
τρικλινο   4
N 5 hours ago by Safal
in a book:CORE MATHS for A-LEVEL ON PAGE 41 i found the following


1st solution


$x^2-5x=0$



$ x(x-5)=0$



hence x=0 or x=5



2nd solution



$x^2-5x=0$

$x-5=0$ dividing by x



hence the solution x=0 has been lost



is the above correct?
4 replies
τρικλινο
Yesterday at 6:20 PM
Safal
5 hours ago
high school math
aothatday   5
N Today at 3:32 AM by aothatday
Let $x_n$ be a positive root of the equation $x_n^n=x^2+x+1$. Prove that the following sequence converges: $n^2(x_n-x_{ n+1})$
5 replies
aothatday
Apr 10, 2025
aothatday
Today at 3:32 AM
Putnam 2003 B1
btilm305   13
N Today at 12:08 AM by clarkculus
Do there exist polynomials $a(x)$, $b(x)$, $c(y)$, $d(y)$ such that \[1 + xy + x^2y^2= a(x)c(y) + b(x)d(y)\] holds identically?
13 replies
btilm305
Jun 23, 2011
clarkculus
Today at 12:08 AM
High School Integration Extravaganza Problem Set
Riemann123   12
N Yesterday at 5:20 PM by jkim0656
Source: River Hill High School Spring Integration Bee
Hello AoPS!

Along with user geodash2, I have organized another high-school integration bee (River Hill High School Spring Integration Bee) and wanted to share the problems!

We had enough folks for two concurrent rooms, hence the two sets. (ARML kids from across the county came.)

Keep in mind that these integrals were written for a high-school contest-math audience. I hope you find them enjoyable and insightful; enjoy!


[center]Warm Up Problems[/center]
\[
\int_{1}^{2} \frac{x^{3}+x^2}{x^5}dx
\]\[\int_{2025}^{2025^{2025}}\frac{1}{\ln\left(2025\right)\cdot x}dx\]\[
\int(\sin^2(x)+\cos^2(x)+\sec^2(x)+\csc^2(x))dx
\]\[
\int_{-2025.2025}^{2025.2025}\sin^{2025}(2025x)\cos^{2025}(2025x)dx
\]\[
    \int_{\frac \pi 6}^{\frac \pi 3} \tan(\theta)^2d\theta
\]\[
\int  \frac{1+\sqrt{t}}{1+t}dt
\]-----
[center]Easier Division Set 1[/center]
\[\int \frac{x^{2}+2x+1}{x^{3}+3x^{2}+3x+3}dx
\]\[\int_{0}^{\frac{3\pi}{2}}\left(\frac{\pi}{2}-x\right)\sin\left(x\right)dx\]\[
\int_{-\pi/2}^{\pi/2}x^3e^{-x^2}\cos(x^2)\sin^2(x)dx
\]\[
\int\frac{1}{\sqrt{12-t^{2}+4t}}dt
\]\[
\int \frac{\sqrt{e^{8x}}}{e^{8x}-1}dx
\]-----
[center]Easier Division Set 2[/center]
\[
\int \frac{e^x}{e^{2x}+1} dx
\]\[
\int_{-5}^5\sqrt{25-u^2}du
\]\[
\int_{-\frac12}^\frac121+x+x^2+x^3\ldots dx
\]\[\int \cos(\cos(\cos(\ln \theta)))\sin(\cos(\ln \theta))\sin(\ln \theta)\frac{1}{\theta}d\theta\]\[\int_{0}^{\frac{1}{6}}\frac{8^{2x}}{64^{2x}-8^{\left(2x+\frac{1}{3}\right)}+2}dx\]-----
[center]Harder Division Set 1[/center]
\[\int_{0}^{\frac{\pi}{2}}\frac{\sin\left(x\right)}{\sin\left(x\right)+\cos\left(x\right)}+\frac{\sin\left(\frac{\pi}{2}-x\right)}{\sin\left(\frac{\pi}{2}-x\right)+\cos\left(\frac{\pi}{2}-x\right)}dx\]\[
\int_0^{\infty}e^{-x}\Bigl(\cos(20x)+\sin(20x)\Bigr) dx
\]\[
\lim_{n\to \infty}\frac{1}{n}\int_{1}^{n}\sin(nt)^2dt
\]\[
\int_{x=0}^{x=1}\left( \int_{y=-x}^{y=x} \frac{y^2}{x^2+y^2}dy\right)dx
\]\[
\int_{0}^{13}\left\lceil\log_{10}\left(2^{\lceil x\rceil }x\right)\right\rceil dx
\]-----
[center]Harder Division Set 2[/center]
\[
\int \frac{6x^2}{x^6+2x^3+2}dx
\]\[
\int -\sin(2\theta)\cos(\theta)d\theta
\]\[
\int_{0}^{5}\sin(\frac{\pi}2 \lfloor{x}\rfloor x) dx
\]\[
\int_{0}^{1} \frac{\sin^{-1}(\sqrt{x})^2}{\sqrt{x-x^2}}dx
\]\[
\int\left(\cot(\theta)+\tan(\theta)\right)^2\cot(2\theta)^{100}d\theta
\]-----
[center]Bonanza Round (ie Fun/Hard/Weird Problems) (In No Particular Order)[/center]
\[
\int \ln\left\{\sqrt[7]{x}^\frac1{\ln\left\{\sqrt[5]{x}^\frac1{\ln\left\{\sqrt[3]{x}^\frac1{\ln\left\{\sqrt{x}\right\}}\right\}}\right\}}\right\}dx
\]\[\int_{1}^{{e}^{\pi}} \cos(\ln(\sqrt{u}))du\]\[
\int_e^{\infty}\frac {1-x\ln{x}}{xe^x}dx
\]\[\int_{0}^{1}\frac{e^{x}}{\left(x^{2}+3x+2\right)^{\frac{1}{2^{1}}}}\times\frac{e^{-\frac{x^{2}}{2}}}{\left(x^{2}+3x+2\right)^{\frac{1}{2^{2}}}}\times\frac{e^{\frac{x^{3}}{3}}}{\left(x^{2}+3x+2\right)^{\frac{1}{2^{3}}}}\times\frac{e^{-\frac{x^{4}}{4}}}{\left(x^{2}+3x+2\right)^{\frac{1}{2^{4}}}} \ldots \,dx\]
For $x$ on the domain $-0.2025\leq x\leq 0.2025$ it is known that \[\displaystyle f(x)=\sin\left(\int_{0}^x \sqrt[3]{\cos\left(\frac{\pi}{2} t\right)^3+26}\ dt\right)\]is invertible. What is $\displaystyle (f^{-1})'(0)$?
12 replies
Riemann123
Friday at 2:11 PM
jkim0656
Yesterday at 5:20 PM
limiting behavior of the generalization of IMO 1968/6 for arbitrary powers
revol_ufiaw   1
N Yesterday at 3:17 PM by alexheinis
Source: inspired by IMO 1968/6
Define $f : \mathbb{N} \rightarrow \mathbb{N}$ by
\[f(n) = \sum_{i\ge 0} \bigg\lfloor \frac{n + a^i}{a^{i+1}}\bigg\rfloor=\bigg\lfloor \frac{n + 1}{a} \bigg\rfloor + \bigg\lfloor \frac{n + a}{a^2} \bigg\rfloor + \bigg\lfloor \frac{n + a^2}{a^3} \bigg\rfloor + \cdots\]for some fixed $a \in \mathbb{N}$. Prove that
\[\lim_{n \rightarrow \infty} \frac{f(n)}{n/(a-1)} = 1.\]
[P.S.: IMO 1968/6 asks to prove $f(n) = n$ for $a = 2$.]
1 reply
revol_ufiaw
Yesterday at 1:43 PM
alexheinis
Yesterday at 3:17 PM
Putnam 2015 B4
Kent Merryfield   22
N Yesterday at 2:58 PM by lpieleanu
Let $T$ be the set of all triples $(a,b,c)$ of positive integers for which there exist triangles with side lengths $a,b,c.$ Express \[\sum_{(a,b,c)\in T}\frac{2^a}{3^b5^c}\]as a rational number in lowest terms.
22 replies
Kent Merryfield
Dec 6, 2015
lpieleanu
Yesterday at 2:58 PM
A real analysis Problem from contest
Safal   2
N Yesterday at 11:17 AM by Safal
Source: Random.
Let $f: (0,\infty)\rightarrow \mathbb{R}$ be a function such that $$\lim_{x\rightarrow \infty} f(x)=1$$and $$f(x+1)=f(x)$$for all $x\in (0,\infty)$

Prove or disprove the following statements.

1.$f$ is continuous.
2.$f$ is bounded.

Is My Idea correct?
2 replies
Safal
Yesterday at 8:34 AM
Safal
Yesterday at 11:17 AM
maximal determinant
EthanWYX2009   4
N Yesterday at 10:59 AM by loup blanc
Source: 2023 Aug taca-9
Let matrix
\[A=\begin{bmatrix} 1&1&1&1&1\\1&-1&1&-1&1\\?&?&?&?&?\\?&?&?&?&?\\?&?&?&?&?\end{bmatrix}\in\mathbb R^{5\times 5}\]satisfy $\text{tr} (AA^T)=28.$ Determine the maximum value of $\det A.$
4 replies
EthanWYX2009
Apr 9, 2025
loup blanc
Yesterday at 10:59 AM
Sequence, limit and number theory
KAME06   3
N Apr 5, 2025 by Rainbow1971
Source: Ecuador National Olympiad OMEC level U 2023 P6 Day 2
A positive integers sequence is defined such that, for all $n \ge 2$, $a_{n+1}$ is the greatest prime divisor of $a_1+a_2+...+a_n$. Find:
$$\lim_{n \rightarrow \infty} \frac{a_n}{n}$$
3 replies
KAME06
Feb 6, 2025
Rainbow1971
Apr 5, 2025
Sequence, limit and number theory
G H J
G H BBookmark kLocked kLocked NReply
Source: Ecuador National Olympiad OMEC level U 2023 P6 Day 2
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
KAME06
140 posts
#1 • 1 Y
Y by Rainbow1971
A positive integers sequence is defined such that, for all $n \ge 2$, $a_{n+1}$ is the greatest prime divisor of $a_1+a_2+...+a_n$. Find:
$$\lim_{n \rightarrow \infty} \frac{a_n}{n}$$
This post has been edited 1 time. Last edited by KAME06, Feb 6, 2025, 8:33 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Rainbow1971
31 posts
#2
Y by
And what are the definitions of $a_1$ and $a_2$?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
KAME06
140 posts
#4
Y by
Rainbow1971 wrote:
And what are the definitions of $a_1$ and $a_2$?

We just know they are two positive integers
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Rainbow1971
31 posts
#5
Y by
This is indeed a charming little problem. As it is a little convoluted in character, I wish to make it a little more straightforward by setting $a_1 = a_2 = 1$. The general setting with arbitrary starting values leads to "essentially" the same problem, but restricting those values to 1 helps to avoid unnecessary variables.

For convenience, I set $s_n = a_1 + a_2 + \ldots + a_{n-1}$, so that $a_n$ will be the biggest prime divisor of $s_n$. In order to gain some familiarity with the situation, the following table provides the relevant values for $n \in \{3, 4, \ldots, 30\}$:

$n$ $\quad$ $s_n$ $\quad$ $a_n$ $\quad$ $a_n/n$
3 $\quad \ $ 2 $\quad \ $ 2 $\quad \ $ 2/3
4 $\quad \ $ 4 $\quad \ $ 2 $\quad \ $ 1/2
5 $\quad \ $ 6 $\quad \ $ 3 $\quad \ $ 3/5
6 $\quad \ $ 9 $\quad \ $ 3 $\quad \ $ 1/2
7 $\quad \ $ 12 $\quad \ $ 3 $\quad \ $ 3/7
8 $\quad \ $ 15 $\quad \ $ 5 $\quad \ $ 5/8
9 $\quad \ $ 20 $\quad \ $ 5 $\quad \ $ 5/9
10 $\quad \ $ 25 $\quad \ $ 5 $\quad \ $ 1/2
11 $\quad \ $ 30 $\quad \ $ 5 $\quad \ $ 5/11
12 $\quad \ $ 35 $\quad \ $ 7 $\quad \ $ 7/12
13 $\quad \ $ 42 $\quad \ $ 7 $\quad \ $ 7/13
14 $\quad \ $ 49 $\quad \ $ 7 $\quad \ $ 1/2
15 $\quad \ $ 56 $\quad \ $ 7 $\quad \ $ 7/15
16 $\quad \ $ 63 $\quad \ $ 7 $\quad \ $ 7/16
17 $\quad \ $ 70 $\quad \ $ 7 $\quad \ $ 7/17
18 $\quad \ $ 77 $\quad \ $ 11 $\quad \ $ 11/18
19 $\quad \ $ 88 $\quad \ $ 11 $\quad \ $ 11/19
20 $\quad \ $ 99 $\quad \ $ 11 $\quad \ $ 11/20
21 $\quad \ $ 110 $\quad \ $ 11 $\quad \ $ 11/21
22 $\quad \ $ 121 $\quad \ $ 11 $\quad \ $ 1/2
23 $\quad \ $ 132 $\quad \ $ 11 $\quad \ $ 11/23
24 $\quad \ $ 143 $\quad \ $ 13 $\quad \ $ 13/24
25 $\quad \ $ 156 $\quad \ $ 13 $\quad \ $ 13/25
26 $\quad \ $ 169 $\quad \ $ 13 $\quad \ $ 1/2
27 $\quad \ $ 182 $\quad \ $ 13 $\quad \ $ 13/27
28 $\quad \ $ 195 $\quad \ $ 13 $\quad \ $ 13/28
29 $\quad \ $ 208 $\quad \ $ 13 $\quad \ $ 13/29
30 $\quad \ $ 221 $\quad \ $ 17 $\quad \ $ 17/30


With respect to this table, we will refer to the first column as the index or line number, to the second column as the $s$-column, to the third column as the $a$-column, and to the respective entries as $s$-values and $a$-values.

The table suggests to some extent that the limit of $(a_n/n)$ is $\tfrac{1}{2}$, and we will now examine that hypothesis.

When we take a look at our table, we see that it consists of sections of constant values for $a_n$. In lines 12 to 17, for example, we consistently have the value 7 in the $a$-column. We will now investigate these sections a little closer, focussing on the values of $s_n$ and $a_n$. For that purpose, we define $p_i$ to be the $i$-th prime number (in their natural increasing order), i.e. $p_1 = 2$, $p_2 = 3$ etc.

We start our investigation in line 5 which marks the beginning of the section of the value 3 for $a_n$. We observe that the $s$-value and the $a$-value, that is 6 and 3, can be written as $p_{i-1} \cdot p_i$ and $p_i$ for $i=2$. Plainly speaking, the $s$-value is the product of the corresponding prime in the $a$-column and the previous prime. We will show that this is no coincidence for the first line of such a section.

We make a sketch of an inductive argument: By inspection, we see that, at the beginning of the section with the $a$-value 3, we do indeed have $p_{i-1} \cdot p_i$ and $p_i$ in those two columns. By definition of $s_n$, the value in the $s$-column in the next line is $p_{i-1} \cdot p_i + p_i$ which is the same as $p_i \cdot (p_{i-1} + 1)$. If the value in the $a$-column of that line does not change, $p_i$ is added to the $s$-value in the following line once again, resulting in the value $p_i \cdot (p_{i-1} + 2)$ there, and as long as nothing changes in the $a$-column, the values in the $s$-column will be of the form $p_i \cdot (p_{i-1} + k)$, $k \in \{1, 2, 3, \ldots\}$ in the following lines.

The value in the $a$-column will change once we reach the smallest $k$ such that $p_i \cdot (p_{i-1} + k)$ has a prime factor $p$ larger than $p_i$. As two different prime numbers are always relatively prime, this is equivalent to the fact that $p$ divides $p_{i-1} + k$. We start with $k=1$, when $p_{i-1} + k$ is smaller than $p_i$ and also smaller than any candidate prime number $p$ (which must even be greater than $p_i$). Clearly, the first $k$ such that $p_{i-1} + k$ has a prime divisor greater than $p_i$ is the one with $p_{i-1} + k = p_{i+1}$, so that our new prime number will be $p = p_{i+1}$, which then does not only divide $p_{i-1} + k$, but will be equal to it.

This shows that the length of the section under investigation is $p_{i+1}-p_{i-1}$ lines (as that was the crucial value of $k$ which initiated a change in the $a$-column). The last line of that section will have the value $p_i \cdot (p_{i+1}-1)$ in the $s$-column and $p_i$ in the $a$-column, and the new section will therefore begin with a line that has $p_i \cdot p_{i+1}$ in the $s$-column and $p_{i+1}$ in the $a$-column. In particular, this shows that the values in the $a$-column run through all the prime numbers in a monotonously increasing way.

So far, we have described the values in the $a$-column in terms of the sequence $(p_n)$. Now we have to consider them as actual elements of the sequence $(a_n)$, which, loosely speaking, means that we have to find a relation between those values and the line number.

The crucial insight of our work so far is now that, in the $a$-column, the prime number $p_i$ prevails for exactly $p_{i+1}-p_{i-1}$ lines. Thus the prime number $p_2= 3$, which appears for the first time in line 5, is succeeded by $p_3= 5$ in line $5 + p_3 - p_1$. By induction, the prime number $p_i$ (for some integer $i$) will appear in the $a$-column for the first time in line
$$5 + (p_3 - p_1) + (p_4 - p_2) + (p_5 - p_3) + \ldots + (p_{i-1} - p_{i-3}) + (p_i - p_{i-2}),$$and this telescoping sum is the same as
$$5 + p_i + p_{i-1} - p_2 - p_1 = 5 + p_i + p_{i-1} - 3 - 2 = p_i + p_{i-1}.$$
This means nothing less than $$a_{p_i + p_{i-1}} = p_i,$$
and therefore $$\frac{a_n}{n} = \frac{p_i}{p_i + p_{i-1}} \quad \text{for $n = p_i + p_{i-1}$}.$$
As the $a$-value does not change within a section (by definition of a section), we can conclude that, at the end of the section, which comes $p_{i+1}-p_{i-1}-1$ lines later, we have $$\frac{a_n}{n} = \frac{p_i}{p_i+p_{i+1}-1} \quad \text{for $n = p_i + p_{i+1}-1$}.$$
Within a section, the values of $\tfrac{a_n}{n}$ are clearly strictly decreasing, as it is only the index $n$ which changes. Therefore, to establish the limit of $\tfrac{a_n}{n}$, which is the ultimate objective of this text, it suffices to focus on the values of $\tfrac{a_n}{n}$ at the beginning and at the end of each section. If the values of the subsequence at the beginning, i.e.
$$(\frac{p_i}{p_i + p_{i-1}}),$$and at the end, i.e.
$$(\frac{p_i}{p_i+p_{i+1}-1})$$converge to the same limit, the entire sequence $(\tfrac{a_n}{n})$ will converge to that same limit by the squeezing theorem. There is the (still open) conjecture that there are infinitely many twin primes. If we assume that the conjecture is true, this would easily show that the only possible limit of our two subsequences from above, and therefore the whole sequence, is indeed $\tfrac{1}{2}$.

To actually prove that limit statement, some sophisticated approximation of $p_i$ is needed. I am somewhat hesitant to proceed here, however, as I feel that this is beyond what is reasonable for a problem from a Math olympiad. To me, the attraction of this problem lies in uncovering the more elementary results from above. If others can produce an elementary proof of the limit statement, though, I am very interested in hearing about it.
This post has been edited 3 times. Last edited by Rainbow1971, Apr 6, 2025, 1:03 PM
Z K Y
N Quick Reply
G
H
=
a