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
IMO Shortlist 2014 N6
hajimbrak   28
N 30 minutes ago by MajesticCheese
Let $a_1 < a_2 <  \cdots <a_n$ be pairwise coprime positive integers with $a_1$ being prime and $a_1 \ge n + 2$. On the segment $I = [0, a_1 a_2  \cdots a_n ]$ of the real line, mark all integers that are divisible by at least one of the numbers $a_1 ,   \ldots , a_n$ . These points split $I$ into a number of smaller segments. Prove that the sum of the squares of the lengths of these segments is divisible by $a_1$.

Proposed by Serbia
28 replies
hajimbrak
Jul 11, 2015
MajesticCheese
30 minutes ago
3 knightlike moves is enough
sarjinius   3
N 34 minutes ago by JollyEggsBanana
Source: Philippine Mathematical Olympiad 2025 P6
An ant is on the Cartesian plane. In a single move, the ant selects a positive integer $k$, then either travels [list]
[*] $k$ units vertically (up or down) and $2k$ units horizontally (left or right); or
[*] $k$ units horizontally (left or right) and $2k$ units vertically (up or down).
[/list]
Thus, for any $k$, the ant can choose to go to one of eight possible points.
Prove that, for any integers $a$ and $b$, the ant can travel from $(0, 0)$ to $(a, b)$ using at most $3$ moves.
3 replies
sarjinius
Mar 9, 2025
JollyEggsBanana
34 minutes ago
Why is the old one deleted?
EeEeRUT   15
N 38 minutes ago by Tuvshuu
Source: EGMO 2025 P1
For a positive integer $N$, let $c_1 < c_2 < \cdots < c_m$ be all positive integers smaller than $N$ that are coprime to $N$. Find all $N \geqslant 3$ such that $$\gcd( N, c_i + c_{i+1}) \neq 1$$for all $1 \leqslant i \leqslant m-1$

Here $\gcd(a, b)$ is the largest positive integer that divides both $a$ and $b$. Integers $a$ and $b$ are coprime if $\gcd(a, b) = 1$.

Proposed by Paulius Aleknavičius, Lithuania
15 replies
EeEeRUT
Apr 16, 2025
Tuvshuu
38 minutes ago
Learning 3D Geometry
KAME06   2
N 44 minutes ago by KAME06
Could you help me with some 3D geometry books? Or any book with 3D geometry information, specially if it's focuses on math olympiads (like Putnam).
2 replies
KAME06
Apr 19, 2025
KAME06
44 minutes ago
My problem that I could not find(NT)
Nuran2010   0
an hour ago
Source: Own
While I was thinking on some other geometry problem, a NT problem came to my mind. Despite some tries(which were mostly order), I could not find a way to solve the problem. As I searched, this problem has never been posted before. Here is the problem.

Find all positive integers $a,b$ such that:
$a+b|2^{ab}+1$

Moreover, I wonder if there is a way to solve the question in this variant:

Find all positive integers $a,b,n$ such that:
$a+b|n^{ab}+1$
0 replies
Nuran2010
an hour ago
0 replies
Classic graph theory lemma?
eulerleonhardfan   1
N an hour ago by eulerleonhardfan
$n \in \mathbb{N}$ is given, $A$, $B$ are graphs on the same set of $n$ nodes, having $a, b$ connected components respectively. Prove that $A \cup B$ has at least $a+b-n$ connected components.
1 reply
eulerleonhardfan
an hour ago
eulerleonhardfan
an hour ago
circle geometry showing perpendicularity
Kyj9981   3
N an hour ago by JollyEggsBanana
Two circles $\omega_1$ and $\omega_2$ intersect at points $A$ and $B$. A line through $B$ intersects $\omega_1$ and $\omega_2$ at points $C$ and $D$, respectively. Line $AD$ intersects $\omega_1$ at point $E \neq A$, and line $AC$ intersects $\omega_2$ at point $F \neq A$. If $O$ is the circumcenter of $\triangle AEF$, prove that $OB \perp CD$.
3 replies
+1 w
Kyj9981
Mar 18, 2025
JollyEggsBanana
an hour ago
Min Number of Subsets of Strictly Increasing
taptya17   5
N an hour ago by kotmhn
Source: India EGMO TST 2025 Day 1 P1
Let $n$ be a positive integer. Initially the sequence $0,0,\cdots,0$ ($n$ times) is written on the board. In each round, Ananya choses an integer $t$ and a subset of the numbers written on the board and adds $t$ to all of them. What is the minimum number of rounds in which Ananya can make the sequence on the board strictly increasing?

