Prove that, for a function , the following statements are equivalent:
a) is differentiable, with continuous first derivative.
b) For any and for any two sequences , convergent to , such that for any positive integer , the sequence is convergent.
1. Let and be positive integers. Prove that there exists a positive integer such that for every odd integer , the digits in the base- representation of are all greater than .
Rubric for Problem 1
Solution: We prove this constructively.
Lemma 1: has at most digits in its base- representation. Proof: For the base representation of to have more than digits, we must have . But this implies , which is clearly false for positive.
1 point for proving this lemma.
Fix . Let the (unique) base- representation of be . Define and to be the remainder when is divided by . Notice that and is odd for . The solution then hinges on the following construction: or an equivalent formulation. To prove this construction works, we need to show that
[list]
[*] is always an integer between and inclusive.
[*]This construction is valid.
[*]All can become arbitrarily large.
[/list]
1 point for having a construction that uses floors and remainders.
Notice that by definition, is the remainder when is divided by . Thus is always an integer. Additionally, since , each coefficient is between and .
1 point for showing that is always an integer between and inclusive in the construction chosen.
Notice that this sum equals since it telescopes.
2 points for showing the construction chosen evaluates to .
Finally, since , we have Thus, each digit is lower bounded by , which can become arbitrarily large as becomes arbitrarily large.
2 points for showing that each digit is lower bounded by a value that can become arbitrarily large.
Remark: Deduct 1 point if a value for is given but some fails.
2. Let and be positive integers with . Let be a polynomial of degree with real coefficients, nonzero constant term, and no repeated roots. Suppose that for any real numbers such that the polynomial divides , the product is zero. Prove that has a nonreal root.
Rubric for Problem 2
Solution: Suppose had no nonreal roots. We can assume has degree , as we can always find a polynomial such that has no nonreal roots. We can also assume is monic by scaling. Also, the case is trivial as the constant term must be nonzero, so fix . Let the roots of be .
1 point for reducing to .
Consider the degree polyonmials which has the roots for all integers . Let be the coefficient of the term of . Then, we have for all . Since , by Pigeonhole Principle, there exists a value of such that there exists two values of for which .
2 points for using Pigeonhole Principle in some manner on roots and degree polynomials.
Suppose WLOG that the two values of are and . Consider the polynomial with roots . Then we know that the coefficient of the term is in both and .
If is the coefficient of the term in , then expanding gives and . Since , solving this gives . Since , has two consecutive nonleading coefficients equal to .
2 points for concluding some polynomial dividing has two consecutive coefficients equal to zero. Some approaches will lead to a polynomial with three consecutive nonzero coefficients in geometric progression (possibly with ratio ). If this is the case, reward only 1 point.
Lemma 1: A polynomial with two consecutive nonleading coefficients equal to cannot have all distinct real roots. Proof: By Rolle's Theorem, the derivative has distinct real roots as well, along with two consecutive nonleading coefficients equal to zero, but one degree lower, by the Power Rule. By doing this repeatedly, we eventually end up with a polynomial where the two consecutive coefficients have degree and respectively. But this polynomial has a double root at , contradiction.
2 points for proving this lemma.
3. Alice the architect and Bob the builder play a game. First, Alice chooses two points and in the plane and a subset of the plane, which are announced to Bob. Next, Bob marks infinitely many points in the plane, designating each a city. He may not place two cities within distance at most one unit of each other, and no three cities he places may be collinear. Finally, roads are constructed between the cities as follows: for each pair of cities, they are connected with a road along the line segment if and only if the following condition holds:
[center]For every city distinct from and , there exists such[/center]
[center]that is directly similar to either or .[/center]
Alice wins the game if (i) the resulting roads allow for travel between any pair of cities via a finite sequence of roads and (ii) no two roads cross. Otherwise, Bob wins. Determine, with proof, which player has a winning strategy.
Note: is directly similar to if there exists a sequence of rotations, translations, and dilations sending to , to , and to .
Rubric for Problem 3
Solution: Alice wins by taking to be the set of points strictly outside the circle with diameter .
2 points for claiming Alice wins with the correct subset . No points should be rewarded for just claiming Alice wins.
Lemma 1: No two roads can cross. Proof: The region Alice has chosen means that is always acute. Suppose two roads and cross. Then, is a convex quadrilateral. Since is a quadrilateral, one of its angle is not acute, WLOG . Then cannot be a road, as is not acute but there does not exist an such that is not acute, contradiction.
1 point for attempting to use angles in a connectivity argument. 1 additional point for completing the argument.
Now we show by induction that any two points are connected by some path.
1 point for mentioning induction on distance between points for connectivity. No points should be rewarded for just the mention of induction.
Suppose any two points with a distance are connected by some path. This is trivially true for , as no points are a distance of apart. We show that any two points with a distance of are also connected.
Suppose and are a distance of apart. If there are no points in the circle of diameter , then there is a road between and . Otherwise, there is a city in the circle. Observe that since is obtuse, we have . Since , we must have , so then is connected to , which is connected to , done.
2 points for completing the induction argument. Deduct 1 point if the base case or is not mentioned. Do not reward points if the induction argument is incomplete or incorrect.
4. Let be the orthocenter of acute triangle , let be the foot of the altitude from to , and let be the reflection of across . Suppose that the circumcircle of triangle intersects line at two distinct points and . Prove that is the midpoint of .
Rubric for Problem 4
IMAGE
Deduct 1 point if a diagram is missing.
Solution 1: Let be the center of . Let be the intersection of and the line through parallel to . Since , lies on . Additionally, is the -antipode of .
2 points for constructing and identifying it lies on . 1 additional point for identifying it as the -antipode of .
Then, we have . Let be the foot of the altitude from to . Additionally, since and , is a midline and thus .
Then is a midline of , so and thus .
2 points for identifying . Deduct 1 point if insufficient explanation is given for the equal lengths.
Since and (by definition), by either HL congruence or the Pythagorean theorem, we must have .
2 points for drawing this conclusion. Deduct 1 point if insufficient explanation is given for going from to . Do not deduct more than 1 point total for insufficient explanations throughout the entire solution.
Other solutions (including bashes): Since there are many approaches to this problem, for incomplete solutions, reward points as follows.
[list]
[*]1 point for identifying and proving/citing lies on .
[*]1 point for using the perpendicular bisector of both and to attempt to identify .
[/list]
If the solution attempts to construct from the perpendicular bisectors, then prove that , reward points as follows.
[list]
[*]1 point for constructing the midpoint of .
[*]1 point for constructing the nine point center of and proving etiher or , or something of similar nature.
[*]1 point for showing .
[/list]
If the solution attempts to construct such that , then prove that lies on the perpendicular bisectors, reward points as follows.
[list]
[*]1 point for constructing the midpoint of .
[*]1 point for showing that lies on the perpendicular bisector of (or showing that .
[*]1 point for showing that lies on the perpendicular bisector of (or showing that .
[/list]
The rest of the solution finishes as shown in Solution 1.
5. Determine, with proof, all positive integers such that is an integer for every positive integer .
Rubric for Problem 5
Solution: The answer is all even integers . For , we have is divisible by , which is not true for odd.
1 point for stating the correct answer and showing that odd fail.
Let be a prime power dividing . Notice that by definition we have . Since , we have if and otherwise, so for each term, either both the numerator are divisible by , or neither are.
For each term such that , we have , so . This is valid since has an inverse modulo . For each term such that , we can divide out a from both the numerator and the denominator. Notice that what's left is simply . Thus, we conclude that 2 points for expressing modulo or in this form.
We will now use induction on . For , we clearly have
Now consider where , and suppose that satisfies the induction hypothesis for the prime . Clearly . Then we have By the induction hypothesis, divides the inner binomial sum, so since we are multiplying it by , must divide .
For all integers , all even work for every . Thus, all even works for all integers .
4 points for a complete induction. Deduct 1 point if the synthesis of primes is not mentioned. Deduct 1 point if the base case is missing. Deduct 2 points if both are missing. If the induction is only done for prime powers of instead of all multiples of , reward only 1 point.
Remark: If the expression of is incorrect, reward up to points total.
6. Let and be positive integers with . There are cupcakes of different flavors arranged around a circle and people who like cupcakes. Each person assigns a nonnegative real number score to each cupcake, depending on how much they like the cupcake. Suppose that for each person , it is possible to partition the circle of cupcakes into groups of consecutive cupcakes so that the sum of 's scores of the cupcakes in each group is at least . Prove that it is possible to distribute the cupcakes to the people so that each person receives cupcakes of total score at least with respect to .
Rubric for Problem 6
Solution: Call each person's partitions their bubbles. We can make the following generalization: for each person , reduce their score on each cupcake by some nonnegative real number so that each bubble's total score is exactly . This would imply the original problem.
Consider one of people, Evan. Draw a bipartite graph between the set of people except Evan and the set of Evan's bubbles , where a person is connected to a bubble if the total score of the cupcakes in that bubble with respect to is at least .
1 point for setting up this bipartite graph.
Now we will apply Hall's Marriage Lemma. Hall's Marriage Lemma states that there are two cases:
Case 1: There does not exist a subset of such that . Here, denotes the set of neighbors of . Then, it is possible to match each person in with a bubble in such that they are connected. Case 2: This is not the case.
1 additional point for mentioning Hall's Marriage Lemma. Do not reward this point if the proper bipartite graph is not set up.
Lemma 1: If a person (not Evan) is not connected with a bubble , then if a different person takes the bubble, can join together two of their bubbles and still satisfy the hypothesis. Proof: Since is not connected with , their score for that bubble is less than . Thus cannot entirely contain any of 's bubbles, so overlaps with at most two of 's bubbles. Finally, since the combined score of these two bubbles is , removing the cupcakes of takes away a score of less than , so can combine these two bubbles into one large bubble with a score of at least . If overlaps with only one bubble, arbitrarily join that bubble with a neighboring one. This is a reduction from people.
2 points for observing this reduction step.
First, notice that . We now apply the following reduction algorithm:
If case 2 applies, there is a bad subset for which the people in cannot all be satisfied. Remove the set and from the graph, noting that no person in is connected to any set not in . Reapply Hall's Marriage Theorem until either case 1 applies or the set becomes empty. Notice that throughout this process, no bubble can be connected to a removed person by definition.
When case 1 applies, we can match each person with a bubble such that all of them are satisfied. By Lemma 1, this reduction step is valid, as any person removed is not connected to any bubble not removed. Otherwise, the set of people eventually becomes empty, as more people are removed than bubbles at each removal. Then, we can match Evan with an empty bubble, which is again valid by Lemma 1. In either case, the problem is reduced to fewer people.
If case 1 immediately applies, then we are done. Otherwise, the problem is eventually reduced to one person. When , the problem is trivial, as they can just take all cupcakes.
3 points for completing the reduction argument using Hall's Marriage Lemma. Deduct 1 point if the argument is complete but the case is not mentioned. 1 point may be rewarded if the argument is incomplete or incorrect but a reduction using the two cases of Hall's Marriage Lemma is seriously attempted.
I always wanted to apply for the AMC, and this year, I think I might have a chance. A friend did AMC 8, and she came back telling me I should do it too. I was really enthusiastic, and wanted to apply.
I do not have prior experience with the AMC, and I live in Alberta, Canada. Through my research, I learned that applications must be submitted via an International Group Leader. However, I am uncertain about who they are and what steps I need to take in order to apply. If you have any information about the application, I would greatly appreciate your help.
Additionally, I would be grateful for any advice on how to best prepare for the AMC, particularly the AMC 8, as this may be one of my last opportunities to participate before moving on to the AMC 10. Specifically, I am interested in understanding the scoring system, the format of the contest, and whether it is possible to participate online from my location.
If you have any further info or tips, I would sincerely appreciate your assistance.
Hello everyone. I know this question may sound ridiculous/neagtive but I really want to know how the rest of the community thinks on this issue. Please excuse this yap session and feel free to ignore this post if it doesn't make sense, I don't think I really have a sane mind these days and something has gotten into my head.
I want your advice on what I should do in this situation. It has been my dream to make usamo since ~second semester of 9th grade and I started grinding from that time on. Last year, I qualified for the aime and got a 5. This year I really wanted to qualify for the olympiad and studied really hard. I spent my entire summer working on counting and probability, the subject I suck at the most. And yet, on amc 12, I fumbled hard. I usually mocked ~120-130s on amc 10s but on amc 12 this year, I got really mediocre scores ~100. So I had no chance of making usamo.
So during winter of 2024-2025 I kinda gave up on aime studying and I was like "hey, if I can't get into usamo, maybe ill qualify for usapho." Since I was pretty good at physics at that time. So I spended my winter hard grinding for f=ma and guess what? The test had stupid and ridiculous questions and I only got an 11. What really sucks is that even with the stupid amount of cheaters in f=ma, if I changed all of my "D" guesses to "C," then I would have qualified. Since I solved 10 actually and guessed the rest. Absolutely unfair that only 1 of my guesses were correct.
And also since I didn't study for aime, I ended up being super rusty and so I only got a 7. Solved 9 tho. (I usually can consistently solve 10+ on aimes).
And now here's my senior year and ofc I want to apply to a prestigious college. But it feels stupid that I don't have any usamo or usapho titles like the people I know do. I think I will have good essays primarily due to a varied amount of life experiences but like, I don't feel like I will contribute much to the college without being some prestigious olympiad qualifier. So this led to me having a self esteem issue.
This also led me to the question: should I study one last year so that I can get into usamo in my senior year, or is there no point? Since like, colleges don't care about whatever the hell you do in your senior year, and also, it seems just 'weird' to be grinding math contests while the rest of the people from my school are playing around, etc. So this time around I've really been having an internal crisis between my self esteem (since getting into usamo will raise my self esteem a lot) and college/senior choices.
I know this may seem like a dumb question to some and you are free to completely ignore the post. That's fine. I just really want advice for what I should do in this situation and it would really help bring my life quality up
A reputable source that is of a certain credibility has communicated me about details of Orange MOP, a new pathway to qualify for MOP. In particular, 3 rounds of a 10-problem proof-style examination, covering a variety of mathematical topics that requires proofs will be held from September 27, 2025 12:00 AM - November 8, 2025 11:59 PM EST. Each round will occur biweekly on a Saturday starting from September 27 as described above. The deadline for late submissions will be November 20, 2025 11:59 PM EST.
Solutions can be either handwritten or typed digitally with . If you are sending solutions digitally through physical scan, please make sure your handwriting is eligible. Inability to discern hand-written solutions may warrant point deductions.
As for rules, digital resources and computational intelligence systems are allowed. Textbooks, reference handouts, and calculators are also a freedom provided by the MAA.
The link is said to be posted on the MAA website during the summer, and invites aspiring math students of all grade levels to participate. As for scoring, solutions will be graded on a -point scale, and solutions will be graded in terms of both elegance and correctness.
As for qualification for further examinations, the Orange MOP examination passes both the AIME and USAJMO/USAMO requirement thresholds, and the top 5 scorers will receive the benefits and prestige of participating at the national level in the MOP program, and possibly the USA TST and the USA IMO team.
The Lexington High School Math Team is proud to announce LMT Spring 2025 and our inaugural Girls’ LMT 2025! LMT is a competition for middle school students interested in math. Students can participate individually, or on teams of 4-6 members. This announcement contains information for BOTH competitions.
LMT Spring 2025 will take place from 8:30 AM-5:00 PM on Saturday, May 3rd at Lexington High School, 251 Waltham St., Lexington, MA 02421.
The competition will include two individual rounds, a Team Round, and a Guts Round, with a break for lunch and mini-events. A detailed schedule is available at https://lhsmath.org/LMT/Schedule.
There is a $15 fee per participant, paid on the day of the competition. Pizza will be provided for lunch, at no additional cost.
Girls’ LMT 2025 will be held ONLINE on MathDash from 11:00 AM-4:15 PM EST on Saturday, April 19th, 2025. Participation is open to middle school students who identify as female or non-binary. The competition will include an individual round and a team round with a break for lunch and mini-events. It is free to participate.
MAA has just emailed a press release announcing the formula they will be using this year to come up with the MOP cutoff that applies to you! Here's the process:
1. Multiply your age by , let be the result.
2. Calculate , where is the Euler's totient theorem, which calculates the number of integers less than relatively prime to .
3. Multiply your result by again because why not, let the result be .
4. Define the Fibonacci sequence for . Let be the remainder leaves when you divide it by .
5. Let be your predicted USA(J)MO score.
6. You will be invited if your score is at least .
7. Note that there may be additional age restrictions for non-high schoolers.
Edit (4/2/2025): This was an April Fool's post. Here's the punchline
Everyone missed MOP by one point! In fact, unless of your age can be written as . See post #26 for the proof. (I promise the link is not a rickroll this time)
2025 Math and AI 4 Girls Competition: Win Up To $1,000!!!
audio-on19
NYesterday at 3:43 PM
by WhitePhoenix
Join the 2025 Math and AI 4 Girls Competition for a chance to win up to $1,000!
Hey Everyone, I'm pleased to announce the dates for the 2025 MA4G Competition are set!
Applications will open on March 22nd, 2025, and they will close on April 26th, 2025 (@ 11:59pm PST).
Applicants will have one month to fill out an application with prizes for the top 50 contestants & cash prizes for the top 20 contestants (including $1,000 for the winner!). More details below!
Eligibility:
The competition is free to enter, and open to middle school female students living in the US (5th-8th grade).
Award recipients are selected based on their aptitude, activities and aspirations in STEM.
Event dates:
Applications will open on March 22nd, 2025, and they will close on April 26th, 2025 (by 11:59pm PST)
Winners will be announced on June 28, 2025 during an online award ceremony.
Application requirements:
Complete a 12 question problem set on math and computer science/AI related topics
Write 2 short essays
Prizes:
1st place: $1,000 Cash prize
2nd place: $500 Cash prize
3rd place: $300 Cash prize
4th-10th: $100 Cash prize each
11th-20th: $50 Cash prize each
Top 50 contestants: Over $50 worth of gadgets and stationary
Many thanks to our current and past sponsors and partners: Hudson River Trading, MATHCOUNTS, Hewlett Packard Enterprise, Automation Anywhere, JP Morgan Chase, D.E. Shaw, and AI4ALL.
Math and AI 4 Girls is a nonprofit organization aiming to encourage young girls to develop an interest in math and AI by taking part in STEM competitions and activities at an early age. The organization will be hosting an inaugural Math and AI 4 Girls competition to identify talent and encourage long-term planning of academic and career goals in STEM.
[center]IMAGE[/center]
[br]
[center]INTEGIRLS Bay Area Spring Competition![/center]
Hi everyone! INTEGIRLS Bay Area is excited to invite you to participate in our eighth biannual, free, virtual math competition. The event is open to all girls or non-binary individuals comfortable with being grouped with girls in middle or high school and will take place on Sunday, April 20th from 9 AM - 1:00 PM (PST).
If you're excited to dive into a day of math, make new friends, and win fun prizes, then we encourage you to sign up here!
**Note that the Bay Area chapter of INTEGIRLS writes their own problems, so you can participate in another INTEGIRLS chapter's Spring Competition as well :thumbup:
------
[center]Competition Information[/center]
WHO All middle school and high school students who identify as female or non-binary are invited to join our competition! You can sign up with teams of up to 4 people, or choose to be paired with other students at random.
WHAT Our competition will feature individual, team and tiebreaker rounds with problems written by our amazingly talented team, fun games and a social room to meet new people! There will be separate rounds for middle and high school students as well as exciting prizes for our participants.
WHEN The competition will take place on Sunday, April 20th from 9 AM to 1:00 PM (PST).
WHERE We will host the competition over Zoom, so students from all over the world may attend!
WHY Explore exciting math problems, make friends, and most of all, have fun! Through our competition, we hope to inspire a passion for math in more students, and by bringing together girls who love math together, we aim to create a community of future female mathematicians. Math is an amazing subject full of hidden puzzles and strategies, and together, we seek to create an event full of joy where girls bond over the beauty of the subject.
For any finite set , let denote the number of elements in . FInd the number of ordered pairs such that and are (not necessarily distinct) subsets of that satisfy
As is continuous, is continuous as well, and by (*) we get that either is constant (which easily gives , false) or there exist such that . Notice that any number in is a period of (again, by (*)). We will now prove that is constant.
For doing so, we will show that such that This could be rewritten as (dividing by, say, ; if we divide by , and if as well then and this is of no interest) Let be arbitrary.
It suffices to find a such that
But this can be rewritten as , which is obviously true as is dense in .
Let be arbitrary with . By the above, there exist such that
Thus , and so is constant.
This post has been edited 4 times. Last edited by RobertRogo, Mar 30, 2025, 1:02 PM