We have your learning goals covered with Spring and Summer courses available. Enroll today!

G
Topic
First Poster
Last Poster
k a My Retirement & New Leadership at AoPS
rrusczyk   1573
N 25 minutes ago by SmartGroot
I write today to announce my retirement as CEO from Art of Problem Solving. When I founded AoPS 22 years ago, I never imagined that we would reach so many students and families, or that we would find so many channels through which we discover, inspire, and train the great problem solvers of the next generation. I am very proud of all we have accomplished and I’m thankful for the many supporters who provided inspiration and encouragement along the way. I'm particularly grateful to all of the wonderful members of the AoPS Community!

I’m delighted to introduce our new leaders - Ben Kornell and Andrew Sutherland. Ben has extensive experience in education and edtech prior to joining AoPS as my successor as CEO, including starting like I did as a classroom teacher. He has a deep understanding of the value of our work because he’s an AoPS parent! Meanwhile, Andrew and I have common roots as founders of education companies; he launched Quizlet at age 15! His journey from founder to MIT to technology and product leader as our Chief Product Officer traces a pathway many of our students will follow in the years to come.

Thank you again for your support for Art of Problem Solving and we look forward to working with millions more wonderful problem solvers in the years to come.

And special thanks to all of the amazing AoPS team members who have helped build AoPS. We’ve come a long way from here:IMAGE
1573 replies
+10 w
rrusczyk
Mar 24, 2025
SmartGroot
25 minutes ago
k a March Highlights and 2025 AoPS Online Class Information
jlacosta   0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.

Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!

Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.

Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/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, Mar 2 - Jun 22
Friday, Mar 28 - Jul 18
Sunday, Apr 13 - Aug 10
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
Tuesday, Mar 25 - Jul 8
Sunday, Apr 13 - Aug 10
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, Mar 23 - Jul 20
Monday, Apr 7 - Jul 28
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
Sunday, Mar 16 - Jun 8
Wednesday, Apr 16 - Jul 2
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
Monday, Mar 17 - Jun 9
Thursday, Apr 17 - Jul 3
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
Sunday, Mar 2 - Jun 22
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Tuesday, Mar 4 - Aug 12
Sunday, Mar 23 - Sep 21
Wednesday, Apr 23 - Oct 1
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

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Mar 16 - Sep 14
Tuesday, Mar 25 - Sep 2
Monday, Apr 21 - Oct 13
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
Sunday, Mar 23 - Aug 3
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Sunday, Mar 16 - Aug 24
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Wednesday, Mar 5 - May 21
Tuesday, Jun 10 - Aug 26

Calculus
Sunday, Mar 30 - Oct 5
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
Sunday, Mar 23 - Jun 15
Wednesday, Apr 16 - Jul 2
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
Friday, Apr 11 - Jun 27
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
Tuesday, Mar 4 - May 20
Monday, Mar 31 - Jun 23
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

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
Monday, Mar 24 - Jun 16
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
Sunday, Mar 30 - Jun 22
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Tuesday, Mar 25 - Sep 2
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Mar 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
Base 2n of n^k
KevinYang2.71   48
N 4 minutes ago by BS2012
Source: USAMO 2025/1, USAJMO 2025/2
Let $k$ and $d$ be positive integers. Prove that there exists a positive integer $N$ such that for every odd integer $n>N$, the digits in the base-$2n$ representation of $n^k$ are all greater than $d$.
48 replies
+1 w
KevinYang2.71
Mar 20, 2025
BS2012
4 minutes ago
Pascal, Cayley and Fermat 2025
melpomene7   39
N 9 minutes ago by Cerberusman
Anyone else do a CEMC contest? I did fermat but totally fumbled and got a 108.
39 replies
melpomene7
Feb 28, 2025
Cerberusman
9 minutes ago
Mathcounts state
happymoose666   6
N 10 minutes ago by Math-lover1
Hi everyone,
I just have a question. I live in PA and I sadly didn't make it to nationals this year. Is PA a competitive state? I'm new into mathcounts and not sure
6 replies
happymoose666
Mar 24, 2025
Math-lover1
10 minutes ago
Practice AMC 10A
freddyfazbear   28
N 18 minutes ago by freddyfazbear
Hey everyone!

