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
Different Paths Probability
Qebehsenuef   3
N 16 minutes ago by Etkan
Source: OBM
A mouse initially occupies cage A and is trained to change cages by going through a tunnel whenever an alarm sounds. Each time the alarm sounds, the mouse chooses any of the tunnels adjacent to its cage with equal probability and without being affected by previous choices. What is the probability that after the alarm sounds 23 times the mouse occupies cage B?
3 replies
Qebehsenuef
Apr 28, 2025
Etkan
16 minutes ago
Nice geometry
gggzul   0
33 minutes ago
Let $ABC$ be a acute triangle with $\angle BAC=60^{\circ}$. $H, O$ are the orthocenter and excenter. Let $D$ be a point on the same side of $OH$ as $A$, such that $HDO$ is equilateral. Let $P$ be a point on the same side of $BD$ as $A$, such that $BDP$ is equilateral. Let $Q$ be a point on the same side of $CD$ as $A$, such that $CDP$ is equilateral. Let $M$ be the midpoint of $AD$. Prove that $P, M, Q$ are collinear.
0 replies
gggzul
33 minutes ago
0 replies
Inspired by 2025 KMO
sqing   3
N an hour ago by sqing
Source: Own
Let $ a,b,c,d  $ be real numbers satisfying $ a+b+c+d=0 $ and $ a^2+b^2+c^2+d^2= 6 .$ Prove that $$ -\frac{3}{4} \leq abcd\leq\frac{9}{4}$$Let $ a,b,c,d  $ be real numbers satisfying $ a+b+c+d=6 $ and $ a^2+b^2+c^2+d^2= 18 .$ Prove that $$ -\frac{9(2\sqrt{3}+3)}{4} \leq abcd\leq\frac{9(2\sqrt{3}-3)}{4}$$
3 replies
sqing
Yesterday at 2:39 PM
sqing
an hour ago
Reflections and midpoints in triangle
TUAN2k8   0
an hour ago
Source: Own
Given an triangle $ABC$ and a line $\ell$ in the plane.Let $A_1,B_1,C_1$ be reflections of $A,B,C$ across the line $\ell$, respectively.Let $D,E,F$ be the midpoints of $B_1C_1,C_1A_1,A_1B_1$, respectively.Let $A_2,B_2,C_2$ be the reflections of $A,B,C$ across $D,E,F$, respectively.Prove that the points $A_2,B_2,C_2$ lie on a line parallel to $\ell$.
0 replies
TUAN2k8
an hour ago
0 replies
Find the expected END time for the given process
superpi   2
N an hour ago by Hello_Kitty
This problem suddenly popped up in my head. But I don't know how to deal with it.

There are N bulbs. All the bulbs' available time follows same exponential distribution with parameter lambda(Or any arbitrary distribution with mean $\mu$). We do following operations
1. First, turn on the all $N$ bulbs
2. For each $k >= 2$ bulbs goes out, append ONE NEW BULB and turn on (This step starts and finishes immediately when kth bulb goes out)
3. Repeat 2 until all the bulbs goes out

What is the expected terminate time for the above process for given $N, k, \lambda$?

Or, is there any more conditions to complete the problem?

