Target Ioqm-2022 Sample Mock - 2

Download as pdf or txt
Download as pdf or txt
You are on page 1of 13

TARGET IOQM 2022 DRONA MOCK PAPERS

MOCK TEST PAPER


OF IQOM 2022 WITH
SOLUTIONS

Please order the "TARGET


IOQM 2022 " BOOK which
consists of 25 such MOCK
PAPERS with Detailed
SOLUTIONS from Adarsh
Book Depot

Page |1
TARGET IOQM 2022 DRONA MOCK PAPERS

Page |2
TARGET IOQM 2022 DRONA MOCK PAPERS

MOCK TEST
01. A tasty number is a positive integer such that the product of its digits equals 36. Let a and b be
numbers defined as follows.

a is the sum of digits of the smallest possible tasty number,

b is the smallest possible sum of digits of a tasty number.

Evaluate the difference a – b.

02. Once upon a time there was a wise King. His castle was in the centre of four concentric circular
walls of radii 50, 100, 150, 200 and the land surrounded by the largest wall was used as the castle
grounds (including the land inside the other walls). There were peaceful times, so he decided to
tear down all four walls and build only one circular wall, again with his castle as the center, of
maximal possible radius from the material of the old ones. Given, the ratio of the area of the new
castle grounds and the area of the old one is a/b, then find a + b.
1
3
15
03. Find the remainder when 19 17 is divided by 100.

04. ABCD is a convex quadrilateral and E, F are the mid-points of BC and CD respectively. The line
segments AE, AF and EF divide ABCD into four triangles, whose areas are four consecutive
integers. Find the greatest possible area of ABD .

05. A standard 6-sided dice is rolled. What is the expected value of the roll given that the value of the
result is greater than the expected value of a regular roll?

06. Fathima wants to write a number in each of the nine cells of this figure so that the sum of the
three numbers on each diameter is 13 and the sum of the eight numbers on each diameter is 13
and the sum of the eight numbers on the circumference is 40.

What number must be written in the central cell?

07. The 28students of a class are seated in a circle. They then all claim that ‘the two students next to
me are of different genders’. It is known that all boys are lying while exactly 3 girls are lying.
How many girls are there in the class?

08. For a family gathering, 8 people order one dish each. The family sits around a circular table. Find
the number of ways to place the dishes so that each person’s dish is either to the left, right, or
directly in front of them.

09. There is a 3 × 3 table. The integers 1 to 9 are now randomly allocated to the cells of the table so
that there is exactly one integer in each cell. The probability that the sum of the three numbers in
x
each row and each column odd is in simplest form, find x + y.
y

Page |3
TARGET IOQM 2022 DRONA MOCK PAPERS
10. Two letters have fallen off a sign that reads HOMEWOOD. A child notices this, but since the
child is still learning how to spell, they simply put the letters back into the two empty positions
at random. The probability that the sign still reads HOMEWOOD afterwards can be expressed as
a
, where a and b are co-prime. What is a  b ?
b

11. What is the sum of all digits of the unique perfect cube ‘c’ of the form c  k 3  k 2  11k  1 for
some strictly positive integer k?

12. A, B and C join a game as a team. Each of them has to independently answer 2021 yes-no
questions (the questions are the same for everyone), in each of which either ‘yes’ or ‘no’ must be
chosen. After that, the answers of A and B are compared and the number of questions in which
they chose the same answer is recorded. The same is done for A’s and C’s answers, as well as for
B’s and C’s answers. The score of the team in the game is the largest number recorded. Find the
minimum possible score of the team in the game. Mark the last two digits as answer.

13. Namitha cycles 3 times as fast as she runs. She spends 4 hours cycling and 1 hour running. Given
that the ratio of the distance that she cycles to the distance that she runs is a/b , where (a,b)=1.
Find the value of ‘a’.

14. Consider the following system of 7 linear equations with 7 unknowns:

a+b+c+d+e=1

b+c+d+e+f=2

c+d+e+f+g=3