I’m back with another practice test. Sorry this one took a while to pump out since I have been busy lately.

Post your score/distribution, favorite problems, and thoughts on the difficulty of the test down below. Hope you enjoy!


Practice AMC 10A

1. Find the sum of the infinite geometric series 1/2 + 7/36 + 49/648 + …
A - 18/11, B - 9/22, C - 9/11, D - 18/7, E - 9/14

2. What is the first digit after the decimal point in the square root of 420?
A - 1, B - 2, C - 3, D - 4, E - 5

3. Caden’s calculator is broken and two of the digits are swapped for some reason. When he entered in 9 + 10, he got 21. What is the sum of the two digits that got swapped?
A - 2, B - 3, C - 4, D - 5, E - 6

4. Two circles with radiuses 47 and 96 intersect at two points A and B. Let P be the point 82% of the way from A to B. A line is drawn through P that intersects both circles twice. Let the four intersection points, from left to right be W, X, Y, and Z. Find (PW/PX)*(PY/PZ).
A - 50/5863, B - 47/96, C - 1, D - 96/47, E - 5863/50

5. Two dice are rolled, and the two numbers shown are a and b. How many possible values of ab are there?
A - 17, B - 18, C - 19, D - 20, E - 21

6. What is the largest positive integer that cannot be expressed in the form 6a + 9b + 4c + 20d, where a, b, c, and d are positive integers?
A - 29, B - 38, C - 43, D - 76, E - 82

7. What is the absolute difference of the probabilities of getting at least 6/10 on a 10-question true or false test and at least 3/5 on a 5-question true or false test?
A - 0, B - 1/504, C - 1/252, D - 1/126, E - 1/63

8. How many arrangements of the letters in the word “ginger” are there such that the two vowels have an even number of letters (remember 0 is even) between them (including the original “ginger”)?
A - 72, B - 108, C - 144, D - 216, E - 432

9. After opening his final exam, Jason does not know how to solve a single question. So he decides to pull out his phone and search up the answers. Doing this, Jason has a success rate of anywhere from 94-100% for any given question he uses his phone on. However, if the teacher sees his phone at any point during the test, then Jason gets a 0.5 multiplier on his final test score, as well as he must finish the rest of the test questions without his phone. (Assume Jason uses his phone on every question he does until he finishes the test or gets caught.) Every question is a 5-choice multiple choice question. Jason has a 90% chance of not being caught with his phone. What is the expected value of Jason’s test score, rounded to the nearest tenth of a percent?
A - 89.9%, B - 90.0%, C - 90.1%, D - 90.2%, E - 90.3%

10. A criminal is caught by a police officer. Due to a lack of cooperation, the officer calls in a second officer so they can start the arrest smoothly. Officer 1 takes 26:18 to arrest a criminal, and officer 2 takes 13:09 to arrest a criminal. With these two police officers working together, how long should the arrest take?
A - 4:23, B - 5:26, C - 8:46, D - 17:32, E - 19:44

11. Suppose that on the coordinate grid, the x-axis represents economic freedom, and the y-axis represents social freedom, where -1 <= x, y <= 1 and a higher number for either coordinate represents more freedom along that particular axis. Accordingly, the points (0, 0), (1, 1), (-1, 1), (-1, -1), and (1, -1) represent democracy, anarchy, socialism, communism, and fascism, respectively. A country is classified as whichever point it is closest to. Suppose a theoretical new country is selected by picking a random point within the square bounded by anarchy, socialism, communism, and fascism as its vertices. What is the probability that it is fascist?
A - 1 - (1/4)pi, B - 1/5, C - (1/16)pi, D - 1/4, E - 1/8

