9
Part of 2019 BMT Spring
Problems(5)
Product of products is a root of unity (BMT 2019 Algebra #9)
Source:
5/6/2019
Let be the product of the complex roots of that are in the first quadrant of the complex plane. That is, roots of the form where . Let . Find the smallest integer such that is a root of .
The incircle-generating tetrahedron (BMT 2019 Geo #9)
Source:
5/18/2019
Let be a tetrahedron with and . Let be points on , , and , respectively, such that each of the quadrilaterals , , and have an inscribed circle. Let be the smallest real number such that for all such configurations . If can be expressed as where are positive integers with squarefree and squarefree, find .Note: Here, denotes the area of polygon . (This wasn't in the original test; instead they used the notation , which is clear but frankly cumbersome. :P)
geometry3D geometrytetrahedron
Mathlete's log: this is an awfully complex problem! (BMT 2019 Discrete #9)
Source:
5/26/2019
Let . The sum
can be written in the form . Find .
2019 BMT Team 9
Source:
1/7/2022
You wish to color every vertex, edge, face, and the interior of a cube one color each such that no two adjacent objects are the same color. Faces are adjacent if they share an edge. Edges are adjacent if they share a vertex. The interior is adjacent to all of its faces, edges, and vertices. Each face is adjacent to all of its edges and vertices. Each edge is adjacent to both of its vertices. What is the minimum number of colors required to do this?
combinatorics
2019 BMT Individual 9
Source:
1/9/2022
Define an almost-palindrome as a string of letters that is not a palindrome but can become a palindrome if one of its letters is changed. For example, is an almost-palindrome because the can be changed to an to produce a palindrome, but is not an almost-palindrome because it cannot be changed into a palindrome by swapping out only one letter (both the and the are out of place). How many almost-palindromes contain fewer than letters.
combinatorics