Summer and Fall classes are open for enrollment. Schedule today!

G
Topic
First Poster
Last Poster
k a June Highlights and 2025 AoPS Online Class Information
jlacosta   0
Jun 2, 2025
Congratulations to all the mathletes who competed at National MATHCOUNTS! If you missed the exciting Countdown Round, you can watch the video at this link. Are you interested in training for MATHCOUNTS or AMC 10 contests? How would you like to train for these math competitions in half the time? We have accelerated sections which meet twice per week instead of once starting on July 8th (7:30pm ET). These sections fill quickly so enroll today!

[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC 10 Problem Series[/list]
For those interested in Olympiad level training in math, computer science, physics, and chemistry, be sure to enroll in our WOOT courses before August 19th to take advantage of early bird pricing!

Summer camps are starting this 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 a transformative 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][*]June 5th, Thursday, 7:30pm ET: Open Discussion with Ben Kornell and Andrew Sutherland, Art of Problem Solving's incoming CEO Ben Kornell and CPO Andrew Sutherland host an Ask Me Anything-style chat. Come ask your questions and get to know our incoming CEO & CPO!
[*]June 9th, Monday, 7:30pm ET, Game Jam: Operation Shuffle!, Come join us to play our second round of Operation Shuffle! If you enjoy number sense, logic, and a healthy dose of luck, this is the game for you. No specific math background is required; all are welcome.[/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, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29
Sunday, Aug 17 - Dec 14
Tuesday, Aug 26 - Dec 16
Friday, Sep 5 - Jan 16
Monday, Sep 8 - Jan 12
Tuesday, Sep 16 - Jan 20 (4:30 - 5:45 pm ET/1:30 - 2:45 pm PT)
Sunday, Sep 21 - Jan 25
Thursday, Sep 25 - Jan 29
Wednesday, Oct 22 - Feb 25
Tuesday, Nov 4 - Mar 10
Friday, Dec 12 - Apr 10

Prealgebra 2 Self-Paced

Prealgebra 2
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21
Sunday, Aug 17 - Dec 14
Tuesday, Sep 9 - Jan 13
Thursday, Sep 25 - Jan 29
Sunday, Oct 19 - Feb 22
Monday, Oct 27 - Mar 2
Wednesday, Nov 12 - Mar 18

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28
Sunday, Aug 17 - Dec 14
Wednesday, Aug 27 - Dec 17
Friday, Sep 5 - Jan 16
Thursday, Sep 11 - Jan 15
Sunday, Sep 28 - Feb 1
Monday, Oct 6 - Feb 9
Tuesday, Oct 21 - Feb 24
Sunday, Nov 9 - Mar 15
Friday, Dec 5 - Apr 3

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 2 - Sep 17
Sunday, Jul 27 - Oct 19
Monday, Aug 11 - Nov 3
Wednesday, Sep 3 - Nov 19
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Friday, Oct 3 - Jan 16
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30
Wednesday, Aug 13 - Oct 29
Friday, Sep 12 - Dec 12
Sunday, Oct 26 - Feb 1
Monday, Dec 1 - Mar 2

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14
Thursday, Aug 7 - Nov 20
Monday, Aug 18 - Dec 15
Sunday, Sep 7 - Jan 11
Thursday, Sep 11 - Jan 15
Wednesday, Sep 24 - Jan 28
Sunday, Oct 26 - Mar 1
Tuesday, Nov 4 - Mar 10
Monday, Dec 1 - Mar 30

Introduction to Geometry
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19
Wednesday, Aug 13 - Feb 11
Tuesday, Aug 26 - Feb 24
Sunday, Sep 7 - Mar 8
Thursday, Sep 11 - Mar 12
Wednesday, Sep 24 - Mar 25
Sunday, Oct 26 - Apr 26
Monday, Nov 3 - May 4
Friday, Dec 5 - May 29

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
Friday, Aug 8 - Feb 20
Tuesday, Aug 26 - Feb 24
Sunday, Sep 28 - Mar 29
Wednesday, Oct 8 - Mar 8
Sunday, Nov 16 - May 17
Thursday, Dec 11 - Jun 4

Intermediate Counting & Probability
Sunday, Jun 22 - Nov 2
Sunday, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3
Wednesday, Sep 24 - Dec 17

Precalculus
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8
Wednesday, Aug 6 - Jan 21
Tuesday, Sep 9 - Feb 24
Sunday, Sep 21 - Mar 8
Monday, Oct 20 - Apr 6
Sunday, Dec 14 - May 31

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Wednesday, Jun 25 - Dec 17
Sunday, Sep 7 - Mar 15
Wednesday, Sep 24 - Apr 1
Friday, Nov 14 - May 22

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
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!)
Sunday, Aug 17 - Nov 9
Wednesday, Sep 3 - Nov 19
Tuesday, Sep 16 - Dec 9
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Oct 6 - Jan 12
Thursday, Oct 16 - Jan 22
Tues, Thurs & Sun, Dec 9 - Jan 18 (meets three times a week!)

