[MAIN ROUND STARTS MAY 17] OMMC Year 5
by DottedCaculator, Apr 26, 2025, 5:40 PM
Hello to all creative problem solvers,
Do you want to work on a fun, untimed team math competition with amazing questions by MOPpers and IMO & EGMO medalists?
Do you want to have a chance to win thousands in cash and raffle prizes (no matter your skill level)?
Check out the fifth annual iteration of the
Online Monmouth Math Competition!
Online Monmouth Math Competition, or OMMC, is a 501c3 accredited nonprofit organization managed by adults, college students, and high schoolers which aims to give talented high school and middle school students an exciting way to develop their skills in mathematics.
Our website: https://www.ommcofficial.org/
Our Discord (6000+ members): https://tinyurl.com/joinommc
Test portal: https://ommc-test-portal.vercel.app/
This is not a local competition; any student 18 or younger anywhere in the world can attend. We have changed some elements of our contest format, so read carefully and thoroughly. Join our Discord or monitor this thread for updates and test releases.
We plan to raffle out a TON of prizes over all competitors regardless of performance. So just submit: a few minutes of your time will give you a great chance to win amazing prizes!
You can check out our past problems and sample problems here:
https://www.ommcofficial.org/sample
https://www.ommcofficial.org/2022-documents
https://www.ommcofficial.org/2023-documents
https://www.ommcofficial.org/ommc-amc
Timeline:
Main Round: May 17th - May 24th
Test Portal Released. The Main Round of the contest is held. The Main Round consists of 25 questions that each have a numerical answer. Teams will have the entire time interval to work on the questions. They can submit any time during the interval. Teams are free to edit their submissions before the period ends, even after they submit.
Final Round: May 26th - May 28th
The top placing teams will qualify for this invitational round (5-10 questions). The final round consists of 5-10 proof questions. Teams again will have the entire time interval to work on these questions and can submit their proofs any time during this interval. Teams are free to edit their submissions before the period ends, even after they submit.
Conclusion of Competition: Early June
Solutions will be released, winners announced, and prizes sent out to winners.
We hope for your participation, and good luck!
OMMC staff
OMMC’S 2025 EVENTS ARE SPONSORED BY:
Do you want to work on a fun, untimed team math competition with amazing questions by MOPpers and IMO & EGMO medalists?
Do you want to have a chance to win thousands in cash and raffle prizes (no matter your skill level)?
Check out the fifth annual iteration of the
Online Monmouth Math Competition!
Online Monmouth Math Competition, or OMMC, is a 501c3 accredited nonprofit organization managed by adults, college students, and high schoolers which aims to give talented high school and middle school students an exciting way to develop their skills in mathematics.
Our website: https://www.ommcofficial.org/
Our Discord (6000+ members): https://tinyurl.com/joinommc
Test portal: https://ommc-test-portal.vercel.app/
This is not a local competition; any student 18 or younger anywhere in the world can attend. We have changed some elements of our contest format, so read carefully and thoroughly. Join our Discord or monitor this thread for updates and test releases.
We plan to raffle out a TON of prizes over all competitors regardless of performance. So just submit: a few minutes of your time will give you a great chance to win amazing prizes!
You can check out our past problems and sample problems here:
https://www.ommcofficial.org/sample
https://www.ommcofficial.org/2022-documents
https://www.ommcofficial.org/2023-documents
https://www.ommcofficial.org/ommc-amc
Timeline:
Main Round: May 17th - May 24th
Test Portal Released. The Main Round of the contest is held. The Main Round consists of 25 questions that each have a numerical answer. Teams will have the entire time interval to work on the questions. They can submit any time during the interval. Teams are free to edit their submissions before the period ends, even after they submit.
Final Round: May 26th - May 28th
The top placing teams will qualify for this invitational round (5-10 questions). The final round consists of 5-10 proof questions. Teams again will have the entire time interval to work on these questions and can submit their proofs any time during this interval. Teams are free to edit their submissions before the period ends, even after they submit.
Conclusion of Competition: Early June
Solutions will be released, winners announced, and prizes sent out to winners.
We hope for your participation, and good luck!
OMMC staff
OMMC’S 2025 EVENTS ARE SPONSORED BY:
- Nontrivial Fellowship
- Citadel
- SPARC
- Jane Street
- And counting!
Alcumus vs books
by UnbeatableJJ, Apr 23, 2025, 12:58 PM
This post has been edited 1 time. Last edited by UnbeatableJJ, Yesterday at 2:32 AM
Stanford Math Tournament (SMT) 2025
by stanford-math-tournament, Feb 1, 2025, 3:16 AM
Stanford Math Tournament
We are excited to announce that registration is now open for Stanford Math Tournament (SMT) 2025!
This year, we will welcome 800 competitors from across the nation to participate in person on Stanford’s campus. The tournament will be held April 11-12, 2025, and registration is open to all high-school students from the United States. This year, we are extending registration to high school teams (strongly preferred), established local mathematical organizations, and individuals; please refer to our website for specific policies. Whether you’re an experienced math wizard, a puzzle hunt enthusiast, or someone looking to meet new friends, SMT has something to offer everyone!
Register here today! We’ll be accepting applications until March 2, 2025.
For those unable to travel, in middle school, or not from the United States, we encourage you to instead register for SMT 2025 Online, which will be held on April 13, 2025. Registration for SMT 2025 Online will open mid-February.
For more information visit our website! Please email us at stanford.math.tournament@gmail.com with any questions or reply to this thread below. We can’t wait to meet you all in April!
Graph Theory?!?!??!?2.?!!>2r
by pog, Oct 11, 2024, 3:00 PM
The one-way routes connecting towns 
, 
, 
, 
, 
, and 
are shown in the figure below (not drawn to scale).The distances in kilometers along each route are marked. Traveling along these routes, what is the shortest distance from A to Z in kilometers?
![[asy]
/* AMC8 P14 2024, by NUMANA: BUI VAN HIEU */
import graph;
unitsize(2cm);
real r=0.25;
// Define the nodes and their positions
pair[] nodes = { (0,0), (2,0), (1,1), (3,1), (4,0), (6,0) };
string[] labels = { "A", "M", "X", "Y", "C", "Z" };
// Draw the nodes as circles with labels
for(int i = 0; i < nodes.length; ++i) {
draw(circle(nodes[i], r));
label("$" + labels[i] + "$", nodes[i]);
}
// Define the edges with their node indices and labels
int[][] edges = { {0, 1}, {0, 2}, {2, 1}, {2, 3}, {1, 3}, {1, 4}, {3, 4}, {4, 5}, {3, 5} };
string[] edgeLabels = { "8", "5", "2", "10", "6", "14", "5", "10", "17" };
pair[] edgeLabelsPos = { S, SE, SW, S, SE, S, SW, S, NE};
// Draw the edges with labels
for (int i = 0; i < edges.length; ++i) {
pair start = nodes[edges[i][0]];
pair end = nodes[edges[i][1]];
draw(start + r*dir(end-start) -- end-r*dir(end-start), Arrow);
label("$" + edgeLabels[i] + "$", midpoint(start -- end), edgeLabelsPos[i]);
}
// Draw the curved edge with label
draw(nodes[1]+r * dir(-45)..controls (3, -0.75) and (5, -0.75)..nodes[5]+r * dir(-135), Arrow);
label("$25$", midpoint(nodes[1]..controls (3, -0.75) and (5, -0.75)..nodes[5]), 2S);
[/asy]](//latex.artofproblemsolving.com/9/3/7/937e770e18903819330e195c68a57256dec0b6f0.png)
, 
, 
, 
, 
, and 
are shown in the figure below (not drawn to scale).The distances in kilometers along each route are marked. Traveling along these routes, what is the shortest distance from A to Z in kilometers?![[asy]
/* AMC8 P14 2024, by NUMANA: BUI VAN HIEU */
import graph;
unitsize(2cm);
real r=0.25;
// Define the nodes and their positions
pair[] nodes = { (0,0), (2,0), (1,1), (3,1), (4,0), (6,0) };
string[] labels = { "A", "M", "X", "Y", "C", "Z" };
// Draw the nodes as circles with labels
for(int i = 0; i < nodes.length; ++i) {
draw(circle(nodes[i], r));
label("$" + labels[i] + "$", nodes[i]);
}
// Define the edges with their node indices and labels
int[][] edges = { {0, 1}, {0, 2}, {2, 1}, {2, 3}, {1, 3}, {1, 4}, {3, 4}, {4, 5}, {3, 5} };
string[] edgeLabels = { "8", "5", "2", "10", "6", "14", "5", "10", "17" };
pair[] edgeLabelsPos = { S, SE, SW, S, SE, S, SW, S, NE};
// Draw the edges with labels
for (int i = 0; i < edges.length; ++i) {
pair start = nodes[edges[i][0]];
pair end = nodes[edges[i][1]];
draw(start + r*dir(end-start) -- end-r*dir(end-start), Arrow);
label("$" + edgeLabels[i] + "$", midpoint(start -- end), edgeLabelsPos[i]);
}
// Draw the curved edge with label
draw(nodes[1]+r * dir(-45)..controls (3, -0.75) and (5, -0.75)..nodes[5]+r * dir(-135), Arrow);
label("$25$", midpoint(nodes[1]..controls (3, -0.75) and (5, -0.75)..nodes[5]), 2S);
[/asy]](http://latex.artofproblemsolving.com/9/3/7/937e770e18903819330e195c68a57256dec0b6f0.png)
Lots of Cyclic Quads
by Vfire, Apr 19, 2018, 11:00 PM
In convex cyclic quadrilateral 
, we know that lines 
and 
intersect at 
, lines 
and 
intersect at 
, and lines 
and 
intersect at 
. Suppose that the circumcircle of 
intersects line 
at 
and 
, and the circumcircle of 
intersects line at 
and 
, where 
and 
are collinear in that order. Prove that if lines 
and 
intersect at , then 
.
Proposed by Kada Williams
, we know that lines 
and 
intersect at 
, lines 
and 
intersect at 
, and lines 
and 
intersect at 
. Suppose that the circumcircle of 
intersects line 
at 
and 
, and the circumcircle of 
intersects line at 
and 
, where 
and 
are collinear in that order. Prove that if lines 
and 
intersect at , then 
.Proposed by Kada Williams
This post has been edited 2 times. Last edited by djmathman, Jun 22, 2020, 5:49 AM
A box contains 5 chips numbered 1, 2, 3, 4, 5
by CobbleHead, Feb 16, 2018, 6:06 PM
A box contains 
chips, numbered 
, 
, 
, 
, and . Chips are drawn randomly one at a time without replacement until the sum of the values drawn exceeds . What is the probability that draws are required?
chips, numbered 
, 
, 
, 
, and . Chips are drawn randomly one at a time without replacement until the sum of the values drawn exceeds . What is the probability that draws are required?
This post has been edited 3 times. Last edited by djmathman, Feb 17, 2018, 4:29 AM
May 2025
April 2025
December 2024
November 2024
October 2024
September 2024
August 2024
July 2024
June 2024
May 2024
April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023