12. Statistics show that people in Memphis who eat at KFC n days a week have a (1/10)(n+2) chance of liking kool-aid, and the number of people who eat at KFC n days a week is directly proportional to 8 - n (Note that n can only be an integer from 0 to 7, inclusive). A random person in Memphis is selected. Find the probability that they like kool-aid.
A - 13/30, B - 17/30, C - 19/30, D - 23/30, E - 29/30

13. A southern plantation has a length of 60 meters and a width of 50 meters. On the plantation, there is 1 kg of cotton per square meter waiting to be picked. The master of the plantation initially calls over 25 cotton pickers, each picking cotton at a rate of 5 kg per hour starting at 9 AM. However, he wants all of the cotton to be picked by 9 PM, and realizes that he needs to speed up the process. At 12 PM, the master then encourages his pickers to work faster by whipping them, in which they then all speed up to 6 kg per hour. At 1 PM, the master calls in 15 more pickers which pick at 5 kg per hour. Unfortunately, at 3 PM, the clouds drift away and the hot sun starts beating down, which slows every picker down by 2 kg per hour. At 4 PM, the clouds return, and all pickers return to picking at 5 kg per hour. At 5 PM, the master calls in 30 more pickers, which again pick at 5 kg per hour. At 6 PM, he calls in 30 more pickers. At 7 PM, he whips all the pickers again, speeding them up to 6 kg per hour. But at 8 PM, n pickers suddenly crash out and stop working due to fatigue, and the rest all slow back down to 5 kg per hour because they are tired. The master does not have any more pickers, so if too many of them drop out, he is screwed and will have to go overtime. Find the maximum value of n such that all of the cotton can still be picked on time, done no later than 9 PM.
A - 51, B - 52, C - 53, D - 54, E - 55

14. Find the number of positive integers n less than 69 such that the average of all the squares from 1^2 to n^2, inclusive, is an integer.
A - 11, B - 12, C - 23, D - 24, E - 48

15. Find the number of ordered pairs (a, b) of integers such that (a - b)^2 = 625 - 2ab.
A - 6, B - 10, C - 12, D - 16, E - 20

16. What is the 420th digit after the decimal point in the decimal expansion of 1/13?
A - 4, B - 5, C - 6, D - 7, E - 8

17. Two congruent towers stand near each other. Both take the shape of a right rectangular prism. A plane that cuts both towers into two pieces passes through the vertical axes of symmetry of both towers and does not cross the floor or roof of either tower. Let the point that the plane crosses the axis of symmetry of the first tower be A, and the point that the plane crosses the axis of symmetry of the second tower be B. A is 81% of the way from the floor to the roof of the first tower, and B is 69% of the way from the floor to the roof of the second tower. What percent of the total mass of both towers combined is above the plane?
A - 19%, B - 25%, C - 50%, D - 75%, E - 81%

18. What is the greatest number of positive integer factors an integer from 1 to 100 can have?
A - 10, B - 12, C - 14, D - 15, E - 16

19. On an analog clock, the minute hand makes one full revolution every hour, and the hour hand makes one full revolution every 12 hours. Both hands move at a constant rate. During which of the following time periods does the minute hand pass the hour hand?
A - 7:35 - 7:36, B - 7:36 - 7:37, C - 7:37 - 7:38, D - 7:38 - 7:39, E - 7:39 - 7:40

20. Find the smallest positive integer that is a leg in three different Pythagorean triples.
A - 12, B - 14, C - 15, D - 20, E - 21

21. How many axes of symmetry does the graph of (x^2)(y^2) = 69 have?
A - 2, B - 3, C - 4, D - 5, E - 6

22. Real numbers a, b, and c are chosen uniformly and at random from 0 to 3. Find the probability that a + b + c is less than 2.
A - 4/81, B - 8/81, C - 4/27, D - 8/27, E - 2/3

23. Let f(n) be the sum of the positive integer divisors of n. Find the sum of the digits of the smallest odd positive integer n such that f(n) is greater than 2n.
A - 15, B - 18, C - 21, D - 24, E - 27