MATHCOUNTS/AMC 8 Advanced
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Tuesday, Aug 26 - Nov 11
Thursday, Sep 4 - Nov 20
Friday, Sep 12 - Dec 12
Monday, Sep 15 - Dec 8
Sunday, Oct 5 - Jan 11
Tues, Thurs & Sun, Dec 2 - Jan 11 (meets three times a week!)
Mon, Wed & Fri, Dec 8 - Jan 16 (meets three times a week!)

AMC 10 Problem Series
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!)
Sunday, Aug 10 - Nov 2
Thursday, Aug 14 - Oct 30
Tuesday, Aug 19 - Nov 4
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Mon, Wed & Fri, Oct 6 - Nov 3 (meets three times a week!)
Tue, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 10 Final Fives
Monday, Jun 30 - Jul 21
Friday, Aug 15 - Sep 12
Sunday, Sep 7 - Sep 28
Tuesday, Sep 9 - Sep 30
Monday, Sep 22 - Oct 13
Sunday, Sep 28 - Oct 19 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, Oct 8 - Oct 29
Thursday, Oct 9 - Oct 30

AMC 12 Problem Series
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22
Sunday, Aug 10 - Nov 2
Monday, Aug 18 - Nov 10
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Tues, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 12 Final Fives
Thursday, Sep 4 - Sep 25
Sunday, Sep 28 - Oct 19
Tuesday, Oct 7 - Oct 28

AIME Problem Series A
Thursday, Oct 23 - Jan 29

AIME Problem Series B
Sunday, Jun 22 - Sep 21
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
Wednesday, Jun 11 - Aug 27
Tuesday, Sep 16 - Dec 9
Friday, Oct 17 - Jan 30

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
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
Thursday, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22
Friday, Oct 3 - Jan 16

USACO Bronze Problem Series
Sunday, Jun 22 - Sep 1
Wednesday, Sep 3 - Dec 3
Thursday, Oct 30 - Feb 5
Tuesday, Dec 2 - Mar 3

Physics

Introduction to Physics
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Monday, Jun 23 - Dec 15
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Jun 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
Harry Potter Hallows Areas
Spacepandamath13   4
N a few seconds ago by tikachaudhuri
Alright people, if you've read harry potter u know about the deathly hallows
they have a symbol though the triangle is the invisibility cloak the line is the want and the circle is the stone
find each section of the symbol and their areas assuming triangle is an equilateral triangle and a side of the triangle is length 1 unit.
4 replies
Spacepandamath13
an hour ago
tikachaudhuri
a few seconds ago
Picture of a student who is good at math 9
tuananh_vvvbb   3
N 7 minutes ago by nudinhtien
Hello, I am a student in a small town in Vietnam, currently I am a high school student with a pretty good math problem, share with you.
Let the triangle ABC point with AB<AC interconnecting the center circle O. Call H the orthocenter of the triangle ABC. Calling E, F, D is the intersection of BH with AC, CH with AB, AH with BC, respectively.Calling K,J is the midpoint of BC and AH respectively; AO beam cuts (O) at point S, AS cuts BC at point I and cuts EF at point M, EF straight line cuts AH at point P, BE cuts FD at L.
a) Prove that H,K,S is aligned and HK is parallel PI.
b) Calling N, T is the intersection of OK with FC, JK with BE, respectively. Prove that the T point belongs to the circle outside the BKN triangle
3 replies
tuananh_vvvbb
4 hours ago
nudinhtien
7 minutes ago
Find the smallest pos. integer m s.t. for any 14-division
orl   7
N an hour ago by Bryan0224
Source: CWMO 2001, Problem 8
We call $ A_1, A_2, \ldots, A_n$ an $ n$-division of $ A$ if

(i) $ A_1 \cap A_2 \cap \cdots \cap A_n = A$,
(ii) $ A_i \cap A_j \neq \emptyset$.

