Number Theory Problems

CIMAT Matemorphosis

Problem N1. 1 × 9 × 81 = 3 × 27 × ?

(a) 1 (b) 3 (c) 9 (d) 27 (e) 81

Problem N2. How much is the sum 1111111 + 1111111 + 1111111 + 1111111 + 2222222?

(a) 1111111 (b) 3333333 (c) 5555555 (d) 6666666 (e) 7777777

Problem N3. What is the ones digit of the number 5 × 5 × 5 × 5 × 5 × 5 × 5 × 5 × 5 × 2?

(a) 0 (b) 1 (c) 2 (d) 3 (e) 4

Problem N4. If 1 + 2 + 3 + · · · + 99 + 100 = 5050, what is the value of 1000 - 1 + 1000 - 2 + 1000 - 3+ ···
+1000 - 99+1000 - 100?

(a) 4050 (b) 40050 (c) 94950 (d) 95950 (e) 80100

Problem N5. What is (1 + 2 + 3 + · · · + 49 + 50) + (99 + 98 + · · · + 51 + 50)?

(a) 500 (b) 5000 (c) 5050 (d) 5100 (e) 5150

Problem N6. If x, y, and z are positive integers and 2 x · 3 y · 5 z = 54,000 , what is the value of x + y + z ?

Problem N7. What positive integer squared is equal to 96 486?

Problem N8. Eve multiplies two positive integers and obtains the number 16000. If neither of the two
integers that Eve multiplied end in 0, what is the sum of Eve's integers?

Problem N9. The product of two positive integers is 504 and each of the numbers is divisible by 6.
Furthermore, neither of the two integers is the number 6. Which is the larger of the two integers?

Problem N10. Several positive integers are written on the board. The product of the two smallest is 16.
The product of the two largest is 225. Furthermore, all the numbers on the board are different. What is the
sum of all the numbers written on the board?

Problem N11. What is the smallest positive integer made up of only digits 1 and 0 that is divisible by 15?

(a) 10 (b) 110 (c) 1 , 110 (d) 11 , 110 (e) 111

Problem N12. What is the smallest positive integer made up of only digits 1 and 0 that is divisible by 15?

(a) 10 (b) 110 (c) 1 , 110 (d) 11 , 110 (e) 111

Problem N13. What is the smallest positive integer by which the number 108 , 675 must be divided so
that the quotient is a perfect square?

1
(a) 805 (b) 543 (c) 483 (d) 110 (e) 161

Problem N14. Consider all the different three-digit numbers that can be made with the digits 0, 1, 2, 3,
and 5. How many of these numbers are multiples of 6?

(a) 4 (b) 7 (c) 10 (d) 15 (e) 20

Problem N15. How many positive rational numbers in simplified form with a denominator other than 1
satisfy that, when the numerator and denominator are multiplied, the result is 27000?

(a) 8 (b) 30 (c) 5 (d) 7 (e) 27

Problem N16. If n is an integer, we will denote by hni the number of positive numbers that divide n . For
example, h 5 i is equal to 2 because there are two positive numbers that divide 5 (1 and 5 itself). How
much is hh 10 i · h 12 ii worth?

(a) 2 (b) 4 (c) 6 (d) 8 (e) 10

Problem N17. How many positive divisors does 2016 have that are not divisible by 6?

(a) 13 (b) 14 (c) 15 (d) 16 (e) 17

Problem N18. How many positive three-digit integers abc with a 6 = 0 satisfy that a + 3 b + c is a multiple
of 3?

Problem N19. Let A 2 and B 4 be two two-digit numbers such that adding them gives a multiple of 3. How
many solutions can be obtained for A and B ?

(a) 28 (b) 30 (c) 25 (d) 27 (e) 36

Problem N20. A positive integer is written on each of the faces of a cube and each vertex of the cube is
assigned the product of the three faces that reach it. If the sum of these eight numbers is 343, what is the
sum of the numbers written on the faces?

(a) 343 (b) 7 (c) 21 (d) 10 (e) 6

Problem N21. There are six different integers whose sum is 63 in such a way that whenever two of them
are taken, one of them is a multiple of the other. What is the largest number?

(a) 63 (b) 16 (c) 62 (d) 58 (e) 32

Problem N22. How many numbers of the form 13 A 25 B are multiples of 12? ( A and B are digits.)

(a) 6 (b) 8 (c) 12 (d) 36 (e) 1

