HMMT February 2022 Algebra Problems
Uploaded by
Hanif IndriawanHMMT February 2022 Algebra Problems
Uploaded by
Hanif IndriawanCommon questions
Powered by AILet 100q + p = n^2 for some integer n. Rearranging gives p = n^2 - 100q. For p, a two-digit prime number, n must be constrained to values where n^2 is close to two-digit spot primes separated by a factor 100q, suggesting forms like (n^2 mod 100) = (-p mod 100). Examining each potential n, verify perfect square conditions, reducing problem space by difference squaring. Calculating for feasible primes, feasible q results generate sums truly capturing exceptional single-integral representations, dependent on rarity by intersect methods across domain permutations. Analyze via inequality bounding and magnitude parity, breaking exclusions through set modelling, with sum refinement verifying true integer-embedded calculation.
The condition mn | f(m) + f(n) implies that f(m) and f(n) are constructed in such a way that f(m) + f(n) is heavily divisible by all pairwise products. One possible solution that minimizes divisors of f(20), without loss of generality, is setting f(n) = n^2, which meets the condition as n^3 | n^2 + n^2. For f(20), f(n) = 20^2 = 400, and counting the divisors of 400 gives us d = 15, because 400 = 2^4 * 5^2. Therefore, the minimal number of divisors is 15.
The symmetric property xk_1 + xk_2 + xk_3 + xk_4 + xk_5 = yk_1 + yk_2 + yk_3 + yk_4 + yk_5 for a regular pentagon implies equal contribution from x- and y-coordinates due to symmetry. The roots of unity corresponding to x and y for 2π/5 angles ensure balanced terms. Therefore, k represents harmonic combinations permitting the sum of powers to collapsing to zero symmetrically. The product of such k, defined by harmonic roots solutions, leads to symmetrical zero balance at {5, 10}, their product being 50.
For the quadratic ax^2 - bx + c = 0 to have only one real solution, the discriminant must be zero, i.e., b^2 - 4ac = 0. Given that a, b, and c are powers of k, let a = k^m, b = k^n, and c = k^p. The condition becomes (k^n)^2 = 4(k^m)(k^p), or k^{2n} = 4k^{m+p}. This simplifies to 2n = m + p + 2 after balancing the powers of k, implying m + p = 2n - 2. Solving the quadratic equation for one solution, r = b/(2a) = k^(n-m-1). To maximize r, maximize n - m - 1 while satisfying these equality constraints and r < 100, leading to specific choices for powers of k.
The inequality xk + 1/x(k+1) < 0 implies that xk and x(k+1) must have opposite signs. Therefore, the sequence alternates in sign between terms. For a sequence of 2022 terms, if there is one positive term, then every second term must also be positive, leading to at most 1011 positive terms. The maximum possible number of integers for which xn > 0 is therefore 1011 since the sequence must start with either a positive term or a negative term, maintaining alternation over 2022 entries.