Proposed by Shantanu Nene
5 replies
taptya17
Dec 13, 2024
kotmhn
an hour ago
Nice inequality
sqing   3
N an hour ago by Oksutok
Source: WYX
Let $a_1,a_2,\cdots,a_n  (n\ge 2)$ be real numbers . Prove that : There exist positive integer $k\in \{1,2,\cdots,n\}$ such that $$\sum_{i=1}^{n}\{kx_i\}(1-\{kx_i\})<\frac{n-1}{6}.$$Where $\{x\}=x-\left \lfloor x \right \rfloor.$
3 replies
sqing
Apr 24, 2019
Oksutok
an hour ago
Inspired by 2024 Fall LMT Guts
sqing   2
N an hour ago by Jackson0423
Source: Own
Let $x$, $y$, $z$ are pairwise distinct real numbers satisfying $x^2+y =y^2 +z = z^2+x. $ Prove that
$$(x+y)(y+z)(z+x)=-1$$Let $x$, $y$, $z$ are pairwise distinct real numbers satisfying $x^2+2y =y^2 +2z = z^2+2x. $ Prove that
$$(x+y)(y+z)(z+x)=-8$$
2 replies
sqing
2 hours ago
Jackson0423
an hour ago
Dividing Pairs
Jackson0423   2
N 2 hours ago by Jackson0423
Source: Own
Let \( a \) and \( b \) be positive integers.
Suppose that \( a \) is a divisor of \( b^2 + 1 \) and \( b \) is a divisor of \( a^2 + 1 \).
Find all such pairs \( (a, b) \).
2 replies
Jackson0423
Apr 13, 2025
Jackson0423
2 hours ago
A Ball-Drawing problem
Vivacious_Owl   1
N 3 hours ago by alexheinis
Source: Inspired by a certain daily routine of mine
There are N identical black balls in a bag. I randomly take one ball out of the bag. If it is a black ball, I throw it away and put a white ball back into the bag instead. If it is a white ball, I simply throw it away and do not put anything back into the bag. The probability of getting any ball is the same.
Questions:
1. How many times will I need to reach into the bag to empty it?
2. What is the ratio of the expected maximum number of white balls in the bag to N in the limit as N goes to infinity?
1 reply
Vivacious_Owl
Today at 2:58 AM
alexheinis
3 hours ago
Matrices and Determinants
Saucepan_man02   6
N 5 hours ago by kiyoras_2001
Hello

Can anyone kindly share some problems/handouts on matrices & determinants (problems like Putnam 2004 A3, which are simple to state and doesnt involve heavy theory)?