d+e+f+g+a=4

e+f+g+a+b=5

f+g+a+b+c=6

g + a + b + c + d = 7.

x
If g = , where x and y are co-primes, find the value of x + y.
y

15. In the diagram, square PQRS has side length 2. Points M and N are the midpoints of SR and RQ,
respectively. The value of cos  MPN  in simplest form is a/b, then find a + b.

P Q

S R
M

16. Each of the five triangles P , Q , R , S , T has the same area. Given CD  5 and AB = x/y, find x + y.

Page |4
TARGET IOQM 2022 DRONA MOCK PAPERS
G

a
N
b o j

A B C D E

17. Suppose that p and q are two different prime numbers and that n  p2 q 2 . Find the number of
possible value of n with n  1000 .

18. Aparna chooses three different numbers from the set {–6, –4, –2, 0, 1, 3, 5, 7} and multiplies them
together to obtain the integer n. What is the sum of the digits of the greatest possible value of n?

19. The number 734,851,474,594,578,436,096 is equal to n6 for some positive integer n.


Find the product of all digits of n.
20. The centres of the seven circles shown all lie on the same line. The four smaller circles have
radius 1 cm. The circles touch, as shown.

1
What is the value of times the total area of the shaded regions?

21. ABC has side lengths 13, 14, and 15. Let the feet of the altitudes from A, B, and C be D, E, and
F, respectively. The circumcircle of DEF intersects AD, BE, and CF at I, J, and K respectively.
What is the area of IJK?
22. Shreya creates a sequence with first term 1 and each subsequent term 5 more than the previous
term. Himaja creates a different sequence with first term a and each subsequent term 3 less than
the previous term. Both sequences are continued forever.

Given that there are exactly 100 numbers which appear in both sequences,

How many possible values of ‘a’ are there?

23. A subset of five distinct positive integers is chosen uniformly at random from the set {1, 2, ... , 11}.
m
The probability that the subset does not contain three consecutive integers can be written as ,
n
where m and n are relatively prime positive integers. Find m + n.

24. How many digits are there in the smallest positive integer that becomes seven times larger after
moving its last digit to the front? (e.g. 135 would change into 513).

Page |5
TARGET IOQM 2022 DRONA MOCK PAPERS

ANSWERS TO MOCK TEST


1) 03 2) 29 3) 59 4) 06
5) 05 6) 03 7) 19 8) 49
9) 15 10) 87 11) 08 12) 74
13) 12 14) 24 15) 09 16) 19
17) 07 18) 15 19) 00 20) 02
21) 21 22) 15 23) 52 24) 22

SOLUTIONS TO MOCK TEST-5


01. Note that 36factors as 36  2  2  3  3 . The smallest tasty number must also have the smallest
possible number of digits. Since the latter cannot be equal to one, it is sufficient to consider and
compare the two-digit tasty numbers, one example being 66. To find the smallest one, which
would then also be the smallest tasty number, one must make first digit d(a divisor of 36) as
36
small as possible whereas (the second digit) must not exceed 9. That yields the tasty number
d
49 with the sum of the digits equal to 13.

To find a tasty number with the smallest possible sum of digits, note that erasing all
occurences of the digit 1decreases the sum of the digits and keeps the product unchanged. Since
d1  d2  d1  d2 holds for any digits d1 , d 2  1 , we conclude that the smallest possible sum of
digits is achieved (not only, though) by 2233 and equals 10. The sought difference is thus
13  10  3 .

02. We know that the sum of the perimeters of the four circular walls will be the perimeter of new
circular wall. Denote the radius of the new circular wall by r. Then

2   50  2   100  2   150  2   200  2   r

  500 2 25
implies that r is the sum of the given radii, i.e. r  500 . Hence, the desired ratio is  .
  200 2 4
f x 
03. For convenience we define f  1  1 and f  n  2    n  2  for odd positive integers n. Then
the question asks for the last two digits of f  19  .