Find the smallest positive integer $ m$ such that for any $ 14$-division $ A_1, A_2, \ldots, A_{14}$ of $ A = \{1, 2, \ldots, m\}$, there exists a set $ A_i$ ($ 1 \leq i \leq 14$) such that there are two elements $ a, b$ of $ A_i$ such that $ b < a \leq \frac {4}{3}b$.
7 replies
orl
Dec 27, 2008
Bryan0224
an hour ago
CMO Question insanely hard
otwaenng   3
N an hour ago by oty
Source: cmo question
pls help this is sooo hard

Let $n>1$ be an integer and let $a_0,a_1,\ldots,a_n$ be non-negative real numbers. Define $S_k=\sum_{i=0}^k \binom{k}{i}a_i$ for $k=0,1,\ldots,n$. Prove that\[\frac{1}{n} \sum_{k=0}^{n-1} S_k^2-\frac{1}{n^2}\left(\sum_{k=0}^{n} S_k\right)^2\le \frac{4}{45} (S_n-S_0)^2.\]
3 replies
otwaenng
5 hours ago
oty
an hour ago
Circles tangent to BC at B and C
MarkBcc168   10
N an hour ago by cursed_tangent1434
Source: ELMO Shortlist 2024 G3
Let $ABC$ be a triangle, and let $\omega_1,\omega_2$ be centered at $O_1$, $O_2$ and tangent to line $BC$ at $B$, $C$ respectively. Let line $AB$ intersect $\omega_1$ again at $X$ and let line $AC$ intersect $\omega_2$ again at $Y$. If $Q$ is the other intersection of the circumcircles of triangles $ABC$ and $AXY$, then prove that lines $AQ$, $BC$, and $O_1O_2$ either concur or are all parallel.

Advaith Avadhanam
10 replies
MarkBcc168
Jun 22, 2024
cursed_tangent1434
an hour ago
inequality marathon
EthanWYX2009   194
N an hour ago by EthanWYX2009
There is an inequality marathon now, but the problem is too hard for me to solve, let's start a new one here, please post problems that is not too difficult.
------
P1.
Find the maximum value of ${M}$, such that for $\forall a,b,c\in\mathbb R_+,$
$$a^3+b^3+c^3-3abc\geqslant M(a^2b+b^2c+c^2a-3abc).$$
194 replies
1 viewing
EthanWYX2009
May 21, 2023
EthanWYX2009
an hour ago
a good exercise for inequalities
crezk   2
N an hour ago by RagvaloD
Source: own
Find the maximum value of the expression and determine the equality situation
\[
\frac{(xy - 4)(x^2 + y^2)}{xy(x + y - 2\sqrt{2})^2}
\]for all \( x > 0 \), \( y > 0 \) , .
2 replies
crezk
3 hours ago
RagvaloD
an hour ago
2025 IMO TEAMS
Oksutok   38
N an hour ago by Oksutok
Good Luck in Sunshine Coast, Australia
38 replies
Oksutok
May 14, 2025
Oksutok
an hour ago
varied geometry
FrancoGiosefAG   8
N an hour ago by vanstraelen
1. In rectangle $ABCD$, $BE/EC = 5/2$ and $DF/CF = 2$. Find the area of $\triangle AEF$ if the area of $ABCD$ is $1764$.

4. A regular octagon is constructed from a square with side length $1$ by trimming its four corners. Find the area of the octagon.

7. In rectangle $ABCD$, triangles $ABE, ECF$, and $FDA$ have areas of $4$, $3$, and $5$, respectively. What is the area of triangle $AEF$? (See figure in problem 1.)

9. In the isosceles right triangle $ABC$ with $\angle BAC = 90^\circ$, a point $D$ is taken on side $BC$ such that $BD = 2DC$. Let $E$ be the foot of the perpendicular lowered from $B$ to line $AD$. Find $\angle CED$.

10. The pentagon in the figure is formed by a square and an equilateral triangle with side lengths of $2$. Find the radius of the circle that passes through points $A,D$, and $C$.

17. A circle of radius $12$ is tangent to the four sides of a trapezoid $ABCD$ where $AB$ and $DC$ are parallel. If $BC=25$ cm and the area of $ABCD$ is $648$ cm$^2$, determine the length of $DA$.

20. In triangle $ABC$ we have $AB = AC$ and $\angle BAC = 100^\circ$. Let $D$ be a point on $AC$ such that $\angle ABD = \angle CBD$. Prove that $AD + DB = BC$.

