3
Part of 2016 ASDAN Math Tournament
Problems(10)
2016 Algebra Tiebreaker #3
Source:
8/8/2022
Denote the dot product of two sequences and to be
Let and be two sequences of consecutive integers (i.e. for , and similarly for ). Minnie permutes the two sequences so that their dot product, , is minimized. Maximilian permutes the two sequences so that their dot product, , is maximized. Given that and , compute , the number of terms in each sequence.
2016Algebra Tiebreaker
2016 Algebra #3
Source:
8/6/2022
Real numbers form an arithmetic sequence satisfying
\begin{align*}
x+y+z&=6\\
xy+yz+zx&=10.
\end{align*}
What is the absolute value of their common difference?
2016Algebra Test
2016 Calculus #3
Source:
8/8/2022
If , where and , find .
2016Calculus Test
2016 Calculus Tiebreaker #3
Source:
8/8/2022
Compute
2016Calculus Tiebreaker
2016 Discrete #3
Source:
8/10/2022
Julia adds up the numbers from to in a calculator. However, every time she inputs a , the calculator malfunctions and inputs a instead (for example, when Julia inputs , the calculator inputs instead). How much larger is the total sum returned by the broken calculator? (No s are replaced by s in the output, and the calculator only malfunctions while Julia is inputting numbers.)
2016Discrete Math Test
2016 Discrete Tiebreaker #3
Source:
8/10/2022
Find the th smallest positive integer that is a solution to .
2016Discrete Math Tiebreaker
2016 Geometry Tiebreaker #3
Source:
8/11/2022
Let be the orthocenter of triangle , and be the foot of onto . Given that , , and , calculate .
2016Geometry Tiebreaker
2016 Geometry #3
Source:
8/11/2022
Let be a unit square, and let there be two unit circles centered at and . Let be the point of intersection of the two circles inside the square. Compute in degrees.
2016Geometry Test
2016 Guts #3
Source:
8/14/2022
A number is if any of , , , , or is prime. Compute the smallest positive integer that is not .
2016Guts Round
2016 Team #3
Source:
8/17/2022
Moor has white rabbit candies. He and his friends split the candies equally amongst themselves, and they find that they each have an integer number of candies. Given that is a positive integer (Moor has at least friend), how many possible values of exist?
2016team test