2 replies
superpi
Yesterday at 4:33 PM
Hello_Kitty
an hour ago
a exhaustive question
shrayagarwal   19
N an hour ago by SomeonecoolLovesMaths
Source: number theory
If $ a$ and $ b$ are natural numbers such that $ a+13b$ is divisible by $ 11$ and $ a+11b$ is divisible by $ 13$, then find the least possible value of $ a+b$.
19 replies
shrayagarwal
Dec 4, 2006
SomeonecoolLovesMaths
an hour ago
GEOMETRY GEOMETRY GEOMETRY
Kagebaka   72
N an hour ago by AR17296174
Source: IMO 2021/3
Let $D$ be an interior point of the acute triangle $ABC$ with $AB > AC$ so that $\angle DAB = \angle CAD.$ The point $E$ on the segment $AC$ satisfies $\angle ADE =\angle BCD,$ the point $F$ on the segment $AB$ satisfies $\angle FDA =\angle DBC,$ and the point $X$ on the line $AC$ satisfies $CX = BX.$ Let $O_1$ and $O_2$ be the circumcenters of the triangles $ADC$ and $EXD,$ respectively. Prove that the lines $BC, EF,$ and $O_1O_2$ are concurrent.
72 replies
Kagebaka
Jul 20, 2021
AR17296174
an hour ago
Bosnia and Herzegovina JBMO TST 2015 Problem 4
gobathegreat   3
N an hour ago by FishkoBiH
Source: Bosnia and Herzegovina Junior Balkan Mathematical Olympiad TST 2015
Let $n$ be a positive integer and let $a_1$, $a_2$,..., $a_n$ be positive integers from set $\{1, 2,..., n\}$ such that every number from this set occurs exactly once. Is it possible that numbers $a_1$, $a_1 + a_2 ,..., a_1 + a_2 + ... + a_n$ all have different remainders upon division by $n$, if:
$a)$ $n=7$
$b)$ $n=8$
3 replies
gobathegreat
Sep 16, 2018
FishkoBiH
an hour ago
interesting diophantiic fe in natural numbers
skellyrah   1
N an hour ago by skellyrah
Find all functions \( f : \mathbb{N} \to \mathbb{N} \) such that for all \( m, n \in \mathbb{N} \),
\[
mn + f(n!) = f(f(n))! + n \cdot \gcd(f(m), m!).
\]
1 reply
skellyrah
Today at 8:01 AM
skellyrah
an hour ago
2017 CGMO P3
smy2012   6
N an hour ago by otato
Source: 2017 CGMO P3
Given $a_i\ge 0,x_i\in\mathbb{R},(i=1,2,\ldots,n)$. Prove that
$$((1-\sum_{i=1}^n a_i\cos x_i)^2+(1-\sum_{i=1}^n a_i\sin x_i)^2)^2\ge 4(1-\sum_{i=1}^n a_i)^3$$
6 replies
smy2012
Aug 13, 2017
otato
an hour ago
Nice "if and only if" function problem
ICE_CNME_4   3
N an hour ago by ICE_CNME_4
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!
3 replies
ICE_CNME_4
Yesterday at 7:23 PM
ICE_CNME_4
an hour ago
IMO 2014 Problem 1
Amir Hossein   134
N 2 hours ago by Ihatecombin
Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that
\[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\]
Proposed by Gerhard Wöginger, Austria.
134 replies
Amir Hossein
Jul 8, 2014
Ihatecombin
2 hours ago
36x⁴ + 12x² - 36x + 13 > 0
fxandi   4
N 4 hours ago by wh0nix
Prove that for any real $x \geq 0$ holds inequality $36x^4 + 12x^2 - 36x + 13 > 0.$
4 replies
fxandi
May 5, 2025
wh0nix
4 hours ago
2024 Miklós-Schweitzer problem 3
Martin.s   3
N Today at 1:30 AM by naenaendr
Do there exist continuous functions $f, g: \mathbb{R} \to \mathbb{R}$, both nowhere differentiable, such that $f \circ g$ is differentiable?
3 replies
Martin.s
Dec 5, 2024
naenaendr
Today at 1:30 AM
primes in a sequence
kapilpavase   2
N Apr 15, 2025 by ihategeo_1969
Source: STEMS 2021 Math Cat C Q3
Let $p \in \mathbb{N} \setminus \{0, 1\}$ be a fixed positive integer. Prove that for every $K > 0$, there exist infinitely many $n$ and $N$ such that there are atleast $\dfrac{KN}{\log(N)}$ primes among the following $N$ numbers given by
\[n + 1, n + 2^p, n + 3^p, \cdots, n + N^p.\]
Proposed by Bimit Mandal
2 replies
kapilpavase
Jan 25, 2021
ihategeo_1969
Apr 15, 2025
primes in a sequence
G H J
G H BBookmark kLocked kLocked NReply
Source: STEMS 2021 Math Cat C Q3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kapilpavase
595 posts
#1 • 3 Y
Y by Mathematicsislovely, Mango247, Mango247
Let $p \in \mathbb{N} \setminus \{0, 1\}$ be a fixed positive integer. Prove that for every $K > 0$, there exist infinitely many $n$ and $N$ such that there are atleast $\dfrac{KN}{\log(N)}$ primes among the following $N$ numbers given by
\[n + 1, n + 2^p, n + 3^p, \cdots, n + N^p.\]
Proposed by Bimit Mandal
This post has been edited 1 time. Last edited by kapilpavase, Jan 25, 2021, 9:12 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
kapilpavase
595 posts
#2
Y by
Official solution:
Let $p_1,p_2, \cdots ,p_l $ be the first $l$ primes that are of the form $pk+1$. Let, $P=p_1 \cdot p_2 \cdots p_l$.
Notice that as $p>1$ and $p \mid p_i-1$, $\forall \ 1 \le i \le l$, therefore, $\forall \ 1\le i \le l$, $\exists \ d_i$ such that, there does not exist any $x \in \mathbb{Z}_p$ with $x^p \equiv d_i \pmod{p_i}$.
Therefore by Chinese Remainder Theorem there exists $d \in \mathbb{N}$ such that $-d$ is not a $p$ th power modulo any $p_i$.
We consider numbers of the form $n = d + cP$ where $1 \le c \le N^p$. Notice that due to our selection $(i^p+d,P)=1$, $\forall \ 1\le i \le N$. Thus, if we apply Prime Number Theorem for arithmetic progressions, the number of primes in the set of numbers given by (we fix $i$),
$$i^p+d+cP, \ 1\le c \le N^p$$is asymptotically equivalent to,
$$\frac{N^p \times P}{\varphi(P) \log(N^p.P)} $$Hence, for sufficiently large $N$ the number of primes in the arithmetic sequence given above will be at least,
$$\frac{P}{(p+1)\varphi(P)} \frac{N^p}{\log(N)}$$Thus, the total number of primes(counted with multiplicity) among the numbers of the form,
$$i^p + d + cP \qquad 1\le i \le N, \ 1\le c \le N^p$$will be at least,
$$\frac{P}{(p+1)\varphi(P)} \frac{N^{p+1}}{\log(N)}$$Therefore by pigeonhole principle there exists $c \in \{1,2,\cdots , N^p \}$ such that, the numbers of the form,
$$cP+d+1, cP+d+2^p, \cdots , cP+d+N^p$$has at least,
$$\frac{P}{(p+1)\varphi(P)} \frac{N}{\log(N)}$$primes.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ihategeo_1969
241 posts
#3
Y by
Changing the variables names a bit...
Quote:
Let $t \ge 2$ be a fixed positive integer. Prove that for every $C > 0$, there exist infinitely many $m$ and $N$ such that there are atleast $\frac{CN}{\log N}$ primes among the following $N$ numbers given by
\[m + 1, m + 2^t, m + 3^t, \cdots, m + N^t.\]

