Difference between revisions of "2023 SSMO Relay Round 2 Problems"
(Created page with "==Problem 1== Consider the cubic polynomial <math>P(x)=ax^3+bx^2+cx+d</math>, where <math>a,b,c,d</math> are single-digit integers, which has roots of approximately <cmath>x...") |
|||
Line 6: | Line 6: | ||
[[2023 SSMO Relay Round 1 Problems/Problem 1|Solution]] | [[2023 SSMO Relay Round 1 Problems/Problem 1|Solution]] | ||
+ | |||
==Problem 2== | ==Problem 2== | ||
Line 11: | Line 12: | ||
[[2023 SSMO Relay Round 1 Problems/Problem 2|Solution]] | [[2023 SSMO Relay Round 1 Problems/Problem 2|Solution]] | ||
+ | |||
==Problem 3== | ==Problem 3== | ||
Latest revision as of 15:25, 2 May 2025
Problem 1
Consider the cubic polynomial , where
are single-digit integers, which has roots of approximately
Compute
.
Problem 2
Let TNYWR. Suppose that
points are evenly spaced around the circle. Find the number of ways to select
points such that the
-gon formed strictly contains the center of the circle.
Problem 3
Let TNYWR. In a committee of
people,
are scientists and the rest are builders. In order to make a building,
people must be choosen with at least one scientist and one builder. If
is the number of ways to do this, find the largest integer
such
.