Problem N23. What is the largest prime number that divides all 3-digit numbers that have all the same
digits?

(a) 101 (b) 3 (c) 11 (d) 17 (e) 37

Problem N24. What is the largest two-digit prime number that divides 3 32 - 2 32 ?

(a) 17 (b) 71 (c) 89 (d) 13 (e) 97

Problem N25. The two roots of the polynomial x 2 - 33 x + c are prime numbers. How much is c worth?

2
(a) 33 (b) 14 (c) 62 (d) 66 (e) 99

Problem N26. How many six-digit numbers that are multiples of 164 end in 164?

Problem N27. How many different numbers can be expressed as the sum of three different numbers from
the set { 1 , 4 , 7 , 10 , 13 , 16 , 19 } ?

(a) 37 (b) 36 (c) 18 (d) 42 (e) 13

Problem N28. For how many integers x in the set { 1 , 2 , . . . , 100 } is the number x 3 - x 2 the square of an
integer?

(a) 7 (b) 8 (c) 9 (d) 10 (e) 11

Problem N29. How many pairs of positive integers ( x, y ) satisfy the equation 3 x + 7 y = 2013?

(a) 0 (b) 30 (c) 55 (d) 70 (e) 95

Problem N30. What is the largest prime number of the form n 2 - 12 n + 27 where n is a positive integer?

(a) 91 (b) 37 (c) 23 (d) 17 (e) 7

Problem N31. The five-digit number 36 aa 3 is a multiple of 7. What is the sum of all possible values of
a?

Problem solutions
Solution N1. The answer is (c). Since 9 × 81 = 9 × 9 × 9 and 3 × 27 × ? = 3 × 3 × 9 × ? = 9 × 9 × ? , so ?
= 9 so that equality is satisfied.

Solution N2. The answer is (d). The 2222222 can be seen as 1111111 + 1111111 therefore there are 6
1111111 so the total sum is 6 × 1111111 = 6666666

Solution N3. The answer is (a). Without having to do the whole calculation, we observe that 5 × 2 is 10
and every time we multiply 5 by 10 the number will end up in zero, so no matter how many times we
multiply 10 by 5, we will always have a zero in the units.

Solution N4. The answer is (c). 1000 - 1+1000 - 2+1000 - 3+ ··· +1000 - 99+1000 - 100 you can see how
the sum of 1000 × 100 - (1 + 2 + 3 + · · · + 100) = 100000 - 5050 =

Solution N5. The answer is (b). Rearranging the terms we have that we want to calculate the following
sum 1 + 2 + ... + 99 + 50, but we know that the sum from 1 to 99 is 99 · 2 100 = 99 · 50 = 4950. Finally, 4950 +
50 = 5000.

Solution N6.
The prime factorization of 54000 is 54000 = 2 4 · 3 3 · 5 3 . So we have x = 4, y = 3 and z = 3, so x + y +
z = 10

Solution N7. First you have to find the prime factorization of 486 and 96, which are 2 · 3 5 and 2 5 · 3,
respectively. Multiplying we have 96 · 486 = 2 6 · 3 6 which can be seen as (2 3 · 3 3 ) 2 . That is, 2 3 · 3 3 is the
number we are looking for.

Solution N8. First you have to calculate the prime factorization of 16000 which is 2 7 · 5 3 . We want to
separate the product 2 7 · 5 3 into two terms in such a way that they do not end in 0. That is, 2 and 5 cannot
both be in the same number because when multiplied they give 10. So the only way is that 2 7 = 128 and 5 3

3
= 125 are the numbers we are looking for.

Solution N9. First, let's find the prime decomposition of 504 which is 2 3 · 3 2 · 7. We have to decompose
this product into two parts. Since both must be divisible by 6, the numbers have to have at least 2 and 3 as
factors, say N 1 = 2 · 3 · ? and N 2 = 2 · 3 · ?. We need to accommodate 2 and 7, but since we do not want
the numbers to be 6, then we cannot accommodate 2 and 7 in the same number. We must then have N 1 = 2
· 3 · 7 = 42 and N 2 = 2 2 · 3 = 12. Then the largest number is 42.

