Summer is a great time to explore cool problems to keep your skills sharp!  Schedule a class today!

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
Sipnayan JHS 2021 F-9
PikaVee   1
N 5 minutes ago by PikaVee
Matt and Sai are playing a game of darts together. Matt has a slightly more accurate aim than Sai. In
fact, Matt can hit the bullseye 80% of the time while Sai can only hit it 60% of the time. They take turns
in playing and the first player is determined by a flip of a fair coin. If the probability that Sai scores the
first bullseye is given by $ \frac {a}{b} $ where a and b are relatively prime integers, what is b − a?
1 reply
PikaVee
24 minutes ago
PikaVee
5 minutes ago
Standart looking FE
Kimchiks926   13
N 16 minutes ago by math-olympiad-clown
Source: Baltic Way 2022, Problem 5
Let $\mathbb{R}$ be the set of real numbers. Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $f(0)+1=f(1)$ and for any real numbers $x$ and $y$,
$$ f(xy-x)+f(x+f(y))=yf(x)+3 $$
13 replies
Kimchiks926
Nov 12, 2022
math-olympiad-clown
16 minutes ago
A sharp one with 3 var (2)
mihaig   4
N 16 minutes ago by mihaig
Source: Own
Let $a,b,c\geq0$ satisfying
$$\left(a+b+c-2\right)^2+8\leq3\left(ab+bc+ca\right).$$Prove
$$a+b+c+\sqrt{abc}\geq4.$$
4 replies
mihaig
May 26, 2025
mihaig
16 minutes ago
3 var inequality
SunnyEvan   11
N 17 minutes ago by mihaig
Let $ a,b,c \in R $ ,such that $ a^2+b^2+c^2=4(ab+bc+ca)$Prove that :$$ \frac{7-2\sqrt{14}}{48} \leq \frac{a^3b+b^3c+c^3a}{(a^2+b^2+c^2)^2} \leq \frac{7+2\sqrt{14}}{48} $$
11 replies
SunnyEvan
May 17, 2025
mihaig
17 minutes ago
trigonometric inequality
MATH1945   12
N 18 minutes ago by mihaig
Source: ?
In triangle $ABC$, prove that $$sin^2(A)+sin^2(B)+sin^2(C) \leq \frac{9}{4}$$
12 replies
MATH1945
May 26, 2016
mihaig
18 minutes ago
Prefix sums of divisors are perfect squares
CyclicISLscelesTrapezoid   38
N 18 minutes ago by maromex
Source: ISL 2021 N3
Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.
38 replies
1 viewing
CyclicISLscelesTrapezoid
Jul 12, 2022
maromex
18 minutes ago
Low unsociable sets implies low chromatic number
62861   21
N 27 minutes ago by awesomeming327.
Source: IMO 2015 Shortlist, C7
In a company of people some pairs are enemies. A group of people is called unsociable if the number of members in the group is odd and at least $3$, and it is possible to arrange all its members around a round table so that every two neighbors are enemies. Given that there are at most $2015$ unsociable groups, prove that it is possible to partition the company into $11$ parts so that no two enemies are in the same part.

Proposed by Russia
21 replies
62861
Jul 7, 2016
awesomeming327.
27 minutes ago
Sipnayan 2025 JHS F E-Spaghetti
PikaVee   2
N 33 minutes ago by PikaVee
There are two bins A and B which contain 12 balls and 24 balls, respectively. Each of these balls is marked with one letter: X, Y, or Z. In each bin, each ball is equally likely to be chosen. Randomly picking from bin A, the probability of choosing balls marked X and Y are $ \frac{1}{3} $ and $ \frac{1}{4} $, respectively. Randomly picking from bin B, the probability of choosing balls marked X and Y are $ \frac{1}{4} $ and $ \frac{1}{3} $, respectively. If the contents of the two bins are merged into one bin, what is the probability of choosing two balls marked X and Y from this bin?
2 replies
PikaVee
43 minutes ago
PikaVee
33 minutes ago
100 Selected Problems Handout
Asjmaj   35
N 44 minutes ago by CBMaster
Happy New Year to all AoPSers!
 :clap2:

