Scribd
Upload
93 views

Problems

1. The maximum possible value of r is 99. 2. The number of positive integers that divide at least two of the given integers is 9. 3. The maximum possible number of integers xn that are positive is 1010.

Uploaded by

Hanif Indriawan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
93 views

Problems

1. The maximum possible value of r is 99. 2. The number of positive integers that divide at least two of the given integers is 9. 3. The maximum possible number of integers xn that are positive is 1010.

Uploaded by

Hanif Indriawan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

HMMT February 2022

February 19, 2022


Algebra and Number Theory Round
1. Positive integers a, b, and c are all powers of k for some positive integer k. It is known that the
equation ax2 − bx + c = 0 has exactly one real solution r, and this value r is less than 100. Compute
the maximum possible value of r.

2. Compute the number of positive integers that divide at least two of the integers in the set
{11 , 22 , 33 , 44 , 55 , 66 , 77 , 88 , 99 , 1010 }.
1
3. Let x1 , x2 , . . . , x2022 be nonzero real numbers. Suppose that xk + xk+1 < 0 for each 1 ≤ k ≤ 2022,
where x2023 = x1 . Compute the maximum possible number of integers 1 ≤ n ≤ 2022 such that xn > 0.
4. Compute the sum of all 2-digit prime numbers p such that there exists a prime number q for which
100q + p is a perfect square.

5. Given a positive integer k, let ∥k∥ denote the absolute difference between k and the nearest perfect
square. For example, ∥13∥ = 3 since the nearest perfect square to 13 is 16. Compute the smallest
positive integer n such that
∥1∥ + ∥2∥ + · · · + ∥n∥
= 100.
n
6. Let f be a function from {1, 2, . . . , 22} to the positive integers such that mn | f (m) + f (n) for all
m, n ∈ {1, 2, . . . , 22}. If d is the number of positive divisors of f (20), compute the minimum possible
value of d.
7. Let (x1 , y1 ), (x2 , y2 ), (x3 , y3 ), (x4 , y4 ), and (x5 , y5 ) be the vertices of a regular pentagon centered at
(0, 0). Compute the product of all positive integers k such that the equality

xk1 + xk2 + xk3 + xk4 + xk5 = y1k + y2k + y3k + y4k + y5k

must hold for all possible choices of the pentagon.

8. Positive integers a1 , a2 , . . . , a7 , b1 , b2 , . . . , b7 satisfy 2 ≤ ai ≤ 166 and abi i ≡ a2i+1 (mod 167) for each
1 ≤ i ≤ 7 (where a8 = a1 ). Compute the minimum possible value of b1 b2 · · · b7 (b1 + b2 + · · · + b7 ).
9. Suppose P (x) is a monic polynomial of degree 2023 such that
 
1
P (k) = k 2023 P 1 −
k

for every positive integer 1 ≤ k ≤ 2023. Then P (−1) = ab , where a and b relatively prime integers.
Compute the unique integer 0 ≤ n < 2027 such that bn − a is divisible by the prime 2027.
10. Compute the smallest positive integer n for which there are at least two odd primes p such that
n
X
(−1)νp (k!) < 0.
k=1

Note: for a prime p and a positive integer m, νp (m) is the exponent of the largest power of p that
divides m; for example, ν3 (18) = 2.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy