MAJOR TEST PAPER-04

IOQM 2024
Subjective Test - 04 Basic Mathematics, Number Thoery (Till taught) Date : 26/11/2023

1. How many positive even multiples of 3 less than 8. The least common multiple of a positive integer
2020 are perfect squares? [2 Marks] n and 18 is 180, and the greatest common divisor
of n and 45 is 15. What is the sum of the digits of
1
2. The weight of of a large pizza together with n? [3 Marks]
3
1
3 cups of orange slices is the same as the
2 9. How many positive three-digit integers have a
3 1 remainder of 2 when divided by 6, a remainder of
weight of of a large pizza together with cup
4 2
5 when divided by 9, and a remainder of 7 when
1
of orange slices. A cup of orange slices weighs divided by 11 ? [3 Marks]
4
of a pound. Let Q be the weight, in pounds, of a
m 10. Find the smallest positive integer n such that
large pizza. And Q is in the form of (m and n
n
n(n + 1) (n + 2) is divisible by 247. [3 Marks]
are co-prime numbers) then find m + n.
[2 Marks]
11. The number 695 is to be written with a factorial
3. The sum of the digits of the number 10n – 1 is base of numeration, that is, 695 = a1 + a2 × 2! + a3
3798. Find the sum of digits of n [2 Marks]
× 3! + ⋯ an × n ! where a1, a2, a3 …an are integers

4. Let k = 2008 2 + 22008. What is the units digit of such that 0 ≤ ak ≤ k, and n! means n(n – 1)(n –2)
k2 + 2k ? [2 Marks] …2 × 1. Find a4 [3 Marks]

5. The largest number by which the expression

12. For how many (not necessarily positive) integer
n3 – n is divisible for all possible integral values
n
of n, is: [2 Marks] 2
values of n is the value of 4000    an integer?
5
6. Let P be the product of any three consecutive
[3 Marks]
positive odd integers. The largest integer dividing
all such P is: [2 Marks]
13. A cubic polynomial p(x) is such that p(1) = 1,
7. In 1991 the population of a town was a perfect p(2) = 2, p(3) = 3 and p(4) = 5, then the value of
square. Ten years later, after an increase of 150
p(6) is : [5 Marks]
people, the population was 9 more than a perfect
square. Now, in 2011, with an increase of another
150 people, the population is once again a perfect 14. How many ordered triples (x, y, z) of positive
square. What is the nearest percent growth of the integers satisfy lcm (x, y) = 72, lcm (x, z) = 600
town's population during this twenty-year period? and lcm (y, z) = 900 ? [5 Marks]
[3 Marks]
[1]
15. Let f(x) = x2 + 3x + 2 and let S be the set of 17. What is the tens digit in the sum
integers {0, 1, 2, …, 25}. The number of members 7! + 8! + 9! + ⋯ + 2006! [5 Marks]
s of S such that f(s) has remainder zero when
divided by 6 is: [5 Marks] 18. How many pairs of positive integers (a, b) are
there such that a and b have no common factors
16. There are unique integers a2, a3, a4, a5, a6, a7 such a 14b
greater than 1 and + is an integer?
that b 9a
5 a2 a3 a4 a5 a6 a7 [5 Marks]
= + + + + +
7 2! 3! 4! 5! 6! 7!
where 0 ≤ ai < i for i = 2, 3, …, 7.
Find a2 + a3 + a4 + a5 + a6 + a7. [5 Marks]

[2]
 IOQMPATTERN]
