Hi, I am practicing for the 2025-2026 AMC 8 comp and want to try some of the problems from past comps can I find them on the AoPS website? If not, where?

Let be a convex quadrilateral inscribed in a circle and satisfying . Points and are chosen on sides and such that and . Prove that .

Milan Haiman

Find all triples of positive integers that satisfy the equation

Join the CountHerInPDX Fall Math Competition, a free and fun online event just for girls in grades 3–8! Whether you're new to math contests or already love problem-solving, this competition is all about building confidence, making friends, and showing what girls can do in STEM. Sign up now to challenge yourself, win prizes, and be part of a community where girls lead in math!

https://sites.google.com/bsd48.org/countherinpdx/competition

27th ELMO on AoPS: Error Littered Math Olympiad / Elmo Likes Swapping Math Olympiads
Saturday, June 14th and Saturday, June 21st, 2025

The ELMO is an olympiad test similar to both the USAMO and IMO in format. It is written, administered, and graded by returning MOPers for those attending MOP for the first time. However, because there are only finitely many people who can attend MOP each year, for many years the competition has also been posted and run on AoPS, similarly to many of the other mocks that run on this site. Here are links to the previous AoPS ELMO threads.

You can also find the problems and shortlist in the USA contests section of the Contest Collections. The acronym is different every year and was chosen during the first week of MOP.

[list][*]You should sign up in this thread if you intend to do the contest. Signups are neither mandatory nor binding, but we want to have an estimate of how many people take the test.
[*]You may participate in either or both of the two days. Each day will consist of three problems of a similar difficulty to the USAMO. The top scores from each day and overall will be recognized, and all scores will be posted on the ELMO website, where you can also find past results.
[*]The Day 1 and Day 2 problems will be released in the afternoon on Saturday, June 14th and Saturday, June 21st, 2025, respectively.
[*]Submissions will be due on Thursday, June 26th at 11:59 PM EDT. You may submit for both days at once or separately.
[*]We want to encourage early submissions. Early submissions will receive priority in grading.
[*]Each day should be taken in a contiguous 4.5-hour period, similarly to how you would take the USAMO, although you do not need a proctor and you may take the test anytime before the submission deadline.
[*]Submit your day 1 solutions to here and your day 2 solutions to here. Please submit a separate PDF for each problem and include your username (or real name, if you want that to appear instead) and problem number in the filename. You may either scan written solutions using a scanner or phone app (e.g. Dropbox, CamScanner, Genius Scan, iOS Notes app, Adobe Scan), or write your solutions in LaTeX (compiled to PDF). You may write your solutions on paper and then transcribe them to LaTeX immediately afterwards, provided that you do so entirely verbatim. Please only do so if you have hideous handwriting that only you can decipher or do not have anything resembling a scanner available.
[*]After the tests are over, the problems will be posted in the High School Olympiads forum. Please do not discuss the problems with anyone until this happens.
[*]More information will be provided later!
[/list]
We look forward to your participation!

i mean.. whattttt??? just found out about this.. is he on aops? (i'm sure he is) where are you orz lol..
https://www.mathschool.com/blog/results/celebrating-success-douglas-zhang-is-rsm-s-youngest-usajmo-qualifier

I am wondering when it is a good time to start prepping for AMC's, given that I am studying much more for olympiads this year rather than focusing on computational that much, and when I should stop doing a ton of proof questions/OTIS and start locking in on AMC's.

Let be an integer. Find all positive real solutions to the following system of equations:

Lubbock Online Math Camp (LOMC)
AMC 8 & MATHCOUNTS Training for Middle Schoolers

Are you a middle school student who loves math? Do you want to improve your problem-solving skills and excel in future math competitions? Join this FREE online math camp this summer, designed to help prepare for MATHCOUNTS, AMC 8, and other middle school math contests.

When:
Every Sunday & Thursday, 6-7pm Central Time
Starting July 6th 2025, continuing through the rest of the year!

The Class:
Interactive Zoom classes to review problems and learn key math concepts.
Weekly homework, consisting of problem sets curated by me, as well as past contests.
Access to a Google Classroom for assignments and other resources.
Join a Discord community to talk with peers and make friends.
The syllabus will be given to students. The concepts covered will include prime factorization, triangles, Shoelace Theorem, Simon’s Favorite Factoring Trick, and more.
All sessions are recorded.

The instructors:
The class will be taught by Lishan Prado, Seonho Choi, and Eric Chen. We're students at Lubbock High School, and we love math! We've been participating in math contests for years, performing well in MATHCOUNTS, AMCs, and AIME. We're experienced competition math teachers, teaching at our local middle school's MATHCOUNTS program. If you have any questions, feel free to reach out.

Interest Form: https://forms.gle/BoKCysSgw7Rj7M5XA
Sign up before room runs out! We may limit the size of the class in order to preserve the quality of the camp.

Contact Me:
Email: lishan.prado@gmail.com
Discord: bluewater16

The Planar National Park is a subset of the Euclidean plane consisting of several trails which meet at junctions. Every trail has its two endpoints at two different junctions whereas each junction is the endpoint of exactly three trails. Trails only intersect at junctions (in particular, trails only meet at endpoints). Finally, no trails begin and end at the same two junctions. (An example of one possible layout of the park is shown to the left below, in which there are six junctions and nine trails.)
[center]
IMAGE
[/center]
A visitor walks through the park as follows: she begins at a junction and starts walking along a trail. At the end of that first trail, she enters a junction and turns left. On the next junction she turns right, and so on, alternating left and right turns at each junction. She does this until she gets back to the junction where she started. What is the largest possible number of times she could have entered any junction during her walk, over all possible layouts of the park?