Solution N10. We have that 16 = 2 4 and 225 = 3 2 × 5 2 . We need to decompose 16 and 225 into the
product of two numbers that are not repeated. 4 × 4 is discarded because they are repeated and 1 × 16 is
also discarded because 16 2 = 256 > 225, that is, the product of two numbers larger than 16 could no longer
give 225. So the two smallest numbers must be 2 and 8. Of the 9 pairs whose product is 225, the only
options whose factors are greater than 8 are 9 × 25 and 15 × 15, the latter has repeated factors so the
largest numbers are 9 and 15. Furthermore, between 8 and 9 there are no whole numbers so 2 , 8 , 9 and 25
were the only numbers on the board. Therefore, the sum of the 4 numbers is 44.

Solution N11. The answer is (c). For a number to be divisible by 15, it must be divisible by 3 and 5. A
number whose only digits are 0 and 1 is divisible by 5 if the units digit is 0, and is divisible by 3 if the
number of digits 1 is a multiple of 3. Therefore, the smallest number that meets the conditions of the
problem is 1 , 110.

Solution N12. The answer is (c). For a number to be divisible by 15, it must be divisible by 3 and 5. A
number whose only digits are 0 and 1 is divisible by 5 if the units digit is 0, and is divisible by 3 if the
number of digits 1 is a multiple of 3. Therefore, the smallest number that meets the conditions of the
problem is 1 , 110.

Solution N13. The answer is (c). Let us observe that

108, 675 = 33 × 52 × 7 × 23.

Since in the prime decomposition of a perfect square all the exponents are even, then the quotient we want
to obtain is 3 2 × 5 2 , since it is the largest perfect square that we can obtain. Then, it must be divided by 3
× 7 × 23 = 483.

Solution N14. The answer is (b).

For a number to be a multiple of 6, its units digit must be even and the sum of its digits must be a multiple
of 3. Since 1 + 2 + 3 + 5 = 11 and 11 leaves a remainder 2 when divided by 3, we conclude that the two
digits that must be excluded must leave remainders 0 and 2 when divided by 3, since only one of the digits
leaves a remainder 1 when divide by 3. The possibilities for the two excluded digits are as follows:
0 and 2:with the remaining digits we cannot form multiples of 6.
0 and 5:with the remaining digits we can form the numbers 132 and 312.
3 and 2:with the remaining digits we can form the numbers 150 and 510.
3 and 5:with the remaining digits we can form the numbers 120, 210 and 102 (note that the number
012 only has two digits.)
In total we have 7 numbers.

Solution N15. The answer is (d).

Let's notice that 27000 = 30 3 = 2 3 3 3 5 3 . If the fraction is A B with A and B relative primes, we note that if a
prime p divides A , necessarily p 3 divides A , since AB = 27000 = (2 · 3 · 5) 3 . Then the 2nd, 3rd and 5th
primes are divided between A and B. Then, just choose which primes will appear in A . Each prime of the
three has the option of being or not being in the factorization of A. Then, there are 8 options for A. But one
of them is when 2, 3 and 5 are in A. In that case, A = 27000, B = 1 and the number is an integer. Then,
there are only 7 options.

Solution N16. The answer is (d).

4
On the one hand, we have that h 10 i = 4 because the positive divisors of 10 are 1 , 2 , 5, and 10. On the
other hand, we have that h 12 i = 6 because the positive divisors of 12 are 1 , 2 , 3 , 4 , 6, and 12. Thus, hh
10 i · h 12 ii = h 4 · 6 i = h 24 i . Since the positive divisors of 24 are 1 , 2 , 3 , 4 , 6 , 8 , 12 and 24, the
desired answer is 8.

Solution N17. The answer is (d).

Let's look at the prime factorization of 2016: 2016 = 2 5 · 3 2 · 7. Since we are looking for positive divisors
that are not divisible by 6, we can divide the cases between the divisors that are divisible by 2, those that
are divisible by 3 and those that are not divisible by either of the two. In the first case we have the divisors
2, 2 2 , 2 3 , 2 4 and 2 5 , in addition to the other five divisors that result from multiplying each of these
powers of 2 by 7. Those that are divisible by 3 are 3, 9, 3 · 7 and 9 · 7. Finally, those that are not divisible
between 2 and 3 are 1 and 7. Therefore, there are 16 = 10 + 4 + 2 positive divisors of 2016 that are not
divisible by 6.

Solution N18. Since 3 b is a multiple of 3, then a + c must be a multiple of 3. Applying the criterion of
divisibility by 3, we deduce that the two-digit number ac must also be a multiple of 3. There are 90 two-
digit numbers and 1 3 of them are multiples of 3, that is, 30. Since there are 10 possibilities to choose the
digit b , in total there are 30 × 10 = 300 numbers that satisfy the condition.