[NEET 2024 TESTMINOR PAPER-04
TEST– 04
DURATION : 200 MINUTES
NA ONLINE NA HYBRID PURE OFFLINE
DATE: 26/11/2023

[NEET
ANSWER KEY
Que. 1 2 3 4 5 6 7 8 9 10
06
DURATION : 200 MINUTES
Ans.
Que. 16
03
17
62
18
07
06
11
14
05
12
37 08
13 14 15
06

NA ONLINE NA HYBRID09PURE
Ans. 04 04 OFFLINE
03 09 16 15 17

[NEET
HINTS & SOLUTIONS
1. (07) A2 = 102 – 1 = 99
Any even multiple of 3 is a multiple of 6, so we A3 = 103 – 1 = 999
need to find multiples of 6 that are perfect A4 = 104 – 1 = 9999
squares and less than 2020. Any solution that we Observing the pattern, we can see that sum of
want will be in the form (6n)2, where n is a digits is 9 × value of n.
positive integer. The smallest possible value is at Hence,
n = 1, and the largest is at n = 7 (where the
9n = 3798  n = 422
expression equals 1764). Therefore, there are a
total of (A) 7 possible numbers.
4. (06)
2. (14) k ≡ 20082 + 22008 ≡ 82 + 24 ≡ 4 + 6 ≡ 0(mod 10).
Use a system of equations. Let x be the weight So, k2 ≡ 0(mod 10). Since k = 20082 + 22008 is a
of a pizza and y be the weight of a cup of orange multiple of four and the units digit of powers of
slices. We have two repeat in cycles of four, 2k ≡24≡ 6(mod
1 7 3 1 10).
x+ y= x+ y.
3 2 4 2 Therefore, k2 + 2k ≡0 + 6≡ 6(mod 10).
Rearranging, we get So the units digit is 6 ⇒ D.
5 36
x = 3y, x = y
12 5 5. (06)
1 Factoring the polynomial gives (n + 1)(n)(n – 1)
Plugging in pounds for y by the given gives
4 According to the factorization, one of those
9 4 factors must be a multiple of two because there
= (A) 1
5 5 are more than 2 consecutive integers. In
addition, because there are three consecutive
3. (08) integers, one of the integers must be a multiple
Let of 3. Therefore 6 must divide the given
An = 10n ⋅ 1 expression. Plugging in n = 2 yields 6. So the
Then, largest possibility is 6.
A1 = 101 – 1 = 9 Clearly the answer is (E) 6
[1]
6. (03)
Notice that this product can be written as n – 2,
n, n + 2. Because it is 3 consecutive odd integers
we know that it must be divisible by at least 3. A
is ruled out because factors of 5 only arise every
5 terms, if we were to take the 3 terms in the
middle of the factors of 5 we wouldn't have a
factor of 5. IE : 7, 9, 11. Obviously B is
impossible because we are multiplying odd
numbers and 2 would never become one of our
prime factors. C is ruled out with the same logic
as A. Lastly E is ruled out because we have
already proved that 3 is possible, and the question
asks for greatest possible. [D]
7. (62)
Let the population of the town in 1991 be a2 and
the population in 2011 be b2. We know that
a2 + 150 + 150 = b2  a2 – b2 = –300
 b2 – a2 = 300  (b – a)(b + a) =
300.
Note that b – a must be even. Testing, we see
that a = 22 and b = 28 works,
as 484 + 150 – 9 = 625 = 252,
784 − 484
so  (E) 62% .
484
8. (06)
Note that
18 = 2 ⋅ 32,
180 = 22 ⋅ 32 ⋅ 5,
45 = 32 ⋅ 5
15 = 3 ⋅ 5.
Let n = 2a ⋅ 3b ⋅ 5c. It follows that:
1. From the least common multiple condition,
we have
l cm(n, 18) = lcm(2a ⋅ 3b ⋅ 5c, 2 ⋅ 32 )
= 2(max(a,1)) ⋅ 3(max(b,2)) ⋅ 5(max(c,0)) = 22 ⋅ 32 ⋅ 5,
from which a = 2, b  {0, 1, 2}, and c = 1.
2.From the greatest common divisor condition,
we have
gcd(n, 45) = gcd (22 ⋅ 3b ⋅ 5, 32 ⋅ 5)
= 2(min(2,0)) ⋅ 3(min(b,2)) ⋅ 5(min(1,1)) = 3 ⋅ 5,
from which b = 1.
Together, we conclude that n = 22 ⋅ 3 ⋅ 5 = 60.
The sum of its digits is 6 + 0 = (B) 6.
9. (05)
Looking at the values, we notice that 11 – 7 = 4,
9 – 5 = 4 and 6 – 2 = 4. This means we are
looking for a value that is four less than a
multiple of 11, 9, and 6. The least common
multiple of these numbers is 11 ⋅ 32 ⋅ 2 = 198, so
the numbers that fulfill this can be written as
198k – 4, where k is a positive integer. This
value is only a three-digit integer when k is 1, 2,
3, 4 or 5, which gives 194, 392, 590, 788, and
986 respectively. Thus, we have 5 values, so our
answer is (E) 5.
10. (37)
Since, 247 = 13 × 19
Hence, one of numbers n, n + 1, n + 2 is
divisible by 13, let it is a and one is divisible by
19, let it is b. Clearly |b – a| ≤ 2.
Let, b = 19c, where c is any positive integer.
When c = 1, then b = 19.
Since |b – a| ≤ 2, a is among 17, 18, 19, 20, 21,
but none is divisible by 13.
Hence, we try c = 2, then b = 38 and a is among
36, 37, 38, 39, 40, hence a = 39.
And, the three numbers n, n + 1, n + 2 are
respectively 37, 38, 39 or 38, 39, 40.
Thus, the smallest value of n = 37.
11. (03)
This problem can be approached similarly to
other base number problems.
Since 120 < 695 < 720, divide 695 by 120. The
quotient is 5 and the remainder is 95, so rewrite
the number as
695 = 5 ⋅ 120 + 95
Similarly, dividing 95 by 24 results in a quotient
of 3 and a remainder of 23, so the number can be
rewritten as
695 = 5 ⋅ 120 + 3 ⋅ 24 + 23
Repeat the steps to get
695 = 5 ⋅ 120 + 3 ⋅ 24 + 3 ⋅ 6 + 2 ⋅ 2 + 1
The answer is (D). One can also stop at the
second step by noting 23 < 24.
12. (09)
Note that
n n
2 2
5
( )
4000    = 2 5  53    = 2 5 + n  53− n .
5
Since this expression is an integer, we need:
5 + n ≥ 0, from which n ≥ –5.
3 – n ≥ 0, from which n ≤ 3.
Taking the intersection gives –5 ≤ n ≤ 3.
So, there are 3 – (–5) + 1 = (E) 9 integer values
of n.
[2]
13. (16) max(b, e) = 2
Let the cubic polynomial be max(a, g) = 3
ax + bx + cx + d = P ( x )
3 2
max(b, h) = 1

P (1) = a + b + c + d = 1
P ( 2 ) = 8a + 4b + 2c + d = 2
P ( 3) = 27a + 9b + 3c + d = 3
P ( 4 ) = 64a + 16b + 4c + d = 5
by equation 1 and equation 2
7a + 3 b + c = 1
equation ( v )  3 equation (iii)
max(c, i) = 2
max(d, g) = 2
max(e, h) = 2)
and c = f = 0 since lcm (x, y) isn't a multiple of 5.
Since max(d, g) = 2 we know that a = 3. We also
know that since max (b, h) = 1 that e = 2. So
now some equations have become useless to
us...let's take them out.

−6a − d = 0 max(b, h) = 1
−6a = d max(d, g) = 2
putting in equation (ii) and (iii) are the only two important ones left. We do
2a + 4b + 2c = 2 casework on each now. If max(b, h) = 1 then (b,
or a + 2b + c = 1 h) = (1, 0), (0, 1) or (1, 1). Similarly if max(d, g)
21a + 9b + 3c = 3 = 2 then (d, g) = (2, 0), (2, 1), (2, 2), (1, 2), (0,
or 7a + 3b + c = 1 2). Thus our answer is 5 × 3 = (A) 15.
solving equation (viii) and (vii)
−6a = b 15. (17)
So − 6a = b = d Note that for all polynomials
putting these values in (i) and (iv) f(x), f(x + 6)  f(x)(mod 6).
−11a + c = 1
Proof: If f(x) = anxn + an–1 xn–1 + ⋯ + a0, then
−11a + c = 1
f(x + 6) = an(x + 6)n + an–1 (x + 6)n – 1 + ⋯ + a0.
−38a + 4c = 5
In the second equation, we can use the binomial
solving these two
expansion to expand every term, and then
we get
subtract off all terms that have a factor of 61 or
1
a= higher, since subtracting a multiple of 6 will not
6
change congruence (mod 6). This leaves
17
c= an xn + an–1 xn–1 + ⋯ + a0, which is f(x),
6
so be = –1= d so f(x + 6)  f(x)(mod 6)
now p(6) So, we only need to test when f(x) has a remainder
= 216a + 36b + 6c + d of 0 for 0, 1, 2, 3, 4, 5. The set of numbers 6, 7,
= 36 –36 + 17–1 8, 9, 10, 11 will repeat remainders, as will all
= 16 other sets. The remainders are 2, 0, 0, 2, 0, 0.
This means for s = 1, 2, 4, 5, f(s) is divisible by
14. (15) 6. Since f(1) is divisible, so is f(s) for s = 7, 13,
We prime factorize 72, 600, and 900. The prime 19, 25, which is 5 values of s that work. Since
factorizations are 23 × 32, 23 × 3 × 52 and 22 × 32 f(2) is divisible, so is f(s) for s = 8, 14, 20, which
× 52, respectively.
is 4 more values of s that work. The values of s = 4,
Let x = 2a × 3b × 5c, y = 2d × 3e × 5f and
5 will also generate 4 solutions each, just like
z = 2g × 3h × 5i. We know that
f(2). This is a total of 17 values of s, for an
max(a, d) = 3
answer of (E)
[3]
16. (09) 18. (04)
We start by multiplying both sides by 7!, and we a 14b
Rewriting + over a common denominator
get: b 9a
3600 = 2520a2 + 840a3 + 210a4 + 42a5 + 7a6 + a7 9a 2 + 14b 2
gives .
After doing some guess and check, we find that 9ab
the answer is (B) 9. Thus, we have 9|9a2 + 14b2  3|b.
Next, we have
17. (04) ab | 9a2 + 14b2  ab | 14b2  a ∣ 14b.
Since 10! is divisible by 100, any factorial Thus, a  (1, 2, 7, 14).
greater than 10! is also divisible by 100. The last
Next, we have b | 9a2 + 14b2  b | 9a2  b ∣ 9.
two digits of all factorials greater than 10! are
Thus, b  (1, 3, 9).
00, so the last two digits of 10! + 11! + ⋯ +
Now, we simply do casework on b.
2006 ! are 00.(*)
Plugging in b = 1, 3 and 9 gives that there are 4
So all that is needed is the tens digit of the sum
total solutions for (a, b).
7! + 8! + 9!
7! + 8! + 9! = 5040 + 40320 + 362880 = 408240
So the tens digit is (C) 4.

PW Web/App - https://smart.link/7wwosivoicgd4

Library- https://smart.link/sdfez8ejd80if

[4]