Here’s my modest gift to you all. Although I haven’t been very active in the forums, the AoPS community contributed to an immense part of my preparation and left a huge impact on me as a person. Consider this my way of giving back. I also want to take this opportunity to thank Evan Chen—his work has consistently inspired me throughout my olympiad journey, and this handout is no exception.



With 2025 drawing near, my High School Olympiad career will soon be over, so I want to share a compilation of the problems that I liked the most over the years and their respective detailed write-ups. Originally, I intended it just as a personal record, but I decided to give it some “textbook value” by not repeating the topics so that the selection would span many different approaches, adding hints, and including my motivations and thought process.

While IMHO it turned out to be quite instructive, I cannot call it a textbook by any means. I recommend solving it if you are confident enough and want to test your skills on miscellaneous, unordered, challenging, high-quality problems. Hints will allow you to not be stuck for too long, and the fully motivated solutions (often with multiple approaches) should help broaden your perspective. 



This is my first experience of writing anything in this format, and I’m not a writer by any means, so please forgive any mistakes or nonsense that may be written here. If you spot any typos, inconsistencies, or flawed arguments whatsoever (no one is immune :blush: ), feel free to DM me. In fact, I welcome any feedback or suggestions.

I left some authors/sources blank simply because I don’t know them, so if you happen to recognize where and by whom a problem originated, please let me know. And quoting the legend: “The ideas of the solution are a mix of my own work, the solutions provided by the competition organizers, and solutions found by the community. However, all the writing is maintained by me.” 



I’ll likely keep a separate file to track all the typos, and when there’s enough, I will update the main file. Some problems need polishing (at least aesthetically), and I also have more remarks to add.

This content is only for educational purposes and is not meant for commercial usage.



This is it! Good luck in 45^2, and I hope you enjoy working through these problems as much as I did!

Here's a link to Google Drive because of AoPS file size constraints: Selected Problems
35 replies
Asjmaj
Dec 31, 2024
CBMaster
44 minutes ago
Inspired by SunnyEvan
sqing   3
N an hour ago by sqing
Source: Own
Let $ a,b,c   $ be reals such that $ a^2+b^2+c^2=2(ab+bc+ca). $ Prove that$$ \frac{1}{12} \leq \frac{a^2b+b^2c+c^2a}{(a+b+c)^3} \leq \frac{5}{36} $$Let $ a,b,c   $ be reals such that $ a^2+b^2+c^2=5(ab+bc+ca). $ Prove that$$ -\frac{1}{25} \leq \frac{a^3b+b^3c+c^3a}{(a^2+b^2+c^2)^2} \leq \frac{197}{675} $$
3 replies
sqing
May 17, 2025
sqing
an hour ago
Centrally symmetric polyhedron
genius_007   0
an hour ago
Source: unknown
Does there exist a convex polyhedron with an odd number of sides, where each side is centrally symmetric?
0 replies
genius_007
an hour ago
0 replies
2-var inequality
sqing   4
N an hour ago by sqing
Source: Own
Let $ a,b> 0 $ and $2a+2b+ab=5. $ Prove that
$$ \frac{a^2}{b^2}+\frac{1}{a^2}-a^2\geq  1$$$$ \frac{a^3}{b^3}+\frac{1}{a^3}-a^3\geq  1$$
4 replies
sqing
3 hours ago
sqing
an hour ago
Combinatorial Game
Cats_on_a_computer   1
N an hour ago by Cats_on_a_computer

Let n>1 be odd. A row of n spaces is initially empty. Alice and Bob alternate moves (Alice first); on each turn a player may either
1. Place a stone in any empty space, or
2. Remove a stone from a non-empty space S, then (if they exist) place stones in the nearest empty spaces immediately to the left and to the right of S.