24. Find the last three digits of 24^10.
A - 376, B - 576, C - 626, D - 876, E - 926

25. A basketball has a diameter of 9 inches, and the hoop has a diameter of 18 inches. Peter decides to pick up the basketball and make a throw. Given that Peter has a 1/4 chance of accidentally hitting the backboard and missing the shot, but if he doesn’t, he is guaranteed that the frontmost point of the basketball will be within 18 inches of the center of the hoop at the moment when a great circle of the basketball crosses the plane containing the rim. No part of the ball will extend behind the backboard at any point during the throw, and the rim is attached directly to the backboard. What is the probability that Peter makes a green FN?
A - 3/128, B - 3/64, C - 3/32, D - 3/16, E - 3/8
28 replies
freddyfazbear
Mar 24, 2025
freddyfazbear
18 minutes ago
Everybody has 66 balls
YaoAOPS   3
N 2 hours ago by Blast_S1
Source: 2025 CTST P5
There are $2025$ people and $66$ colors, where each person has one ball of each color. For each person, their $66$ balls have positive mass summing to one. Find the smallest constant $C$ such that regardless of the mass distribution, each person can choose one ball such that the sum of the chosen balls of each color does not exceed $C$.
3 replies
YaoAOPS
Mar 6, 2025
Blast_S1
2 hours ago
Inspired by IMO 1984
sqing   4
N 2 hours ago by SunnyEvan
Source: Own
Let $ a,b,c\geq 0 $ and $a+b+c=1$. Prove that
$$a^2+b^2+ ab +24abc\leq\frac{81}{64}$$Equality holds when $a=b=\frac{3}{8},c=\frac{1}{4}.$
$$a^2+b^2+ ab +18abc\leq\frac{343}{324}$$Equality holds when $a=b=\frac{7}{18},c=\frac{2}{9}.$
4 replies
sqing
Yesterday at 3:01 AM
SunnyEvan
2 hours ago
Partition set with equal sum and differnt cardinality
psi241   73
N 3 hours ago by mananaban
Source: IMO Shortlist 2018 C1
Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.
73 replies
psi241
Jul 17, 2019
mananaban
3 hours ago
IMO 2018 Problem 5
orthocentre   75
N 3 hours ago by VideoCake
Source: IMO 2018
Let $a_1$, $a_2$, $\ldots$ be an infinite sequence of positive integers. Suppose that there is an integer $N > 1$ such that, for each $n \geq N$, the number
$$\frac{a_1}{a_2} + \frac{a_2}{a_3} + \cdots + \frac{a_{n-1}}{a_n} + \frac{a_n}{a_1}$$is an integer. Prove that there is a positive integer $M$ such that $a_m = a_{m+1}$ for all $m \geq M$.

Proposed by Bayarmagnai Gombodorj, Mongolia
75 replies
orthocentre
Jul 10, 2018
VideoCake
3 hours ago
Ornaments and Christmas trees
Morskow   29
N 4 hours ago by gladIasked
Source: Slovenia IMO TST 2018, Day 1, Problem 1
Let $n$ be a positive integer. On the table, we have $n^2$ ornaments in $n$ different colours, not necessarily $n$ of each colour. Prove that we can hang the ornaments on $n$ Christmas trees in such a way that there are exactly $n$ ornaments on each tree and the ornaments on every tree are of at most $2$ different colours.
29 replies
Morskow
Dec 17, 2017
gladIasked
4 hours ago
Another square grid :D
MathLuis   42
N 4 hours ago by gladIasked
Source: USEMO 2021 P1
Let $n$ be a fixed positive integer and consider an $n\times n$ grid of real numbers. Determine the greatest possible number of cells $c$ in the grid such that the entry in $c$ is both strictly greater than the average of $c$'s column and strictly less than the average of $c$'s row.