Choose a number $n$ such that \[\frac{n}{\varphi{n}} \ge 100Ct\]which is just possible by making $n$ product of first arbitary many number of primes and noting that $\prod \frac{p}{p-1}=\zeta(-1)=\infty$.

Now let $N$ be some really big aah number. Now let $a$ be a number such that $-a$ isn't a $t^{\text{th}}$ power modulo $\text{rad}(n)$ (which is just CRT). Now we look at this $N^{100t} \times N$ table
\[
  \begin{bmatrix}
  1+n+a & 2^t+n+a & \dots & N^t+n+a \\
  1+2n+a & 2^t+2n+a & \dots & N^t+2n+a\\
  \vdots & \vdots & \ddots & \vdots \\
  1+N^{100t}n+a & 2^t+N^{100t}n+a & \dots & N^t+N^{100t}n+a \\
  \end{bmatrix}
\]Now by Prime Number Theorem on AP, we get that the number of primes in $i^{\text{th}}$ column is \begin{align*}
& \left(\frac{1}{\varphi(n)}+o(1) \right) \left(\frac{i^t+N^{100t}n+a}{\log(i^t+N^{100t}n+a)} - \frac{i^t+n+a}{\log(i^t+n+a)} \right) 
\ge  \left(\frac{n}{\varphi(n)}+o(1) \right) \left(\frac{N^{100t}}{100t \log N} - O(N^t) \right) 
\ge  \frac{C N^{100t}}{ \log N}
\end{align*}And hence the expected number of primes in each row is atleast \[\frac{C N^{100t}}{ \log N} \cdot \frac{N}{N^{100t}}=\frac{CN}{\log N}\]As required.
This post has been edited 1 time. Last edited by ihategeo_1969, Apr 15, 2025, 9:11 PM
Z K Y
N Quick Reply
G
H
=
a