Furthermore, no move may produce a position that has appeared earlier. The player loses when they cannot make a legal move.
Assuming optimal play, which move(s) can Alice make on her first turn?
1 reply
Cats_on_a_computer
2 hours ago
Cats_on_a_computer
an hour ago
A game of digits and seventh powers
v_Enhance   28
N an hour ago by blueprimes
Source: Taiwan 2014 TST3 Quiz 1, P2
Alice and Bob play the following game. They alternate selecting distinct nonzero digits (from $1$ to $9$) until they have chosen seven such digits, and then consider the resulting seven-digit number by concatenating the digits in the order selected, with the seventh digit appearing last (i.e. $\overline{A_1B_2A_3B_4A_6B_6A_7}$). Alice wins if and only if the resulting number is the last seven decimal digits of some perfect seventh power. Please determine which player has the winning strategy.
28 replies
v_Enhance
Jul 18, 2014
blueprimes
an hour ago
equal angles wanted, circle of diameter AB and touchpoints with incircle
parmenides51   2
N May 21, 2020 by Greenleaf5002
Source: 2013 Swiss IMO TST p11
Let $ABC$ be a triangle with $\angle ACB \ge 90^o$ and $k$ the circle with diameter $AB$ and center $O$. The incircle of $ABC$ touches $AC ,BC$ at $M,N$ respectively. $MN$ intersects $k$ at points $X$ and $Y$. Show that $\angle XOY = \angle ACB$.
2 replies
parmenides51
May 21, 2020
Greenleaf5002
May 21, 2020
equal angles wanted, circle of diameter AB and touchpoints with incircle
G H J
G H BBookmark kLocked kLocked NReply
Source: 2013 Swiss IMO TST p11
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
parmenides51
30653 posts
#1
Y by
Let $ABC$ be a triangle with $\angle ACB \ge 90^o$ and $k$ the circle with diameter $AB$ and center $O$. The incircle of $ABC$ touches $AC ,BC$ at $M,N$ respectively. $MN$ intersects $k$ at points $X$ and $Y$. Show that $\angle XOY = \angle ACB$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Jupiter_is_BIG
867 posts
#2 • 2 Y
Y by Mango247, Mango247
By Iran's lemma, we know that $X= k\cap CI, Y=k\cap BI$. Angle chasing gives $\angle XOA=\angle B\implies XO\| CB$ and similarly, $YO\| CA$. Thus, $\angle XOY=\angle ACB$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Greenleaf5002
130 posts
#3 • 2 Y
Y by Mango247, Mango247
Let $AI$ and $BI$ meet $(k)$ at $X'$ and $Y'$. Since $\angle AY'B=\angle IY'B=\angle INB=\angle ILB=90^{\circ}$ it follows that $LINY'B$ is cyclic. Similarly $LIMX'A$ is cyclic.

It is easy to see that $OY'\parallel AC$ and $OX'\parallel BC$, which implies $\angle X'OY'=\angle ACB$

Now, since $\triangle CMN$ is isosceles, $\angle CMN=\angle CNM=\frac{\angle A+\angle B}{2}=\angle Y'IB=\angle Y'NB$

$\therefore Y'$ lies on $MN$ and similarly, $X'$ lies on $MN$, which means $X'=X$ and $Y'=Y$ and hence $\angle XOY=\angle ACB$.$\blacksquare$

edit:
[asy]/* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(10cm); 
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ 
pen dotstyle = black; /* point style */ 
real xmin = -43.15209681576247, xmax = 54.387731827208164, ymin = -30.63145587456325, ymax = 26.29217849754632;  /* image dimensions */

 /* draw figures */