23. In the following figure, a square with a side of $1$ is divided into $7$ right triangles. Show that $x$ satisfies the equation
\[x^5 - x^4 + 3x^3 - 2x^2 + 3x - 1 = 0.\]
8 replies
FrancoGiosefAG
Jun 12, 2025
vanstraelen
an hour ago
Boring Inequality
EthanWYX2009   1
N an hour ago by mathematical-forest
Source: 40th NSMath-4
Given positive integers $k$, $n$. Determine the maximum value of $\lambda$, such that
\[\sum_{t=1}^n\frac{\lfloor x_t\rfloor ^2}{x_t}\ge\lambda\]holds for all $x_1,$ $x_2,$ $\ldots,$ $x_n>0$ with $x_1+x_2+\cdots+x_n=kn.$

Created by Yiyan Lin
1 reply
EthanWYX2009
6 hours ago
mathematical-forest
an hour ago
Four variables inequality
TNKT   1
N an hour ago by TNKT
Source: Tran Ngoc Khuong Trang
Problem. Let $a,b,c,d\neq 0:\ a+b+c+d=0$ then prove that
$$3\left(\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}+\frac{1}{d^2}\right)\ge \frac{64}{a^2+b^2+c^2+d^2}+2\left(\frac{1}{ab}+\frac{1}{bc}+\frac{1}{cd}+\frac{1}{da}+\frac{1}{ca}+\frac{1}{bd}\right).$$When does equality hold?
1 reply
TNKT
Jun 17, 2025
TNKT
an hour ago
IMO 2017 Problem 4
Amir Hossein   119
N an hour ago by Math_456
Source: IMO 2017, Day 2, P4
Let $R$ and $S$ be different points on a circle $\Omega$ such that $RS$ is not a diameter. Let $\ell$ be the tangent line to $\Omega$ at $R$. Point $T$ is such that $S$ is the midpoint of the line segment $RT$. Point $J$ is chosen on the shorter arc $RS$ of $\Omega$ so that the circumcircle $\Gamma$ of triangle $JST$ intersects $\ell$ at two distinct points. Let $A$ be the common point of $\Gamma$ and $\ell$ that is closer to $R$. Line $AJ$ meets $\Omega$ again at $K$. Prove that the line $KT$ is tangent to $\Gamma$.

Proposed by Charles Leytem, Luxembourg
119 replies
Amir Hossein
Jul 19, 2017
Math_456
an hour ago
<BAC =? CD = 2BD, < ADC = 60^o, >ABC = 45^o
parmenides51   1
N 2 hours ago by lendsarctix280
Source: 2022 European Math Tournament - Senior First + Grand League - Math Battle 3.4
Point $D$ is marked on side $BC$ of triangle $ABC$ so that $CD = 2BD$. It turned out that $\angle  ADC = 60^o$ and $\angle ABC = 45^o$. Find $\angle BAC$.
1 reply
parmenides51
Dec 19, 2022
lendsarctix280
2 hours ago
9 AMC 8 Scores
ChromeRaptor777   232
N 2 hours ago by eyzMath
As far as I'm certain, I think all AMC8 scores are already out. Vote above.
232 replies
ChromeRaptor777
Apr 1, 2022
eyzMath
2 hours ago
LCM equation?
Flamable_Water_42   1
N Apr 20, 2023 by rhydon516
I know the Euclidean algorithm can be used to find the GCD of very large numbers. But, (unless you want to use the relationship between LCM and GCD), there isn't a simple algorithm (that I'm aware of) that will work for large LCMs.

Example

That example wasn't that bad. But some cases are even worse. Does an algorithm exist for this?
1 reply
Flamable_Water_42
Apr 20, 2023
rhydon516
Apr 20, 2023
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Flamable_Water_42
130 posts
#1
Y by
I know the Euclidean algorithm can be used to find the GCD of very large numbers. But, (unless you want to use the relationship between LCM and GCD), there isn't a simple algorithm (that I'm aware of) that will work for large LCMs.

Example

That example wasn't that bad. But some cases are even worse. Does an algorithm exist for this?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rhydon516
570 posts
#2
Y by
No, I don’t believe so. The easiest way would just be $LCM(a,b)=\frac{ab}{GCD(a,b)}$, as far as I know (which isn’t that far, to be fair).
Z K Y
N Quick Reply
G
H
=
a