Difference between revisions of "2022 SSMO Relay Round 3 Problems"
(Created page with "==Problem 1== Let <math>f:\mathbb Z\rightarrow\mathbb Z</math> be a function such that <math>f(0)=0</math> and <math>f\left(|x^2-4|\right)=0</math> if <math>f(x)=0</math>. Mo...") |
|||
(One intermediate revision by the same user not shown) | |||
Line 4: | Line 4: | ||
[[2022 SSMO Relay Round 3 Problems/Problem 1|Solution]] | [[2022 SSMO Relay Round 3 Problems/Problem 1|Solution]] | ||
+ | |||
==Problem 2== | ==Problem 2== | ||
− | Let <math>T=</math> | + | Let <math>T=TNYWR</math>. In cyclic quadrilateral <math>ABCD,</math> <math>\angle{BAD}=60^{\circ},</math> and <math>BC=CD=T.</math> If <math>AB</math> is a positive integer, find twice the median of all (not necessarily distinct) possible values of <math>AB</math>. |
[[2022 SSMO Relay Round 3 Problems/Problem 2|Solution]] | [[2022 SSMO Relay Round 3 Problems/Problem 2|Solution]] | ||
+ | |||
==Problem 3== | ==Problem 3== | ||
− | Let <math>T=</math> | + | Let <math>T=TNYWR</math>. Let <math>f(x)</math> be a polynomial of degree 10, such that <math>f(i)=i</math> for all <math>i=1,2,\dots,10</math> and <math>f(11) =T</math>. Find the remainder when <math>f(13)</math> is divided by <math>1000</math>. |
[[2022 SSMO Relay Round 3 Problems/Problem 3|Solution]] | [[2022 SSMO Relay Round 3 Problems/Problem 3|Solution]] |
Latest revision as of 19:18, 2 May 2025
Problem 1
Let be a function such that
and
if
. Moreover,
for all
. Let
be the number of possible sequences
. Find the remainder when
is divided by 1000.
Problem 2
Let . In cyclic quadrilateral
and
If
is a positive integer, find twice the median of all (not necessarily distinct) possible values of
.
Problem 3
Let . Let
be a polynomial of degree 10, such that
for all
and
. Find the remainder when
is divided by
.