draw((-16.399546836968362,-3.0902903232899717)--(17.112073051837914,-3.5985184548119133), linewidth(0.8)); 
draw((17.112073051837914,-3.5985184548119133)--(-5.993968803952525,8.661830284995483), linewidth(0.8)); 
draw((-5.993968803952525,8.661830284995483)--(-16.399546836968362,-3.0902903232899717), linewidth(0.8)); 
draw(circle((0.35626310743477596,-3.3444043890509425), 16.757736746093627), linewidth(0.8)); 
draw((0.35626310743477596,-3.3444043890509425)--(-14.446667236290406,4.510211711701336), linewidth(0.8)); 
draw((0.35626310743477596,-3.3444043890509425)--(11.465173190629429,9.202063544788956), linewidth(0.8)); 
draw(circle((6.1594806309877965,-0.784349836114522), 11.308352035187296), linewidth(0.8)); 
draw(circle((-10.596329313415342,-0.5302357703535528), 6.342807969636423), linewidth(0.8)); 
draw((-14.446667236290406,4.510211711701336)--(11.465173190629429,9.202063544788956), linewidth(0.8) + dotted); 
draw((11.465173190629429,9.202063544788956)--(17.112073051837914,-3.5985184548119133), linewidth(0.8)); 
draw((-14.446667236290406,4.510211711701336)--(-16.399546836968362,-3.0902903232899717), linewidth(0.8)); 
draw((-4.793111789862323,2.029818782582867)--(-4.873412977852543,-3.2650925409782583), linewidth(0.8)); 
draw((-2.311017765634581,6.707611366704294)--(-4.793111789862323,2.029818782582867), linewidth(0.8)); 
draw((-4.793111789862323,2.029818782582867)--(-8.757852101074524,5.5402843456980255), linewidth(0.8)); 
draw((11.465173190629429,9.202063544788956)--(-4.793111789862323,2.029818782582867), linewidth(0.8)); 
draw((-4.793111789862323,2.029818782582867)--(-14.446667236290406,4.510211711701336), linewidth(0.8)); 
draw(circle((-5.393540296907422,5.345824533789173), 3.3699270814226407), linewidth(0.8)); 
draw((-4.793111789862323,2.029818782582867)--(-16.399546836968362,-3.0902903232899717), linewidth(0.8)); 
draw((-4.793111789862323,2.029818782582867)--(17.112073051837914,-3.5985184548119133), linewidth(0.8)); 
draw((11.465173190629429,9.202063544788956)--(-5.993968803952525,8.661830284995483), linewidth(0.8)); 
draw(circle((-4.793111789862322,2.029818782582867), 5.295520201563625), linewidth(0.8)); 
 /* dots and labels */
dot((-16.399546836968362,-3.0902903232899717),dotstyle); 
label("$A$", (-16.80003496556358,-2.360146166326775), SW * labelscalefactor); 
dot((17.112073051837914,-3.5985184548119133),dotstyle); 
label("$B$", (17.429281130457575,-2.8173641130907074), NE * labelscalefactor); 
dot((-5.993968803952525,8.661830284995483),dotstyle); 
label("$C$", (-5.66022518112063,9.451317458408143), NE * labelscalefactor); 
dot((0.35626310743477596,-3.3444043890509425),linewidth(4pt) + dotstyle); 
label("$O$", (1.121841029210921,-3.960408980000538), S * labelscalefactor); 
dot((-4.793111789862323,2.029818782582867),linewidth(4pt) + dotstyle); 
label("$I$", (-4.517180314210818,2.6692512480764803), NW * labelscalefactor); 
dot((-8.757852101074524,5.5402843456980255),linewidth(4pt) + dotstyle); 
label("$M$", (-8.4797358528315,6.174588839933295), NW * labelscalefactor); 
dot((-2.311017765634581,6.707611366704294),linewidth(4pt) + dotstyle); 
label("$N$", (-2.0024816070092317,7.317633706843126), N * labelscalefactor); 
dot((-14.446667236290406,4.510211711701336),linewidth(4pt) + dotstyle); 
label("$X'$", (-14.11875719625324,5.107746964150786), NW * labelscalefactor); 
dot((11.465173190629429,9.202063544788956),linewidth(4pt) + dotstyle); 
label("$Y'$", (11.790259787035835,9.832332414044753), NE * labelscalefactor); 
dot((-4.873412977852543,-3.2650925409782583),linewidth(4pt) + dotstyle); 
label("$L$", (-4.593383305338139,-2.6649581308360633), NE * labelscalefactor); 
dot((5.559052123942695,2.5316559150917852),linewidth(4pt) + dotstyle); 
label("$D$", (5.846426479104811,3.126469194840413), N * labelscalefactor); 
dot((-11.196757820460444,2.7857699808527556),linewidth(4pt) + dotstyle); 
label("$E$", (-10.918231568905766,2.531281159349701), S * labelscalefactor); 
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); 
 /* end of picture */[/asy]
This post has been edited 5 times. Last edited by Greenleaf5002, May 21, 2020, 11:46 AM
Reason: diagram
Z K Y
N Quick Reply
G
H
=
a