Solution N19. The answer is (d). The solution is based on the criterion of divisibility by 3, which states
that a number is divisible by 3 if and only if the sum of its digits is also divisible by 3. Since 4 + 2 = 6 is
divisible by 3, then A + B must also be divisible by three. By inspection, it is easy to determine that there
are 15 pairs of digits such that their sum is divisible by three: (1 , 2), (1 , 5), (1 , 8), (2 , 4), (2 , 7) , (3 , 3),
(3 , 6), (3 , 9), (4 , 5), (4 , 8), (5 , 7), (6 , 6), (6 , 9), ( 7 , 8) and (9 , 9). Removing the pairs (3 , 3), (6 , 6)
and (9 , 9), the rest of them must be counted double since, for example, the pair (1 , 2) produces 2 solutions
A = 1, B = 2 and A = 2, B = 1. Therefore, the total number of solutions is 3 + (2 × 12) = 27.

Solution N20. The answer is (c).

Let's say the numbers written on the faces of the cube are a , b , c , d , e and f , as shown in the following
figure,

where d , e and f are after a , b , c , respectively. We have that the sum of the numbers assigned to the
vertices is

343 = abc + ace + aef + afb + bcd + ced + efd + fbd

= ( a + d )( bc + ce + ef + fb ) = ( a + d )( b + e )( c + f ) .
Since 343 = 7 3 and a + d , b + e and c + f are all greater than one, we have a + d = b + e = c + f = 7 from
which a + b + c + d + e + f = 21.

Solution N21. The answer is (e).

Let's say that the numbers are a 1 < a 2 < a 3 < a 4 < a 5 < a 6 , since whenever two are taken, one is a
multiple of the other, we have that a 2 is a multiple of a 1 , a 3 is multiple of 2 and so on . Therefore,

to 1 ≥ 1,
to 2 ≥ 2 to 1 ≥ 2 ,

5
 to 3 ≥ 2 to 2 ≥ 4 ,
to 4 ≥ 2 to 3 ≥ 8 ,
to 5 ≥ 2 to 4 ≥ 16 ,
to 6 ≥ 2 to 5 ≥ 32 ,
from where a 1 + a 2 + · · · + a 6 ≥ 63. Since the sum of the six numbers is 63, all the equalities in the
previous inequalities must be given, that is, a 1 = 1, a 2 = 2 , a 3 = 4 , a 4 = 8 , a 5 = 16 and a 6 = 32, from
which it follows that 32 is the largest number.

6
Solution N22. The answer is (a).
For a number to be a multiple of 12, it must be a multiple of 3 and 4. For this number to be a multiple of 4,
the number formed by its last two digits must be a multiple of 4. That is, 4 has to divide 5 B . Therefore, B
can be worth 2 or 6.
If B is 2 we obtain the number 13 A 252. For it to be a multiple of 3, the sum of its digits must be a
multiple of 3. The sum is 13 + A , so A can be worth 2, 5 or 8 and we get three numbers.
If B is worth 6 we obtain the number 13 A 256, whose sum of digits is 17+ A , so A can be worth 1, 4 or 7.
Getting three more numbers.
Therefore, there are 6 numbers that comply.

Solution N23. The answer is (e).

If aaa is a three-digit number, we have that aaa = 100 a + 10 a + a = a (100 + 10 + 1) = 111 a , which
shows that all numbers that have three equal digits are multiples of 111. Since 111 = 3 × 37 is one of the
numbers, the prime sought can only be 3 or 37. 37 complies, since 111 divides the three-digit number aaa ,
so aaa is always a multiple of 37.

332

Solution N24. The answer is (e). Factoring we have to

232 = (316 - 216)(316 + 216)
= (38 - 28)(38 + 28)(316 + 216)
= (34 - 24)(34 + 24)(38 + 28)(316 + 216)
= (32 -22)(32 - 22)(34 + 24)(38 + 28)(316 + 216) = 5(13)(97)(38 + 28)(316 + 216).
Then, the prime numbers 5, 13 and 97 are divisors of the number 3 32 - 2 32 . Since 97 is the largest two-digit
prime number and divides 3 32 - 2 32 , the answer is 97.

Solution N25. The answer is (c).