Thank you..
6 replies
Saucepan_man02
Apr 4, 2025
kiyoras_2001
5 hours ago
Problem with lcm
snowhite   8
N Today at 6:54 AM by snowhite
Prove that $\underset{n\to \infty }{\mathop{\lim }}\,\sqrt[n]{lcm(1,2,3,...,n)}=e$
Please help me! Thank you!
8 replies
snowhite
Yesterday at 5:19 AM
snowhite
Today at 6:54 AM
IMC 1994 D1 P5
j___d   4
N Apr 5, 2025 by Fibonacci_math
a) Let $f\in C[0,b]$, $g\in C(\mathbb R)$ and let $g$ be periodic with period $b$. Prove that $\int_0^b f(x) g(nx)\,\mathrm dx$ has a limit as $n\to\infty$ and
$$\lim_{n\to\infty}\int_0^b f(x)g(nx)\,\mathrm dx=\frac 1b \int_0^b f(x)\,\mathrm dx\cdot\int_0^b g(x)\,\mathrm dx$$
b) Find
$$\lim_{n\to\infty}\int_0^\pi \frac{\sin x}{1+3\cos^2nx}\,\mathrm dx$$
4 replies
j___d
Mar 6, 2017
Fibonacci_math
Apr 5, 2025
IMC 1994 D1 P5
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.
j___d
340 posts
#1 • 3 Y
Y by Adventure10, Mango247, teomihai
a) Let $f\in C[0,b]$, $g\in C(\mathbb R)$ and let $g$ be periodic with period $b$. Prove that $\int_0^b f(x) g(nx)\,\mathrm dx$ has a limit as $n\to\infty$ and
$$\lim_{n\to\infty}\int_0^b f(x)g(nx)\,\mathrm dx=\frac 1b \int_0^b f(x)\,\mathrm dx\cdot\int_0^b g(x)\,\mathrm dx$$
b) Find
$$\lim_{n\to\infty}\int_0^\pi \frac{\sin x}{1+3\cos^2nx}\,\mathrm dx$$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
adafafsss
2 posts
#2 • 2 Y
Y by teomihai, soryn
b)$$I=\frac{1}{\pi}  \int_0^{\pi}sinx *   \int_0^{\pi}\frac{1}{1+3cos^2x}   $$$$        \int_0^{\pi}\frac{1}{1+3cos^2x} = \int_0^{\pi}\frac{sec^{2}x}{sec^{2}x+3}                                                               $$use$$ sec^2x+=tan^2x+1$$and then$$                                                               I' =                        \int_0^{\pi}\frac{dtanx}{sec^{2}x+3}  = \int_0^{\pi}\frac{dtanx}{tan^{2}x+4} $$It is now a simple calculation to find the integrand has
$$\frac{1}{2}arctan{\frac{tanx}{2}}$$as its primitive and observe the primitive is piecewise continuous,so we divide the interval into $$  \int_0^{\frac{\pi}{2}} + \int_{\frac{\pi}{2}}^{\pi}$$after a quick use of N-L formula we get $$I= I'*\frac{2}{\pi}=1$$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
adafafsss
2 posts
#3
Y by
By the way, I found a website has more details and solutions that is https://www.imc-math.org.uk/?year=1994&item=info
I hope that will help you
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Fibonacci_math
50 posts
#4
Y by
part (a):
[ig its an overkill :read: ]
First note that:
$$\int_0^b f(x)g(nx) \ dx=\int_0^{\frac{1}{n}b}f(x)g(nx) \ dx+\int_{\frac{1}{n}b}^{\frac{2}{n}b}f(x)g(nx) \ dx+\cdots + \int_{\frac{n-1}{n}b}^bf(x)g(nx) \ dx$$Also we have,
\begin{align*}
\int_{\frac{k}{n}b}^{\frac{k+1}{n}b}f(x)g(nx) \ dx &= \int_0^{\frac{b}{n}}f\left(y+\frac{k}{n}b\right)g(ny+kb) \ dy \ \ \ \ \ \ \ \ [\text{setting } y = x-\frac{k}{n}b]\\
&=\int_0^{\frac{b}{n}} f\left(y+\frac{k}{n}b\right)g(ny) \ dy \ \ \ \ \ \ \ \ \ [\text{since } g(x+kb)=g(x)]\\
&=\int_0^b \frac{1}{n}f\left(\frac{z+kb}{n}\right)g(z)  \ dz \ \ \ \ \ \ \ \ \ [\text{setting } z = ny]
\end{align*}Therefore,
\begin{align*}
\int_0^b f(x)g(nx) \ dx &= \sum_{k=0}^{n-1} \int_0^b f\left(\frac{x+kb}{n}\right)g(x)  \ dx\\
&= \int_0^b g(x)\left(\frac{1}{n}\sum_{k=0}^{n-1}f\left(\frac{x+kb}{n}\right)\right) \ dx
\end{align*}Now note that since $f$ is continuous on a compact domain, it must be uniformly continuous (by Heine-Cantor theorem).
Let $M = \int_0^b |g(x)| \ dx$.
Let $I_0 = \left[0, \frac{1}{n}b\right], \ I_1 = \left[\frac{1}{n}b, \frac{2}{n}b\right], \ldots, \ I_{n-1} = \left[\frac{n-1}{n}b, b\right]$
Note that $\frac{x+kb}{n}\in I_k$ for each $k=0,\ldots, n-1$. Also, the length of each interval is $\frac{b}{n}$.
Fix $\varepsilon>0$. Note that uniform continuity of $f$ tells that there exists $\delta>0$ such that $|f(x)-f(y)|<\frac{\varepsilon}{M}$ holds wherever $0<|x-y|<\delta$.
Now, choose $N$ large enough so that $0<\frac{b}{N}<\delta$. Then, for all $n\ge N$, we have $\left|f\left(\frac{x+kb}{n}\right)-f(t)\right|<\frac{\varepsilon}{M}$ for all $t\in I_k$ and $x\in (0,b)$ as $\left|\frac{x+kb}{n}-t\right|<\frac{b}{n}<\frac{b}{N}<\delta$.
So, we have,
\begin{align*}
\left|\frac{b}{n}f\left(\frac{x+kb}{n}\right)-\int_{\frac{k}{n}b}^{\frac{k+1}{n}b}f(t) \ dt\right| &=\left|\int_{\frac{k}{n}b}^{\frac{k+1}{n}b} f\left(\frac{x+kb}{n}\right) \ dt-\int_{\frac{k}{n}b}^{\frac{k+1}{n}b}f(t) \ dt\right|\\
&\le \int_{\frac{k}{n}b}^{\frac{k+1}{n}b} \left|f\left(\frac{x+kb}{n}\right)-f(t)\right| \ dt\\
&<\int_{\frac{k}{n}b}^{\frac{k+1}{n}b} \frac{\varepsilon}{M} \ dt = \frac{b}{Mn}\varepsilon.
\end{align*}for each $k=0, 1, \ldots, n-1$ and for all $x\in (0,b)$. So, triangle inequality gives:
$$\left|\frac{b}{n}\sum_{k=0}^{n-1}f\left(\frac{x+kb}{n}\right)-\int_0^b f(x) \ dx\right|\le \sum_{k=0}^{n-1} \left|\frac{b}{n}f\left(\frac{x+kb}{n}\right)-\int_{\frac{k}{n}b}^{\frac{k+1}{n}b}f(t) \ dt\right| < n\cdot \frac{b}{Mn}\varepsilon=\frac{b}{M}\cdot \varepsilon.$$Therefore, for all $n\ge N$, we have
$$\left|\frac{b}{n}\sum_{k=0}^{n-1}f\left(\frac{x+kb}{n}\right)-\int_0^b f(x) \ dx\right|< \frac{b}{M}\cdot \varepsilon$$$$\implies \left|\frac{1}{n}\sum_{k=0}^{n-1}f\left(\frac{x+kb}{n}\right)-\frac{1}{b}\int_0^b f(x) \ dx\right|< \frac{\varepsilon}{M}$$
$$\implies \left|\int_0^b g(x)\left(\frac{1}{n} \sum_{k=0}^{n-1}f\left(\frac{x+kb}{n}\right)\right) \ dx - \int_0^b g(x) \left(\frac{1}{b}\int_0^b f(t) \ dt\right) \ dx\right|$$$$\le \int_0^b |g(x)|\left|\frac{1}{n}\sum_{k=0}^{n-1}f\left(\frac{x+kb}{n}\right)-\frac{1}{b}\int_0^b f(t) \ dt\right| \ dx$$$$< \int_0^b |g(x)| (\varepsilon/M) \ dx = \varepsilon$$Now note that, $$\int_0^b g(x) \left(\frac{1}{b}\int_0^b f(t) \ dt\right) \ dx = \frac{1}{b} \left(\int_0^b f(x) \ dx\right)\left(\int_0^b g(x) \ dx\right)$$and
$$\int_0^b g(x)\left(\frac{1}{n} \sum_{k=0}^{n-1}f\left(\frac{x+kb}{n}\right)\right) \ dx = \int_0^b f(x)g(nx) \ dx$$So, we have,
$$\left|\int_0^b f(x)g(nx) \ dx - \frac{1}{b} \left(\int_0^b f(x) \ dx\right)\left(\int_0^b g(x) \ dx\right)\right|< \varepsilon$$
Hence the required limit exists and
$$\boxed{\lim_{n\rightarrow \infty} \int_0^b f(x)g(nx) \ dx = \frac{1}{b} \left(\int_0^b f(x) \ dx\right)\left(\int_0^b g(x) \ dx\right).}$$
https://external-preview.redd.it/Vt8un6DvXelUjrQPqHsJXaIijhQIMDRU50RjKVXe2JM.jpg?auto=webp&s=fbd4da7e4d2893906b86cebbff64976f0e1c03e2
This post has been edited 4 times. Last edited by Fibonacci_math, Apr 6, 2025, 6:27 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Fibonacci_math
50 posts
#5
Y by
Part (b):

First note that $1+3\cos^2{x}$ is periodic with fundamental period $\pi$. So using part (a) we can write
\begin{align*}
\lim_{n\rightarrow \infty} \int_0^\pi \frac{\sin{x}}{1+3\cos^2{nx}} \ dx&= \frac{1}{\pi} \left(\int_0^{\pi} \sin{x}\right)\left(\int_0^{\pi} \frac{dx}{1+3\cos^2{x}}\right)\\
&=\frac{2}{\pi}\int_0^{\pi} \frac{\csc^2{x} \ dx}{1+4\cot^2{x}}\\
&=\frac{2}{\pi} \int_{\infty}^{-\infty} \frac{-dt}{1+4t^2} \ \ \ \ \ \ [t = \cot{x}]  \\
&=\frac{2}{\pi} \int_{-\infty}^{\infty} \frac{dt}{1+4t^2}\\
&=\frac{1}{\pi} [\tan^{-1}{2t}]_{-\infty}^{\infty}\\
&=\boxed{1}
\end{align*}
Z K Y
N Quick Reply
G
H
=
a