Proposed by Holden Mui
42 replies
MathLuis
Oct 30, 2021
gladIasked
4 hours ago
Cauchy-Schwarz 2
prtoi   2
N 4 hours ago by mpcnotnpc
Source: Handout by Samin Riasat
if $a^2+b^2+c^2+d^2=4$, prove that:
$\frac{a^2}{b}+\frac{b^2}{c}+\frac{c^2}{d}+\frac{d^2}{a}\ge4$
2 replies
prtoi
Yesterday at 4:19 PM
mpcnotnpc
4 hours ago
Maximum of Incenter-triangle
mpcnotnpc   2
N 4 hours ago by mpcnotnpc
Triangle $\Delta ABC$ has side lengths $a$, $b$, and $c$. Select a point $P$ inside $\Delta ABC$, and construct the incenters of $\Delta PAB$, $\Delta PBC$, and $\Delta PAC$ and denote them as $I_A$, $I_B$, $I_C$. What is the maximum area of the triangle $\Delta I_A I_B I_C$?
2 replies
mpcnotnpc
Tuesday at 6:24 PM
mpcnotnpc
4 hours ago
Induction
Mathlover_1   1
N 5 hours ago by Primeniyazidayi
Hello, can you share links of same interesting induction problems in algebra
1 reply
Mathlover_1
Mar 24, 2025
Primeniyazidayi
5 hours ago
equal angles
jhz   3
N 5 hours ago by DottedCaculator
Source: 2025 CTST P16
In convex quadrilateral $ABCD, AB \perp AD, AD = DC$. Let $ E$ be a point on side $BC$, and $F$ be a point on the extension of $DE$ such that $\angle ABF = \angle DEC>90^{\circ}$. Let $O$ be the circumcenter of $\triangle CDE$, and $P$ be a point on the side extension of $FO$ satisfying $FB =FP$. Line BP intersects AC at point Q. Prove that $\angle AQB =\angle DPF.$
3 replies
jhz
Yesterday at 12:56 AM
DottedCaculator
5 hours ago
USACO US Open
neeyakkid23   19
N Yesterday at 2:48 AM by aidan0626
Howd you all do?

Also will a 766 make bronze -> silver?
19 replies
neeyakkid23
Tuesday at 12:00 PM
aidan0626
Yesterday at 2:48 AM
USACO US Open
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
neeyakkid23
102 posts
#1 • 1 Y
Y by MathPerson12321
Howd you all do?

Also will a 766 make bronze -> silver?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BS2012
945 posts
#2 • 2 Y
Y by SweetTangyOrange, MathPerson12321
270 first gold
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ethan2011
229 posts
#3 • 1 Y
Y by Zhaom
neeyakkid23 wrote:
Howd you all do?

Also will a 766 make bronze -> silver?

probably
I got 444 on silver :sob:
I need to lock in for coding rather than grinding math all the time.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bot1132
126 posts
#4
Y by
bronze p1: also easier. count the number of single moves that beat both of the opponents, use set
bronze p2: quite a bit easier than previous contests? just count the number of distinct numbers that appear at least twice and is not the greatest
bronze p3: strange problem??? lower_bound bash and required constant opimization
This post has been edited 1 time. Last edited by bot1132, Tuesday at 2:23 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
neeyakkid23
102 posts
#5
Y by
bot1132 wrote:
bronze p1: quite a bit easier than previous contests? just count the number of distinct numbers that appear at least twice and is not the greatest
bronze p2: also easier. count the number of single moves that beat both of the opponents, use set
bronze p3: strange problem??? lower_bound bash and required constant opimization

I think you switched p1 and p2 but yeah it was quite easy
This is why cutoffs will most likely be 700-750
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
KevinChen_Yay
211 posts
#6
Y by
should i do usaco if i can code answer for amc 10 problems
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
weihou0
28 posts
#7
Y by
You can try
Usaco is different tho
Amc10 score does not correlate AT ALL
Because amc 10 problems are made to be solved by humans without the aid of a computer
But usaco ones are not
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mathandski
727 posts
#8 • 1 Y
Y by KevinChen_Yay
KevinChen_Yay wrote:
should i do usaco if i can code answer for amc 10 problems

