Scribd
Upload
204 views1 page

HMMT February 2016: Algebra

The document contains 10 algebra problems involving topics like complex numbers, prime numbers, permutations, modular arithmetic, and systems of equations. It asks the reader to compute values, determine remainders, find the number of integers satisfying certain properties, evaluate sums, and solve other algebraic expressions and equations. The problems range in complexity from straightforward computations to more involved reasoning about sequences, permutations, and modular arithmetic.

Uploaded by

สนธยา เสนามนตรี
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
204 views1 page

HMMT February 2016: Algebra

The document contains 10 algebra problems involving topics like complex numbers, prime numbers, permutations, modular arithmetic, and systems of equations. It asks the reader to compute values, determine remainders, find the number of integers satisfying certain properties, evaluate sums, and solve other algebraic expressions and equations. The problems range in complexity from straightforward computations to more involved reasoning about sequences, permutations, and modular arithmetic.

Uploaded by

สนธยา เสนามนตรี
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 2016

February 20, 2016

Algebra
1. Let z be a complex number such that |z| = 1 and |z 1.45| = 1.05. Compute the real part of z.
2. For which integers n {1, 2, . . . , 15} is nn + 1 a prime number?
3. Let A denote the set of all integers n such that 1 n 10000, and moreover the sum of the decimal
digits of n is 2. Find the sum of the squares of the elements of A.
4. Determine the remainder when

2015
X
i=0

2i
25

is divided by 100, where bxc denotes the largest integer not greater than x.
5. An infinite sequence of real numbers a1 , a2 , . . . satisfies the recurrence
an+3 = an+2 2an+1 + an
for every positive integer n. Given that a1 = a3 = 1 and a98 = a99 , compute a1 + a2 + + a100 .
6. Call a positive integer N 2 special if for every k such that 2 k N , N can be expressed as a
sum of k positive integers that are relatively prime to N (although not necessarily relatively prime to
each other). How many special integers are there less than 100?
7. Determine the smallest positive integer n 3 for which
A 210n

(mod 2170 )

where A denotes the result when the numbers 210 , 220 , . . . , 210n are written in decimal notation and
concatenated (for example, if n = 2 we have A = 10241048576).
8. Define ! (n) as the product of all positive integers less than or equal to n and relatively prime to n.
Compute the number of integers 2 n 50 such that n divides ! (n) + 1.
9. For any positive integer n, Sn be the set of all permutations of {1, 2, 3, . . . , n}. For each permutation
Sn , let f () be the number of ordered pairs (j, k) for which (j) > (k) and 1 j < k n.
Further define g() to be the number of positive integers k n such that (k) k 1 (mod n).
Compute
X
(1)f ()+g() .
S999

10. Let a, b and c be real numbers such that


a2 + ab + b2 = 9
b2 + bc + c2 = 52
c2 + ca + a2 = 49.
Compute the value of

49b2 + 39bc + 9c2


.
a2

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