FSJM - Quarter Finals 2021

Rajdeep Ghosh

Solutions
1. We notice that two wheels in contact with each other always rotate in opposite directions. Using this,
the answer comes out to be 6 white wheels.

2. If the second fence is placed between the dark grey tree and the point B, then the triangle formed by
the two trees and the point B has half the area of the square with base BF.
This means that the two fences divide the square with base BF into two parts of equal area. The entire
field is just this square combined with two identical strips on each side. So the two fences actually
divide the entire field into parts of equal area.

3. It is evident that we can see at most three faces of a cube at a time. From the figure:

it is clear that we can see at most 19 small cubes without moving.

4. We want to find the maximum number of insects the spider can eat without visiting one vertex more
than once. Say it was possible to visit every vertex. This would clearly be the best case. It can be
shown exhaustively (by checking every possible path from A to D) that this is not possible. So our
next best solution is one in which the spider visits every vertex but one. Clearly the best case here is
if the spider misses only the vertex with 1 insect in it. And this is achievable :

The maximum number of insects the spider can eat is hence : 2+3+4+3+5+6 = 20.

1
 5. Here is the solution:

6. There are only 5 possibilities. Out of these 74777 can be checked to be divisible by 2021.

7. We informally define the distance between two seats as the number of cable links between them. This
is the same as (1 + number of seats between the seats). Since seat 8 is just passing seat 17, they are
the same distance from the bottom seat 28. Pictorially:

Clearly, 7 + 1 + (n − 28) = 11 or n = 31.

8. A simple brute-force search gives the following 17 vintages: (1012, 1102, 1021, 1120, 1201, 1210, 2011,
1002, 1020, 1200, 2001, 2010, 1022, 1202, 1220, 2012, 2021)

9. Clearly we cannot draw cards of every value, as it immediately leads to drawing 5 cards of consecutive
values. Drawing cards of all values except one, i.e- drawing 12 values instead of 13 also doesn’t work
by PHP. So we need to leave out at least 2 values. If we leave out all Jack and 6 valued cards, it can be
checked that this draw has no 5 cards of consecutive values. Hence, this draw containing 52 − 8 = 44
cards is the largest possible one.

10. We go by the assumption that the length of a rectangle is its larger dimension. This, combined with the
other constraints gives the following 6 possible (length, breadth) pairs: (13,2), (12,3), (11,4), (10,5),
(9,6), (8,7).

2
11. The following picture explains the 130 possible rectangles:

Here in each 5×5 lattice grid in the picture, the counting considers every rectangle of a given dimension.

12. The only fractions that can be simplified are the ones where the numerator and denominator are not
co-prime, and since the prime factorisation of 2021 = 47 × 43, the fractions with numerator divisible
by either47 or 43(the
 smallest
 number divisible by both is 2021 itself) between 1 and 2020. This is
2021 2021 jnk
given by + − 2 = 88 (Since gives the number of multiples of k up to and including
47 43 k
n)

13. We want solutions to a + (a + 1) + . . . (a + n) = 2021 where a and n are naturals, i.e-

(n + 1)(2a + n)
= 2021
2

Remembering that 2021 prime factorises into 43 × 47, we can make cases for n = 2k + 1 and n = 2k
to get that possible values of a + n are 66 and 68.

14. From the diagram:

Noticing that BAD and BCA are similar, we get:

10 b
=
b b + 20
Solving the resulting quadratic, we get b = 20m and a = 30m

3
15. The diagram:

(not drawn to scale) makes it evident that the answer is 1, 4, 7, 9, 14.

      
47n 4 4n
16. Note that = n 1+ =n+ .
43 43 43


 0, 1 ≤ n ≤ 10

1, 11 ≤ n ≤ 21


  
4n
But = 2, 22 ≤ n ≤ 32
43 
3, 33 ≤ n ≤ 42





4, n = 43


So the answer is 1013.

 5

17. A naive count assuming any two planes intersect in a new line is : 3 = 45. But this ignores the
2
fact that every line

joining two of these five points is counted thrice as an intersection of two planes.
5
Since there are 2 = 10 lines, the overcount can be made up for by subtracting 3 × 10 − 10 = 20 lines
from the original count. So the answer is 45 − 20 = 25.

18. The three possibilities are : 122m(20 + 37 + 65), 130 m(25 + 52 + 53) and 170m(17 + 68
+ 85)