f  13 
Since f  13   13   is odd, we have f  15   15     1 
f 11 f 13
 1  3 (mod 4). As
f  17   17   and the unit digit of the powers of 7 (also powers of 17) follow the pattern 7, 9, 3,
f 15

1, 7, 9, 3, 1 which repeat every four terms, we conclude that the unit digit of f  17  is the same as
that of 17 3 , which is 3.

Finally, if we look at the last two digits of the powers of 19, we will see the pattern 19, 61, 56, 21,
99, 81, 39, 41, 79, 01, 19, 61, which repeat every 10 terms. As f  17  has unit digit 3, the last two

digits of f  19   19   are the same as those of 193 , which are 59.


f 17

Page |6
TARGET IOQM 2022 DRONA MOCK PAPERS
04. Let the areas of the four triangles be n , n  1 , n  2 and n  3 , where n is a positive integer. The
area of the quadrilateral ABCD is thus 4n  6 . Note that the area of ABCD is four times that of
ECF , which is at least 4n . Hence the area of ABD is at most 6.
B E C

A D

Equality can be attained when ABCD is an isosceles trapezium with parallel side AD  6 and
BC  4 , and height 2. (We can check in this case that the areas of CEF , ABE , ADF and AEF
are 1, 2, 3 and 4 respectively, and ABD has area 6). The answer is thus 6.

05. The expected value of a single roll is

1
*  1  2  3  4  5  6   3.5
6
Then the condition given means the roll either results in a 4, 5, or 6 with equal probability. The
expected value is then

1
*  4  5  6  5
3
06. Each diameter has the same sum and contains the central cell, so the pair at the end of each
diameter must have the same sum. These four pairs have sum 40, so each pair must have sum 10.
Since each diameter has sum 13, the central number must be 3.

07. Note that there cannot be two consecutive boys. (To see this, take the longest chain of consecutive
boys. Then he last boy is next to a boy and a girl, so this boy would be telling the truth.) Hence
there must be some number (one or more) of girs between two boys, and so the students on the
circle are of the form  BG  G  BG  G    BG  G 

when B and G denote a boy and a girls respectively. We call the students within each pair of
parentheses a block, which consists of exactly one boy and one or more girls. A girl is lying (i.e.
the two students next to her are of the same gender) if and only if

she is the only girl in the block; or

she is in a block of three or more girls and she is neither the first nor the last girl.

Since 28  1  mod3  , one of the lying girls is of the former type and two are of the latter type. (If
ll are of the former type, then there are three  BG  and the rest are  BGG  , so the number of
students is divisible by 3. Similar contradictions arise if all students are of the latter type, or if
two are of the former type and one is of the latter type.) It follows that there is exactly one  BG 
block. The remaining 26 students into one of the blocks (possibly the same one). Hence there are
9 blocks in total, meaning that there are 9 boys and hence 28 – 9 = 19 girls in the class.

Page |7
TARGET IOQM 2022 DRONA MOCK PAPERS

08. Number the people 1,…,8. If two people sitting next to each other have both their dishes placed
in the same (not on front of them) direction, then everyone must have their dishes placed in that
direction, forming a cycle. This contributes 2 placements.
For the remaiing cases, note that each person either has his dish in front of him or the person has
his dish swapped with one of his neighbors. Thus the question becomes counting the number of
ways to partition a circle of 8 points into some singletons and adjacent pairs.
If person 1 is not in a pair with anyone else then this becomes equivalent to finding the number
of ways to partition a circle of 8 points into some singletons and adjacent pairs.
If person 1 is not in a pair with anyone else then this becomes equivalent to finding the number
of ways to do this with 7 points on a line, which is easy to work out as F7   21  . Otherwise 1 is
paired with 8 or 2 and in each case it becomes pairing 6 pairing 6 points on a line, for a total of
2  F6 ways.
This gives the answer F7  2 F6  2  49 .