We know that if a and b are the roots of the quadratic polynomial x 2 - 33 x + c , this can be factored as ( x -
a )( x - b ) and therefore we will have a + b = 33 and ab = c . We then need two prime numbers whose sum
is equal to 33. But if we add two odd primes, the result will necessarily be even, so this option is ruled out.
Thus, one of the primes must be 2 and, therefore, the other will be 31. We conclude then that c = 2(31) =
62.

Solution N26. A six-digit number that ends in 164 can be written in the form 10 3 n + 164, where n is a
three-digit number. Since we also want the number to be a multiple of 164, we have that 10 3 n + 164 = 164
k , that is, 10 3 n = 164( k - 1). Since 164 = 2 2 × 41, we have that the three-digit number n must be a
multiple of 41, so n = 41 t , with 3 ≤ t ≤ 24. Therefore, there are 22 = 24 - 3 + 1 six-digit numbers that are
multiples of 164 and end in 164.

Solution N27. The answer is (e). Let's observe that the smallest number we can obtain is 12 = 1 + 4 + 7
and the largest is 48 = 13 + 16 + 19. Let's see which intermediate numbers we can write as the sum of
three different numbers from the set { 1 , 4 , 7 , 10 , 13 , 16 , 19 } .
The numbers in the set are of the form 1 + 3 n with n = 0 , 1 , . . . , 6, then the sum of any three of them is
equal to

(1 + 3 n ) + (1 + 3 m ) + (1 + 3 k ) = 3 + 3( n + m + k ) = 3( n + m + k + 1) , with n, m, k ∈ { 0 , 1 , . . . , 6 }
and different from each other. So we have to

12 ≤ 3( n + m + k + 1) ≤ 48
3 ≤ n + m + k ≤ 15 .

7
Let's observe that we can find n , m and k such that by adding them we obtain all the integer values
between 3 and 15:
3=0+1+2 10=0+4+6
4=0+1+3 11=0+5+6
5=0+1+4 12=1+5+6
6=0+1+5 13=2+5+6
7=0+1+6 14=3+5+6
8=0+2+6 15=4+5+6
9=0+3+6.
Therefore, all multiples of 3 between 12 and 48 can be the sum of three different numbers in the set, that
is, in total there are 13 possible values.

Solution N28. The answer is (d).

Since x 3 - x 2 = x 2 ( x - 1), we need x - 1 to be a square. Since 1 ≤ x ≤ 100, we have that 0 ≤ x - 1 ≤ 99 and it
is easy to see that there are 10 squares in the interval [0 , 99].

Solution N29. The answer is (e).

We have that 7 y = 2013 - 3 x = 3(671 - x ), which means that 3 | 7 and . Since 3 and 7 are relatively prime,
it follows that 3 | and . Then, y = 3 k for some positive integer k . Then s, 21 k = 2013 - 3 x and hence x = 2013
3
- 21 k
= 671 - 7 k . Since x must be positive, we have that k < 67 7 1 ≈ 95 . 85. Therefore, the possible values of
k are 1 , 2 , . . . , 95, and the number of solutions ( x, y ) in positive integers of the equation is 95.

Solution N30. The answer is (e).

We have that n 2 - 12 n + 27 = ( n - 9)( n - 3). For this product to be a prime number, either n - 9 = ± 1 or n -
3 = ± 1. If n - 9 = 1, then n = 10 and ( n - 9)( n - 3) = 7 which is prime. If n - 9 = - 1, then n = 8 and ( n - 9)(
n - 3) = - 5 which is prime. If n - 3 = 1, then n = 4 and ( n - 9)( n - 3) = - 5 which is prime. If n - 3 = - 1,
then n = 2 and ( n - 9)( n - 3) = 7 which is prime. Therefore, the answer is 7.

Solution N31. We have that 7 divides 36 aa 3 if and only if 7 divides (36003 + aa 0). Since 36003 =
7(5143) + 2 and aa 0 = 110 · a = 7(15 · a ) + 5 · a , then 7 divides (36003 + aa 0) if and only if 7 divides 5 ·
a + 2 , if and only if 7 divides 5 · a + 2 + 28 = 5( a + 6). But 7 and 5 are relatively prime, so 7 divides 36
aa 3 if and only if 7 divides a + 6. Therefore, the only possible values of a are 1 and 8. Therefore, the sum
of all possible values of a is 1 + 8 = 9.