ASMOPS 2016, Theory, Math, Answer Key
ASMOPS 2016, Theory, Math, Answer Key
ASMOPS 2016, Theory, Math, Answer Key
MATHEMATICS
Full Name : ANSWER KEY
Date of Birth : XX-XX-XXXX
Country :
PART 1: MULTIPLE CHOICE: Give a cross sign ( X ) for your right answer!
1. A B C D E 5. A B C D E
2. A B C D E 6. A B C D E
3. A B C D E 7. A B C D E
4. A B C D E 8. A B C D E
4. 5
5. no
1
[𝑋𝑃𝑍] = × 100 = 25
4
3
[𝑃𝑄𝑍] = × 25 = 15
5
2. A rectangular hall is divided into rooms as shown below. Every two adjacent
rooms are connected by door. You may walk from one room to another in the
north or east direction only.
a. How many different shortest routes are there from room P to room Q?
N
Q
w E
R
S
Answer:
Q
1 5 15 35 70 126 210 330 495
1 4 10 20 35 56 84 120 165
1 3 6 10 15 21 28 36 45
1 2 3 4 5 6 7 8 9
P 1 1 1 1 1 1 1 1
b. Now room R is locked at all four doors and the keys were lost. So nobody can
go through that room.
How many different shortest routes are there from room P to room Q?
1 4 10 20 20 26 39 60 90
1 3 6 10 R 6 13 21 30
1 2 3 4 5 6 7 8 9
P 1 1 1 1 1 1 1 1
6. Linglung likes reading books. The number of books that he has is less than 60
books. He has mathematics, science, literature, and art books. The number of
science, literature, and art books each is a prime number. There were as many
mathematics books as the number of science books multiplied by the total number
of art and science books. There are 24 more mathematics book than literature
books.
What is the total number of books that Linglung has?
7. Dino has six bags of candies. Each bag has different number of candies: 3, 9, 10,
12, 13, and 14 candies. Dino gave one bag to Tensin. Dino gave the remaining bags
to Edun and Gani. The total number of candies that Edun received was twice as
many as the total number of candies that Gani received.
How many bags does Edun get and how many candies in each Edun’s bag?
Answer:
The number of candies Dino gave to Edun and Gani must be a multiple of 3 as Edun
received was twice as many as the total number of candies that Gani received.
Among the bags, 1 bag has a remainder 2, two bags have a remainder of 1, and 3
bags has remainder 0 when divided by 3.
So the bag given to Tensin either 10 or 13.
If Tensin got a bag of 13 candies, there are 48 candies in 5 bags. Gani got 16
candies. But no combination of bags resulting 16 candies.
So Tensin got a bag of 10 candies.
There are 51 candies in 5 bags.
So Gani got 17 candies from a bag of 3 candies and a bag of 14 candies.
We can conclude Edun received 3 bags, each contain 9, 12, and 13 candies.
9. A ‘happy’ set is a set of 4 consecutive numbers, each below 100 , that are divisible
by 10 when you add all 4 numbers. List of possible set of happy set.
Explain why you think you have find all happy sets!
Answer:
Let the first number be 𝑥, then
𝑥 + (𝑥 + 1) + (𝑥 + 2) + (𝑥 + 3) = 4𝑥 + 6
The unit digit of 4𝑛 must be 4, so the unit digit of 𝑛 must be 1 or 6
1 + 2 + 3 + 4 = 10
6 + 7 + 8 + 9 = 30
11 + 12 + 13 + 14 = 50
16 + 17 + 18 + 19 = 70
21 + 22 + 23 + 24 = 90
10. Each member of the COSMOS maths club is assigned a unique code. Each code
consists of 3 letters, which is taken from the set {𝑀, 𝐴, 𝑇, 𝐻}, {𝐹, 𝑈, 𝑁}, and
{𝐿, 𝑂, 𝑉, 𝐸, 𝑆}, in that order. The club needs to accomodate new members, so the
officials of the club decide to add two new letters (𝑋 and 𝑌). Both new letters can
be added to one particular set or one letter can be added to one set and one to
another set. What is the largest possible number of new members can be
assigned additional unique codes (that contains new letter(s)) ?
Answer:
Let: 𝐴 = {𝑀, 𝐴, 𝑇, 𝐻}, 𝐵 = {𝐹, 𝑈, 𝑁}, and 𝐶 = {𝐿, 𝑂, 𝑉, 𝐸, 𝑆},
If both 𝑋, 𝑌 are added to 𝐴, the total possible codes are 6 × 3 × 5 = 90
If both 𝑋, 𝑌 are added to 𝐵 the total possible codes are 4 × 5 × 5 = 100
If both 𝑋, 𝑌 are added to 𝐶, the total possible codes are 4 × 3 × 7 = 84
𝐼𝑓 𝑋 is added to 𝐴 and 𝑌 is added to 𝐵, the total possible codes are 5 × 4 × 5 = 100.
𝐼𝑓 𝑋 is added to 𝐴 and 𝑌 is added to 𝐶, the total possible codes are 5 × 3 × 6 = 90.
𝐼𝑓 𝑋 is added to 𝐵 and 𝑌 is added to 𝐶, the total possible codes are 4 × 4 × 6 = 96.
At first there are 4 × 3 × 5 = 60 codes.
The largest possible ones happened when both 𝑋, 𝑌 are added to 𝐵, the total
possible codes are 4 × 5 × 5 = 100
So there are 100 − 60 = 40 new codes for new members.