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
100th post! (actually 105)
K1mchi_   12
N 5 hours ago by Craftybutterfly
here’s a math problem!
if the aops forum has 50 users and the users post once a minute, then how many posts will be made in a week? note that Fred and ted are twins and Elizabeth only visits the forum on weekends. assume that the users do not post during the 5 hour school day and 8 hours of sleep, but also that they have no life and only grind AOPS. it is not a leap year

anyway

this is my 105th post and I feel like I’ve grown a lot
not rlly lol
i have remained the same perfect person hahaha

Click to reveal hidden text
12 replies
K1mchi_
Yesterday at 7:22 PM
Craftybutterfly
5 hours ago
Books for AMC 10
GallopingUnicorn45   6
N Today at 4:16 AM by valisaxieamc
Hi all,

So I'm in 4th grade, and I'm having a go at AMC 10 and I've got some questions.
First, how many questions are needed to get Achievement Roll and AIME?
Second, what should I grind to prepare? I took the Intro to Algebra, Counting & Probability, and Number Theory courses already, completed those three books and will be starting the Intro to Geometry book soon. I'm planning to grind the Competition Math for Middle School and try to add in Volume 1: The Basics along with the three books that I already finished, plus geometry. Is there anything else to prepare with besides Alcumus and past papers and those books?