09. There must be either 1 or 3 odd numbers in each row as well as each column in order for all row
sums and column sums to be odd. Since there are 5 odd numbers in total, there must be a row
containing 3 odd numbers. The other two rows each contains one odd number, and these two
odd numbers must be in the same column in order for all column sums to be odd.

In other words, there are 9 ways to choose the cells to place the odd numbers (3 choices for the
row to contain 3 odd numbers, and then 3 choices for the column to place the remaining 2 odd
numbers). As far as the required probability is concerned, only the parties of the numbers in each
cell, rather than the numbers themselves, are relevant. As the number of ways of choosing 5 cells
9 1
for the odd numbers is C 59  126 , the required probability is  .
126 14

 8  8!
10. Note there are     28 ways to choose two letters from the word HOMEWOOD. In the
 2  6!2!
 3
   3 cases in which 2 of the O’s fall off, putting the letters back in any order will result in a
2
1
correct sign. In the other 25 cases, there will be a change the letters are put back correctly. We
2
3 25 1 31
add these probabilities up, 1   . Thus, the answer is 31  56  87 .
28 28 2 56
3
11. Clearly, c   k  n  for some n. Note that n cannot be too large; for n = 2 we already have that

 k  2 3 3
is strictly greater than k 3  k 2  11k  1 . Setting c   k  1  we need to solve

 k  1 3  k 3  3k 2  3k  1  k 3  k 2  11k  1  2k 2  8k  k  4
So substituting this back into k 3  k 2  11k  1 gives the unique square to be 125.

Sum of the digits = 1+2+5=8.

12. Let S be the sum of the three numbers recorded. For each question, either all three participants
choose the same answer (in which case the question will contribute 3 to S), or two participants
choose the same answer and the third chooses a different answer (in which case the question will

Page |8
TARGET IOQM 2022 DRONA MOCK PAPERS
contribute e1 to S). Hence S is at least 2021, and so at least one the numbers recorded exceeds 673
(for 73 × 3 <2021), i.e. the score of the team is at least 674. Now consider the following scenario.

A’s answer B’s answer C’s answer


First 674 questions Yes Yes No
Next 674 questions Yes No Yes
Last 673 questions No Yes Yes
In the above example A and B chose the same answer in 674 questions, A and C chose the same
answer in 674 questions while B and C chose the same answer in 673 questions. In this case the
score of the team is exactly 674. It follows that the minimum possible score is 674.

13. Suppose that Namitha runs at r km/h.

Since she cycles 3 times as fast as she runs, she cycles at 3r km/h.

In 1 hour of running, Namitha runs  1h    r km / h   r km .

In 4 hours of cycling, Namitha cycles  4 h   4 h    3r km / h   12 r km .

Thus, the ratio of the distance that she cycles to the distance that she runs in equivalent to the
ratio 12r km: r km which is equivalent to 12:1.

14. Adding up the equations shows that a + b + c + d + e + f + g = 28/5.

Adding up the third, fifth and seventh equations shows that

2 (a + b + c + d + e + f + g) + g = 3 + 5 + 7 = 15.

Thus 2(28/5) + g = 15, from which we find g = 19/5.

x + y = 19 + 5 = 24.

15. The side length of the square is 2 and M and N are midpoints of sides.

Thus, SM  MR  QN  NR  1 .

Using the Pythagorean Theorem in PSM , we get PM  PS 2  SM 2  2 2  12  5

since PM  0 .

Similarly, PN  5 .

Using the Pythagorean Theorem in MNR , we get MN  MR 2  NR 2  12  12  2 since


MN  0 .
Using the cosine law in PMN , we get

MN 2  PM 2  PN 2  2  PM  PN  cos  MPN 

2  552  5  cos  MPN 


2  10  10 cos  MPN 

10 cos  MPN   8

8 4
cos  MPN   
10 5

Page |9
TARGET IOQM 2022 DRONA MOCK PAPERS
16. The area ratio between the triangles BEG and BEF is 4:3. Since these triangles have the same
base line BE , the respective heights must have the ratio 4:3, too. Since the triangles ABG and
3 15
CDF have the same area, we conclude that AB  CD  .
4 4
2
17. We note that n  p 2 q 2   pq  .