A lot of harder USACO problems (1600+ CodeForces rating) are heavily math dependent so this is a really good sign. Learning coding also massively buffs your combo ability so you should definitely do it.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BS2012
945 posts
#9 • 1 Y
Y by KevinChen_Yay
Mathandski wrote:
KevinChen_Yay wrote:
should i do usaco if i can code answer for amc 10 problems

A lot of harder USACO problems (1600+ CodeForces rating) are heavily math dependent so this is a really good sign. Learning coding also massively buffs your combo ability so you should definitely do it.

real Gold P1 was just basic AMC level combo (missed like 4 test cases for some reason)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RainbowSquirrel53B
586 posts
#10
Y by
i took bronze and the first two were rly easy and the last one was hard, does anyone have a solution for that?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
harrytang
1 post
#11
Y by
do u think 740 will make gold? im scared its gonna be 750
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HumanCalculator9
6231 posts
#12
Y by
Silver review:
p1: honestly not too bad, full solved in 1h20m
p2: POV binary search (I did not solve during test, but notice that if you graph out the IDs that can interact you just get a bunch of lines)
p3: binary search strikes back (figured out the c=0 case during test but couldn't code, extended after because usaco for some reason put max c as 10)

Overall, if I had less of an implementation skill issue, could have gotten around a 525. Actually got about a 460.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bot1132
126 posts
#13
Y by
RainbowSquirrel53B wrote:
i took bronze and the first two were rly easy and the last one was hard, does anyone have a solution for that?

for each query, loop through all possible moos (26*25 total). for simplicity let the moo be "abb". its obviously optimal to pick the first "a" to the right of the left bound, and the last "b" to the left of the right bound (this can be done in log time with binary search). then for the middle "b", we find the "b" closest to the middle of the positions of the two characters.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
neeyakkid23
102 posts
#14
Y by
bot1132 wrote:
RainbowSquirrel53B wrote:
i took bronze and the first two were rly easy and the last one was hard, does anyone have a solution for that?

for each query, loop through all possible moos (26*25 total). for simplicity let the moo be "abb". its obviously optimal to pick the first "a" to the right of the left bound, and the last "b" to the left of the right bound (this can be done in log time with binary search). then for the middle "b", we find the "b" closest to the middle of the positions of the two characters.

thats what i tried doing but i sold
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bot1132
126 posts
#15
Y by
neeyakkid23 wrote:
bot1132 wrote:
RainbowSquirrel53B wrote:
i took bronze and the first two were rly easy and the last one was hard, does anyone have a solution for that?

for each query, loop through all possible moos (26*25 total). for simplicity let the moo be "abb". its obviously optimal to pick the first "a" to the right of the left bound, and the last "b" to the left of the right bound (this can be done in log time with binary search). then for the middle "b", we find the "b" closest to the middle of the positions of the two characters.

thats what i tried doing but i sold

its very hard to get this to pass, because its 3*10^8 operations
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RainbowSquirrel53B
586 posts
#16
Y by
ya i gave up on the third subtask so i just made the program solve queries of 1 :skull:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
akliu
1736 posts
#17
Y by
figured out p2 and p3, but was tired and decided to not impl and skip this contest
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
tigerbw
97 posts
#18
Y by
hoping that 700 is gold cutoff again :maybe:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
LearnMath_105
136 posts
#19
Y by
the general consensus seems to be that this contest was significantly easier than the rest so its time to see if usaco will have a non 700 cutoff this year
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
aidan0626
1782 posts
#21 • 1 Y
Y by MathPerson12321
Silver review:
p1: honestly not too bad, full solved in 1h20m
p2: POV binary search (I did not solve during test, but notice that if you graph out the IDs that can interact you just get a bunch of lines)
p3: binary search strikes back (figured out the c=0 case during test but couldn't code, extended after because usaco for some reason put max c as 10)

Overall, if I had less of an implementation skill issue, could have gotten around a 525. Actually got about a 460.

wait how do you solve p1 :sob:
Z K Y
N Quick Reply
G
H
=
a