Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2022 SSMO Speed Round Problems/Problem 2"

(Created page with "==Problem== Let <math>A</math>, <math>B</math>, <math>C</math> be independently chosen vertices lying in the square with coordinates <math>(-1, - 1)</math>, <math>(-1, 1)</mat...")
 
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
 
==Problem==
 
==Problem==
−
Let <math>A</math>, <math>B</math>, <math>C</math> be independently chosen vertices lying in the square with coordinates <math>(-1, - 1)</math>, <math>(-1, 1)</math>, <math>(1, -1)</math>, and <math>(1, 1)</math>. The probability that the centroid of triangle <math>ABC</math> lies in the first quadrant is <math>\frac{m}{n}</math> for relatively prime positive integers <math>m</math> and <math>n.</math> Find <math>m+n.</math>
+
 
 +
A bag is big enough to hold exactly 6 large pencils, 12 medium pencils, or 30 small pencils, with no space left over. Given that there is 1 large pencil and 3 medium pencils currently in the bag, what is the maximum number of small pencils that may be added to the bag? Note that there may still be space left over in the bag.
  
 
==Solution==
 
==Solution==
−
Let <math>A</math> have coordinates <math>(a_1, a_2)</math>, <math>B</math> have coordinates <math>(b_1, b_2)</math>,
 
−
and <math>C</math> have coordinates <math>(c_1, c_2)</math>.
 
−
 
−
Note that all these coordinates are uniformly distributed between
 
−
<math>-1</math> and <math>1</math>.
 
−
 
−
Thus, we want to find the probability that
 
−
<cmath>
 
−
    a_1 + b_1 + c_1 \ge 0
 
−
</cmath>
 
−
and
 
−
<cmath>
 
−
    a_2 + b_2 + c_2 \ge 0
 
−
</cmath>
 
−
both hold, which are independent events.
 
−
 
−
If <math>a+b+c>0</math>, then <math>(-a)+(-b)+(-c) < 0</math>.
 
−
Thus, there exists a bijection between when
 
−
<math>a_1 + b_1 + c_1 \ge 0</math> and when <math>a_1 + b_1 + c_1 \le 0</math>.
 
−
(The case of <math>a_1 + b_1 + c_1 = 0</math> occurs with probability
 
−
<math>0</math>).
 
−
so the probability is <math>\frac{1}{2}</math> for the chance
 
−
<math>a_1 + b_1 + c_1 \ge 0</math>.
 
−
 
−
Thus, the answer is thus <math>\frac{1}{2} \cdot \frac{1}{2} = \frac{1}{4}</math>
 

Latest revision as of 19:14, 2 May 2025

Problem

A bag is big enough to hold exactly 6 large pencils, 12 medium pencils, or 30 small pencils, with no space left over. Given that there is 1 large pencil and 3 medium pencils currently in the bag, what is the maximum number of small pencils that may be added to the bag? Note that there may still be space left over in the bag.

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2022_SSMO_Speed_Round_Problems/Problem_2&oldid=247987"