2
Since n  1000 , then  pq   1000 and so pq  1000  31.6

Finding the number of possible values of n is thus equivalent to finding the number of positive
integers m with 1  m  31  1000 that are the product of two prime numbers.

The prime numbers that are at most 31 are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31.

The distinct products of pairs of these that are at most 31 are:

2  3  6 2  5  10 2  7  14 2  11  22 2  13  26
3  5  15 3  7  21
Any other product either duplicates one that we have counted already, or is larger that 31.

Therefore, there are 7 such values of n.

18. Since 3 × 5 × 7 = 105, then the greatest possible value of n is at least 105.

In particular, the greatest possible value of n must be positive.

For the product of three numbers to be positive, either all three numbers are positive (that is,
none of the number is negative) or none number is positive and two numbers are negative. (If
there were and odd number of negative factors, the product would be negative.) If all three
numbers are positive, the product is as larger as possible when the three numbers are each as
large as possible, In this case, the greatest possible value of n is 3 × 5 × 7 = 105. If one number is
positive and two numbers are negative, their product is as large as possible if the positive
number is as large as possible (7) and the product of the two negative numbers is as large as
possible.

The product of the two negative numbers will be as large as possible when the negative numbers
are each “as negative as possible” (that is, as far from 0 as possible). In this case, these numbers
are thus –4 and –6 with product  4    6   24 . (We can check the other possible products of
two negative numbers and see that none is as large.)

So the greatest possible value of n in this case is 7   4    6   7  24  168 .

Combining the two cases, we see that the greatest possible value of n is 168.

Sum of the digits = 1+6+8=15.

19. Let x be the given number. Note that x is slightly bigger than 30006  729  1018 .
Focusing on higher order digits, by the binomial theorem, we know that
6
 3000  a   3000 6  6  3000 5  a  729  10 18   1458a  10 15  .

Since x  729  1018   6  10 18  , we know that a < 5.


Focusing on lower order digits, again, by the binomial theorem, we know that

P a g e | 10
TARGET IOQM 2022 DRONA MOCK PAPERS
6 6
 3000  a   1000y  a ,
6
for some integer y. Therefore, the units, tens, and hundreds digits of  3000  a  are the same as
those of a 6 . Of the numbers 1, 2, 3, and 4, only 4 6 ends with the digits 096.
Therefore, the answer is 3004
So, the product of all digits =0.
20. If the shaded pieces on the right-hand side are reflected in a central vertical line, the total shaded
area is then the area of one large circle minus the areas of two small circles. The radius of each
large circle is 2 cm so the shaded area, in cm2, equals   2 2  2    12  4   2   2  .

1
So, times the total area of the shaded regions = 2.

2 cm

21. First we can find that the area of ABC is 84, either by nothing that it can be split into 5-12-13
and 9-12-15 triangles, or using Heron’s formula. Let the orthocenter of ABC be H. The
circumcircle of DEF is the 9-point circle of ABC and thus I, J, K are the midpoints of AH, BH,
1
CH. So, there is a homothety centered at H with factor that sends ABC to DEF .
2
2
1
Then,  DEF      ABC   21 3
2
22. Any common term must appear in Shreya’s sequence. I can clearly appear in both sequences, in
which case it is the smallest common term (as there are no terms smaller than 1 in Shreya’s
sequence). If 6 appears in Himaja’s sequence, then it continues 3, 0, –3, . . . and none of these
overlap with Shreya’s sequence. So 6 could be the smallest common term. Similarly, if 11 appears
in Himaja’s sequence, then it continues 8, 5, 2, –1, . . . which again does not overlap with Shreya’s,
so the smallest common term could be 11. However, if 16 appears in Himaja’s sequence, then so
does 1, so 16 cannot be the smallest common term.

