Is
rational?
HMMT Invitational Competition 2022.
Is
rational?
Does there exist a regular pentagon whose vertices lie on edges of a cube?
For a nonnegative integer , let be the sum of digits of the binary representation of . Prove that
Call a simple graph quasi-colorable if we can color each edge blue, red, green, and white such that
A connected graph has vertices of degree vertices of degree 3, and no other vertices, where and are positive integers. Find the smallest real number so that the following statement is true: "If , then is quasi-colorable."
Let be a prime and let be the set of integers modulo . Call a function quasiperiodic if there exist , not both zero, so that for all . Find, with proof, the number of functions that can be written as the sum of some number of quasiperiodic functions. Note: The original version of this problem neglected to mention that p was a prime. We regret the error.