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
ka March Highlights and 2025 AoPS Online Class Information
jlacosta0
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.
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
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
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
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
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
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
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
A giant watermelon weighed 50 pounds and was 99 percent water. After sitting in the hot sun, some of the water evaporated so that the watermelon was only 98 percent water. What is the new weight of the watermelon?
My subject is pretty weird but what I mean is the "light" at the end of the "tunnel" (the end of a very long post). For example, the Bogus Proof Marathon. It has like 7k replies and I really can't scroll down 7000 messages so, how do people reach the end of the reply chain? :yoda:
i was typing up a casework solution and then realized I could do it a different way lol kind of casework?
so divisibility by 3 rules states that the digits must add up to a multiple of 3
so starting with the 2 digits, we have
then, 3 digits. this will take up a long time lol (also for the 700-799 that totals up to 33 numbers so I will not include those numbers)
so uh we now have now, we have covered all the numbers in the 7 ones place. (27, if I counted right) now, lets find numbers with tens digit 7 that do NOT have 7 in its one place, since we already counted the _77 in the first case. this totals up to 25 numbers, so the total is so ?
this is my first attempt at this if I'm wrong I'll see where I got it wrong
This post has been edited 1 time. Last edited by AbhayAttarde01, Mar 26, 2025, 1:12 AM
List out values of for :
Now list out powers of up to :
Now calculate using Binomial Theorem:
The floor of this is . I probably definitely made an arithmetic mistake somewhere lol.
hide tag no work we do a little trolling
This post has been edited 1 time. Last edited by maromex, Mar 26, 2025, 11:38 PM
List out values of for :
Now list out powers of up to :
Now calculate using Binomial Theorem:
The floor of this is . I probably definitely made an arithmetic mistake somewhere lol.
hide tag no work we do a little trolling
yea i was thinking the same thing
i wonder if therers a non bash way to do it
3) A grid is made. unit squares are created by separating the side with length in portions and separating the side with length in portions. Find, with proof, a formula for how many rectangles with sides parallel to the grid can be created in terms of and . For example, when and , it can be found by casework that rectangles can be created.
Initialization:
In an grid, each unit square is created by dividing the sides of lengths and . Consequently, we have horizontal lines and vertical lines:
Horizontal lines: These are the lines that create the separate rows of unit squares, and there are ( m + 1 ) horizontal lines.
Vertical lines: These create the separate columns of unit squares, and there are ( n + 1 ) vertical lines.
Choosing Lines to Form Rectangles:
A rectangle can be formed by selecting 2 horizontal lines (to create the top and bottom of the rectangle) and 2 vertical lines (to create the left and right sides of the rectangle).
Calculating Selections:
Choosing Horizontal Lines: Since there are ( m + 1 ) horizontal lines, the number of ways to select 2 lines from these is given by the combination formula:
Choosing Vertical Lines: Similarly, for the ( n + 1 ) vertical lines, the number of ways to choose 2 lines is:
Total Number of Rectangles:
To find the total number of rectangles that can be formed, we multiply the number of ways to choose the horizontal lines and the ways to choose the vertical lines:
Substituting the expressions we derived:
Final Conclusion:
Thus, the total number of rectangles that can be formed in an grid is given by the formula:
Too easy man(please don't give me calculus now).
This post has been edited 2 times. Last edited by cheltstudent, Mar 27, 2025, 7:29 PM Reason: gg
Initialization:
In an grid, each unit square is created by dividing the sides of lengths and . Consequently, we have horizontal lines and vertical lines:
Horizontal lines: These are the lines that create the separate rows of unit squares, and there are ( m + 1 ) horizontal lines.
Vertical lines: These create the separate columns of unit squares, and there are ( n + 1 ) vertical lines.
Choosing Lines to Form Rectangles:
A rectangle can be formed by selecting 2 horizontal lines (to create the top and bottom of the rectangle) and 2 vertical lines (to create the left and right sides of the rectangle).
Calculating Selections:
Choosing Horizontal Lines: Since there are ( m + 1 ) horizontal lines, the number of ways to select 2 lines from these is given by the combination formula:
Choosing Vertical Lines: Similarly, for the ( n + 1 ) vertical lines, the number of ways to choose 2 lines is:
Total Number of Rectangles:
To find the total number of rectangles that can be formed, we multiply the number of ways to choose the horizontal lines and the ways to choose the vertical lines:
Substituting the expressions we derived:
Final Conclusion:
Thus, the total number of rectangles that can be formed in an grid is given by the formula:
Too easy man(please don't give me calculus now).
that's the trivial sol @above, but i'd be suprised if this didn't have multiple sols:
greedy algorithm:
a=2: then 1/b+1/c+1/d=133/840. b=8 yields 1/c+1/d=1/105. The sols here can be found using sfft, some trivial ones for (c,d) are (106,105*106) and (210,210). b=9 and c=9 yields d=45, for example.
a=3: (3,4,21,840)
a=4: (4,4,8,105), (4,5,6,56)
If we look at everything mod , then the expression that we want to be equal to is . Since is for any , must be equal to , so must be odd. The probability of this happening is .
Initialization:
In an grid, each unit square is created by dividing the sides of lengths and . Consequently, we have horizontal lines and vertical lines:
Horizontal lines: These are the lines that create the separate rows of unit squares, and there are ( m + 1 ) horizontal lines.
Vertical lines: These create the separate columns of unit squares, and there are ( n + 1 ) vertical lines.
Choosing Lines to Form Rectangles:
A rectangle can be formed by selecting 2 horizontal lines (to create the top and bottom of the rectangle) and 2 vertical lines (to create the left and right sides of the rectangle).
Calculating Selections:
Choosing Horizontal Lines: Since there are ( m + 1 ) horizontal lines, the number of ways to select 2 lines from these is given by the combination formula:
Choosing Vertical Lines: Similarly, for the ( n + 1 ) vertical lines, the number of ways to choose 2 lines is:
Total Number of Rectangles:
To find the total number of rectangles that can be formed, we multiply the number of ways to choose the horizontal lines and the ways to choose the vertical lines:
Substituting the expressions we derived:
Final Conclusion:
Thus, the total number of rectangles that can be formed in an grid is given by the formula:
Too easy man(please don't give me calculus now).
Initialization:
In an grid, each unit square is created by dividing the sides of lengths and . Consequently, we have horizontal lines and vertical lines:
Horizontal lines: These are the lines that create the separate rows of unit squares, and there are ( m + 1 ) horizontal lines.
Vertical lines: These create the separate columns of unit squares, and there are ( n + 1 ) vertical lines.
Choosing Lines to Form Rectangles:
A rectangle can be formed by selecting 2 horizontal lines (to create the top and bottom of the rectangle) and 2 vertical lines (to create the left and right sides of the rectangle).
Calculating Selections:
Choosing Horizontal Lines: Since there are ( m + 1 ) horizontal lines, the number of ways to select 2 lines from these is given by the combination formula:
Choosing Vertical Lines: Similarly, for the ( n + 1 ) vertical lines, the number of ways to choose 2 lines is:
Total Number of Rectangles:
To find the total number of rectangles that can be formed, we multiply the number of ways to choose the horizontal lines and the ways to choose the vertical lines:
Substituting the expressions we derived:
Final Conclusion:
Thus, the total number of rectangles that can be formed in an grid is given by the formula:
Too easy man(please don't give me calculus now).
6) Leeoz posts a daily problem every , or hours, with equal probability. Soupboy0 posts a daily problem every , or hours, with equal probability. If both Leeoz and Soupboy0 post at the same time, what is the expected time that will elapse in hours before Leeoz and Soupboy0 post again?
In a previous post, in bogus proof marathon, he posted
cheltstudent wrote:
When I tried to post this, the thread was deleted S1950
The proof presented contains a serious flaw regarding the interpretation of the Lemma and its conclusion. Let's scrutinize the argument step by step to demonstrate the issue and the final erroneous conclusion.
Step 1: Understanding the Lemma
The lemma states that for any prime , The proof attempts to show that the sum Step 2: Simplifying the sum
It correctly identifies that is divisible by , thus is divisible by . The approach to analyze by dividing each term by is valid and leads to: Step 3: Application of Wilson's Theorem
The proof uses Wilson's theorem to obtain a congruence relation for modulo . This leads to Thus, the key focus shifts to showing that Step 4: Sum of reciprocals of squares modulo
While it is indeed correct that the inverses form a complete residue system modulo , the computation proceeds to find the sum which yields a term that contains , but concluding it is divisible by requires careful verification through an invalid assumption about the constancy of inverses modulo .
Step 5: Plugging
The conclusion drawn by setting that somehow implies is divisible by based on is invalid and lacks sufficient logical backing. Particularly, the leap from showing , and subsequently manipulating expressions to invoke divisibility conditions without rigorous grounding involves serious misapplication of modulo arithmetic.
Final Analysis
In conclusion, the claim made in this proof is unsubstantiated. The calculations regarding provide a correct context but do not legitimately translate to establish that is divisible by . The entire argument rests on an incomplete treatment of number theory properties and fails to yield a coherent proof. The conclusion that is divisible by is fundamentally unsupported and incorrect. S1950
BET:
The proof presented contains a serious flaw regarding the interpretation of the Lemma and its conclusion. Let's scrutinize the argument step by step to demonstrate the issue and the final erroneous conclusion.
Step 1: Understanding the Lemma
The lemma states that for any prime , The proof attempts to show that the sum Step 2: Simplifying the sum
It correctly identifies that is divisible by , thus is divisible by . The approach to analyze by dividing each term by is valid and leads to: Step 3: Application of Wilson's Theorem
The proof uses Wilson's theorem to obtain a congruence relation for modulo . This leads to Thus, the key focus shifts to showing that Step 4: Sum of reciprocals of squares modulo
While it is indeed correct that the inverses form a complete residue system modulo , the computation proceeds to find the sum which yields a term that contains , but concluding it is divisible by requires careful verification through an invalid assumption about the constancy of inverses modulo .
Step 5: Plugging
The conclusion drawn by setting that somehow implies is divisible by based on is invalid and lacks sufficient logical backing. Particularly, the leap from showing , and subsequently manipulating expressions to invoke divisibility conditions without rigorous grounding involves serious misapplication of modulo arithmetic.
Final Analysis
In conclusion, the claim made in this proof is unsubstantiated. The calculations regarding provide a correct context but do not legitimately translate to establish that is divisible by . The entire argument rests on an incomplete treatment of number theory properties and fails to yield a coherent proof. The conclusion that is divisible by is fundamentally unsupported and incorrect.
Why is this in MSM, idc really as I know what is lol, vincentwant, u got done.
which is probably AI, as nobody writing a solution would write a "Final Analysis" portion, let alone using this wording; not to mention usage of words such as "scrutinize" and "erroneous" in a mathematical proof. This demonstrates that he has used ai before
cheltstudent wrote:
Initialization:
In an grid, each unit square is created by dividing the sides of lengths and . Consequently, we have horizontal lines and vertical lines:
"initialization" :/
cheltstudent wrote:
Total Number of Rectangles:
To find the total number of rectangles that can be formed, we multiply the number of ways to choose the horizontal lines and the ways to choose the vertical lines:
Substituting the expressions we derived:
Final Conclusion:
Thus, the total number of rectangles that can be formed in an grid is given by the formula:
where does the "" come from in the 6th line? It completely disappeared in the boxed answer. If it was kept, there would be a 16 in the denominator, which is incorrect. a person writing a proof for a problem like this would likely notice this error, or more likely
6) Leeoz posts a daily problem every , or hours, with equal probability. Soupboy0 posts a daily problem every , or hours, with equal probability. If both Leeoz and Soupboy0 post at the same time, what is the expected time that will elapse in hours before Leeoz and Soupboy0 post again?
sol
First, we must calculate the LCM of their posting intervals:
Now, we need to calculate the expected time, each of these LCMs are calculated with equal probability of .
The combined case gives: combinations
Now, we must find :
E(X)=
=> hours
So, we have approximately 230.56 hours.
Pretty sure there is a neater solution by graphing successful region of points... but yeah... I'm too dumb for that.
THIS IS NOT AI.
This post has been edited 1 time. Last edited by cheltstudent, Yesterday at 3:08 PM Reason: gg
Initialization:
In an grid, each unit square is created by dividing the sides of lengths and . Consequently, we have horizontal lines and vertical lines:
Horizontal lines: These are the lines that create the separate rows of unit squares, and there are ( m + 1 ) horizontal lines.
Vertical lines: These create the separate columns of unit squares, and there are ( n + 1 ) vertical lines.
Choosing Lines to Form Rectangles:
A rectangle can be formed by selecting 2 horizontal lines (to create the top and bottom of the rectangle) and 2 vertical lines (to create the left and right sides of the rectangle).
Calculating Selections:
Choosing Horizontal Lines: Since there are ( m + 1 ) horizontal lines, the number of ways to select 2 lines from these is given by the combination formula:
Choosing Vertical Lines: Similarly, for the ( n + 1 ) vertical lines, the number of ways to choose 2 lines is:
Total Number of Rectangles:
To find the total number of rectangles that can be formed, we multiply the number of ways to choose the horizontal lines and the ways to choose the vertical lines:
Substituting the expressions we derived:
Final Conclusion:
Thus, the total number of rectangles that can be formed in an grid is given by the formula:
Too easy man(please don't give me calculus now).
bro what is this obvious AI solution :skull:
This post has been edited 1 time. Last edited by swaga, Yesterday at 5:36 PM