In general, suppose x appears in both sequences. Then Shreya’s sequence contains x – 5, x – 10, x
– 15 and Himaja’s sequence contains x – 3, x – 6, x – 9, x – 12, x – 15. So x – 15 which appear in
both sequences.

Therefore the smallest common term can be at most 15, and the possible values of c are 1, 6 and
11.

We have shown in part (a) that successive common terms differ by 15. Therefore the 100 common
terms are c + 15k, where k = 0, 1, . . . , 99 and c = 1, 6 or 11.

When c = 1, the 100th common term is 1 + 15  9  1486, and this could be the first term of
Hillary’s sequence could also start from 1489, 1492, 1495 or 1498 and the largest common term
would still be 1486. But if Himaja’s sequence started from 1501, then this would be the 101st
common term. So when

P a g e | 11
TARGET IOQM 2022 DRONA MOCK PAPERS
c = 1 there are five possible values of a.

Similarly, when c = 6, the first term of Himaja’s sequence could be 6  15  99  1491, and also
1494, 1497, 1500 or 1503 but not 1506. Finally, when c = 11, the first term of Hillary’s sequence
could be 1496, 1499, 1502, 1505 or 1508.

Therefore, there are 15 possible values of a, the smallest being 1486 and the largest 1508.

23. We proceed by PIE and complementary counting, finding the number of ways to select five
integers from the given set such that there is at least one triplet of consecutive integers. The five
chosen integers divide the remaining six into six distinct groups.
Thus, we wish to determine the number of solutions to
a1  a 2  a 3  a 4  a5  a6  6
with at least one pair  a i , a i 1  equal to (0, 0) for 2  i  5.
Let A be the set of solutions in which a2 = a3 = 0, B be the set of solutions in which a3 = a4 = 0, and
C be the set of solutions in which a4 = a5 = 0. Note that by setting two ai to 0, the equation reduces
to four variables summing to 6.
So by stars-and-bars,
6  4  1  9
A  B  C    .
 4  1  3
By a similar argument, we have
 6  3  1  8  6  2  1 7 
AB  BC      and A  C    .
 3  1  2  2  1  1
 6  2  1 7 
Finally, A  B  C       , so by PIE,
 2  1  1
9  8  7  7 
A  B  C  3    2          3  84  2  28  252  56  196.
 3  2   1  1
 11 
And since there are   ways to select five integers from the set {1, 2, …, 11}, the probability that
5
no three are consecutive is
196 196  5  4  3  2  1 14 14
1  1 1  .
 11  11  10  9  8  7 33 39
 
5
Thus, m + n = 19 + 33 = 52.

24. Let us denote the last digit as a and the number denoted by the rest of digits as b. Then the
original number is equal to 10b + a and the new number is equal to 10ka + 6, where k is the
number of digits of b, thus k  log 10 b   1 .

Now we have to solve the equation 70b + 7a = 10ka + b, that is b 


 10 k
 7a
. Because we need to
69
minimize b, it is sufficient to find the smallest value of k

such that for some a occurs 69| 10k  7  a . Of course 10k – 7 is always divisible by 3, so it is

enough that 23| 10k  7  a , which happens when and only when 23|10k  7 , namely because 23
is a prime number and a < 23.

P a g e | 12
TARGET IOQM 2022 DRONA MOCK PAPERS
k
Therefore we have to find the smallest k such that 10  7 (mod 23). And since 10–1 = 7 (mod 23),
it can be directly derived from Fermat’s little theorem that 21 is the smallest such k. Now we

insert this value into the equation to determine that b 


 10 21
 7a
. Now it is needed to
69
determine the smallest possible values of a and b: reversing the formula for k allows us to know
that b needs to have 21 digits, hence b  1020 , which means that  10 21
 7  a  69  1020 . The
7  1021  49
smallest such a is 7, so a = 7 and b  .
69

Now we can directly calculate

6999999999999999999951 : 69 = 2333333333333333333317 : 23 = 101449275362318840579.

Therefore the number we intended to find is 1014492753623188405797.

Number of digits = 22

P a g e | 13

You might also like