Thanks!
6 replies
GallopingUnicorn45
Yesterday at 2:26 AM
valisaxieamc
Today at 4:16 AM
1234th Post!
PikaPika999   221
N Today at 4:15 AM by valisaxieamc
I hit my 1234th post! (I think I missed it, I'm kinda late, :oops_sign:)

But here's a puzzle for you all! Try to create the numbers 1 through 25 using the numbers 1, 2, 3, and 4! You are only allowed to use addition, subtraction, multiplication, division, and parenthesis. If you're post #1, try to make 1. If you're post #2, try to make 2. If you're post #3, try to make 3, and so on. If you're a post after 25, then I guess you can try to make numbers greater than 25 but you can use factorials, square roots, and that stuff. Have fun!

1: $(4-3)\cdot(2-1)$
221 replies
PikaPika999
Apr 21, 2025
valisaxieamc
Today at 4:15 AM
Geometry
BQK   15
N Today at 4:14 AM by Evanlovemath
Help me, Why geometry is so difficult to learn
15 replies
BQK
Thursday at 2:58 PM
Evanlovemath
Today at 4:14 AM
No more topics!
Bogus Proof Marathon
pifinity   7610
N Apr 22, 2025 by iwastedmyusername
Hi!
I'd like to introduce the Bogus Proof Marathon.

In this marathon, simply post a bogus proof that is middle-school level and the next person will find the error. You don't have to post the real solution :P

Use classic Marathon format:
[hide=P#]a1b2c3[/hide]
[hide=S#]a1b2c3[/hide]


Example posts:

P(x)
-----
S(x)
P(x+1)
-----
Let's go!! Just don't make it too hard!
7610 replies
pifinity
Mar 12, 2018
iwastedmyusername
Apr 22, 2025
Bogus Proof Marathon
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.
e_is_2.71828
222 posts
#8173
Y by
iwastedmyusername wrote:
e_is_2.71828 wrote:
Pengu14 wrote:
Both solutions are wrong.
Oshawoot wrote:
S1973

Actually, your claim that the solutions are wrong is wrong. The issue is that in claiming $n$ to be the greatest positive integer and so (technically just greater than 1 lol), so $\mathbb{N}$ is thus unbounded. So both proofs are actually correct, and Oshawoot's solution is the incorrect one, as it fails to prove why the set of natural numbers is not bounded.

Actually, your claim that the solutions are wrong is wrong is wrong. You never disproved the claim $n^2 \le n$, you simply stated that $n^2 \ge n$. It's like using this logic to disprove P1974: "Well, no, pi can't be equal to 4, because pi is around 3.14."
What??? That is absurd to me that you actually even posted that. Equality is the only possible way both statements can be true, but besides that you just said "Oh, you just proved ~$p$ is true not $p$ is false." Like what???
This post has been edited 1 time. Last edited by e_is_2.71828, Apr 21, 2025, 1:54 AM
Reason: LaTeX
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
iwastedmyusername
118 posts
#8174 • 1 Y
Y by e_is_2.71828
ok admittedly i just wanted to use the "your claim that the solutions are wrong is wrong is wrong."

I think the real issue with your solution is that you fail to address the root of the bogus proof, that there is no largest real number (which can easily be proven by n+1>n for a supposed largest real number n). If I said "This proof is bogus because 2, a real number, is greater than 1", would that be a valid solution?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pengu14
577 posts
#8175
Y by
e_is_2.71828 wrote:
Pengu14 wrote:
Both solutions are wrong.
Oshawoot wrote:
S1973

Actually, your claim that the solutions are wrong is wrong. The issue is that in claiming $n$ to be the greatest positive integer, and so $n^2 \leq n$, you are contradicting the proposition I proved, which is why your solution is wrong. In fact, an easy proof that $\mathbb{N}$ is unbounded is by letting $f(n)=n^2$, and $f(n_i) \in \mathbb{N}$ for all $n_i \in \mathbb{N}$, and $n_i < f(n_i)$ eventually for large enough $n_i$ (technically just greater than 1 lol), so $\mathbb{N}$ is thus unbounded. So both proofs are actually correct, and Oshawoot's solution is the incorrect one, as it fails to prove why the set of natural numbers is not bounded.

Did bro even read my “proof” :rotfl:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
e_is_2.71828
222 posts
#8176
Y by
Pengu14 wrote:
e_is_2.71828 wrote:
Pengu14 wrote:
Both solutions are wrong.
Oshawoot wrote:
S1973


Actually, your claim that the solutions are wrong is wrong. The issue is that in claiming $n$ to be the greatest positive integer, and so $n^2 \leq n$, you are contradicting the proposition I proved, which is why your solution is wrong. In fact, an easy proof that $\mathbb{N}$ is unbounded is by letting $f(n)=n^2$, and $f(n_i) \in \mathbb{N}$ for all $n_i \in \mathbb{N}$, and $n_i < f(n_i)$ eventually for large enough $n_i$ (technically just greater than 1 lol), so $\mathbb{N}$ is thus unbounded. So both proofs are actually correct, and Oshawoot's solution is the incorrect one, as it fails to prove why the set of natural numbers is not bounded.

Did bro even read my “proof” :rotfl:

What's hilarious is that you think you did something. I wrote what I had to say, if you simply can't understand that a "proof" in which you assume a statement $p$ but $p$ can be shown to be false then your proof is invalid. It's obvious that your assumption logically entailed something false.

Given:
If $p$, then $q$.
Not $q$.
Therefore, not $p$.

If there is a largest natural number $n$, then $n^2$ being a distinct natural number must be smaller.
It is not true that $n^2 < n$.
Therefore, there is no largest natural number. $\blacksquare$
This post has been edited 1 time. Last edited by e_is_2.71828, Apr 21, 2025, 12:42 PM
Reason: Edit
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
e_is_2.71828
222 posts
#8177
Y by
iwastedmyusername wrote:
ok admittedly i just wanted to use the "your claim that the solutions are wrong is wrong is wrong."

I think the real issue with your solution is that you fail to address the root of the bogus proof, that there is no largest real number (which can easily be proven by n+1>n for a supposed largest real number n). If I said "This proof is bogus because 2, a real number, is greater than 1", would that be a valid solution?

I do think so, yes, but I mean it wouldn't address why $2>1$ contradicts your logic/premises somewhere. I pointed directly where the proof doesn't work, and I provided a proof as you said as to why the set of natural numbers is indeed unbounded. I can't see what else I was supposed to do.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Soupboy0
342 posts
#8178
Y by
P1975
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Twinotter
16 posts
#8179
Y by
Soupboy0 wrote:
P1975

S1975
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
iwastedmyusername
118 posts
#8180
Y by
e_is_2.71828 wrote:
iwastedmyusername wrote:
ok admittedly i just wanted to use the "your claim that the solutions are wrong is wrong is wrong."

I think the real issue with your solution is that you fail to address the root of the bogus proof, that there is no largest real number (which can easily be proven by n+1>n for a supposed largest real number n). If I said "This proof is bogus because 2, a real number, is greater than 1", would that be a valid solution?

I do think so, yes, but I mean it wouldn't address why $2>1$ contradicts your logic/premises somewhere. I pointed directly where the proof doesn't work, and I provided a proof as you said as to why the set of natural numbers is indeed unbounded. I can't see what else I was supposed to do.

As it says in the literal first post, the next person will find the error that the previous person made, not just point out anything that's wrong in the bogus proof. The error isn't that n^2<=n, it's the assumption that there is a largest real number.
This post has been edited 1 time. Last edited by iwastedmyusername, Apr 21, 2025, 3:27 PM
Reason: a
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
e_is_2.71828
222 posts
#8181
Y by
Soupboy0 wrote:
P1975

P1975
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
e_is_2.71828
222 posts
#8182 • 1 Y
Y by Exponent11
iwastedmyusername wrote:
e_is_2.71828 wrote:
iwastedmyusername wrote:
ok admittedly i just wanted to use the "your claim that the solutions are wrong is wrong is wrong."

I think the real issue with your solution is that you fail to address the root of the bogus proof, that there is no largest real number (which can easily be proven by n+1>n for a supposed largest real number n). If I said "This proof is bogus because 2, a real number, is greater than 1", would that be a valid solution?

I do think so, yes, but I mean it wouldn't address why $2>1$ contradicts your logic/premises somewhere. I pointed directly where the proof doesn't work, and I provided a proof as you said as to why the set of natural numbers is indeed unbounded. I can't see what else I was supposed to do.

As it says in the literal first post, the next person will find the error that the previous person made, not just point out anything that's wrong in the bogus proof. The error isn't that n^2<=n, it's the assumption that there is a largest real number.

An error is what the person did wrong in the previous proof...
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pengu14
577 posts
#8183
Y by
e_is_2.71828 wrote:
If $n \in \mathbb{N}_*,$ then $n^2 \geq n$, not the other way around. This is true as $n \geq 1$ and so multiplying by $n$ ($n$ being positive) we have $n \cdot n \geq n \iff n^2 \geq n$.

The fact that n^2>n for n>1 is the reason for the contradiction. If n>1 is the largest real number, then all other real numbers are less than or equal to it (including n^2), which contradicts the fact that n^2>n for n>1. The actual mistake (which you failed to mention) was the incorrect assumption that a largest real number exists.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
e_is_2.71828
222 posts
#8185
Y by
Pengu14 wrote:
e_is_2.71828 wrote:
If $n \in \mathbb{N}_*,$ then $n^2 \geq n$, not the other way around. This is true as $n \geq 1$ and so multiplying by $n$ ($n$ being positive) we have $n \cdot n \geq n \iff n^2 \geq n$.

The fact that n^2>n for n>1 is the reason for the contradiction. If n>1 is the largest real number, then all other real numbers are less than or equal to it (including n^2), which contradicts the fact that n^2>n for n>1. The actual mistake (which you failed to mention) was the incorrect assumption that a largest real number exists.

Think of it like this:

Towards a contradiction (which you didn't write because you sought to prove it), assume $\mathbb{N}$ is bounded above by some number $k$. Then, $\mathbb{N}$ has a supremum, call it $n$, and $n \in \mathbb{N}$. Then, $n^2 \leq n$, but we know $n^2 \geq n$, so $n=n^2$. For $n \in \mathbb{N}$, $n^2=n \iff n=0$ or $n=1$. Regardless, $2>1>0$, which is a contradiction since $2 \in \mathbb{N}$, thus the original assupmtion that $\mathbb{N}$ is bounded is wrong by Reductio Ad Absurdum.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
vincentwant
1345 posts
#8186
Y by
isnt the error just assuming that there exists a largest natural number
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
e_is_2.71828
222 posts
#8187
Y by
vincentwant wrote:
isnt the error just assuming that there exists a largest natural number

There's nothing wrong with assuming it, but you can only entail a conditional. The assumption, however, is never made explicit.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
iwastedmyusername
118 posts
#8188
Y by
vincentwant wrote:
isnt the error just assuming that there exists a largest natural number

yes it is
Z K Y
N Quick Reply
G
H
=
a