7/28/2021 contentGRAIL

Question 1

View Questions
Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Single SHAURYA
EM7904456- 7904456 All Questions
1
registered in the system
- Draft
Choice CHAUDHARY -
en

Question Info and Solutions Refine your Search GENERATE PDF/VIEW IN BULK

If n = 10
10
− 1,  the number of digits in n3 is

7904456,790519 Question code

# Options Solution
5,7902391,7902
Question 844,7903180,79 Question
a 30 Id 04905,7902113,
. Code
7904576,790675
2,7906768,7909
b 28

c 32
View Questions

d 27

Hide Question Info Hide Answers Hide Hints

Hints

# Hide MetaID
Tags Hide Steps

Concepts
Show Natural Sort Order

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 2

Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Subjective Gagan
https://new-content-admin.embibe.com/questions/view 1/13
7/28/2021 contentGRAIL
Subjective Gagan
EM7905195- 7905195 4 - Draft
Numerical Godle -
en

Question Info and Solutions

Mary chose an even 4 -digit number n. She wrote down all the divisors of n in increasing order from left to right: 
,  n. At some moment Mary wrote 323 as a divisor of n.  If the smallest possible value of the next
n
1,  2,   … ,
2

divisor written to the right of 323 is N . Find the value of

N
.
10

# Options Solution

a 34
Let, the next largest divisor be k. 

Suppose gcd(k, 323) = 1.  

Then as 323|n, k|n therefore, 323 ⋅ k/n.

However, because k > 323

⇒ 323k > 323 ⋅ 324 > 9999.

Therefore, gcd(k, 323) > 1  

Note that 323 = 17 ⋅ 19.  

Therefore, the smallest gcd can be is 17 and our answer is 323 + 17 = 340.

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 3

Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Single Manoj
EM7902391- 7902391 1 - Draft
Choice Kumar
https://new-content-admin.embibe.com/questions/view 2/13
7/28/2021 contentGRAIL
Choice Kumar -
en

Question Info and Solutions

A computer is printing a list of the seventh powers of all natural numbers, that is the sequence 17 ,  27 ,  37 , … …
The number of terms (or numbers) between 521 and 428 are

# Options Solution

a 12

b 130 ....

c 14

d 150

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 4

Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Subjective komal
EM7902844- 7902844 5 - Draft
Numerical verma -
en

Question Info and Solutions

For any non-empty finite set A of real numbers, let s (A) be the sum of the elements in A. There are exactly 61 3 -
l t b t A f {1 23} ith (A) 36 Th t t l b f3 l t b t f {1 23} ith
https://new-content-admin.embibe.com/questions/view 3/13
7/28/2021 contentGRAIL
element subsets A of {1 , … ,  23} with s (A)  The total number of 3 -element subsets of {1 , … ,  23} with 
= 36.

s (A) < 36 is given by N . Then evaluate N +45

25

# Options Solution

The map {a,  b,  c} → {24 − a,  24 − b,  24 − c} is a bijection from the set of 3 -element
subsets of {1,   … … ,  23} with s (A) < 36 onto the set of 3 -element subsets of
{1,   … … ,  23} with s (A) > 36.  The number of 3 -element subsets of {1,   … … ,  23}

a 36 with s (A) < 36 is.

number of 3 -element subsets of {1,   … … … ,  23} with

1
[1771−
2

s (A) = 36] = 855 = 3 × 3 × 5 × 19.

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 5

Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Subjective komal
EM7903180- 7903180 4 - Draft
Numerical verma -
en

Question Info and Solutions

The square is a multiplicative magic square. That is, the product of the numbers in each row, column, and diagonal is
the same. If all the entries are positive integers, what is the sum of the possible values of g ?

50 b c

d e f

g h 2

 
https://new-content-admin.embibe.com/questions/view 4/13
7/28/2021 contentGRAIL

# Options Solution

a 35
If the power of a prime pn other than 2,  5 divides g, then from 50 ⋅ 2 ⋅ e = 50dg it follows that
p
n
 but then considering the product of the diagonals p2n ∣∣gec  but p2n
∣ e, ∣ 100e,  contradiction.
So the only prime factors of g are 2 and 5.

It suffices now to consider the two magic squares comprised of the powers of 2 and 5 of the
corresponding terms. These satisfy the normal requirement that the sums of rows, columns and
diagonals are the same, owing to our rules of exponents, additionally all terms are non-negative.
The powers of 2 .

I b c
d e f
g h I

So 1 + 1 + e = g + e + c ⇒ g = 2 − c,  so g = 2 − c,  so g = 0,  1,  2.  Indeed we have the

magic squares.

1 0 2
2 1 0
0 2 1

1 1 1
1 1 1
1 1 1

1 2 0
0 1 2
2 0 1

The powers of 5 .

2 b c
d e f
g h 0

Again, we get 2 + e = g + e + c ⇒ g = 0,  1,  2.  However, if we let g = 2,  c = 0 then

e = d + e + f ⇒ d = f = 0.  Which obviously gives us a contradiction and similarly for
g = 0,  c = 2.  For g = 1,  we get

2 0 1
0 1 2
1 2 0

In conclusion, g can be 2  and their sum is 35 .

0 1 1 1 2 1
× 5 ,  2 × 5 ,  2 × 5 ,

Hints

# ID

https://new-content-admin.embibe.com/questions/view 5/13
7/28/2021 contentGRAIL

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 6

Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Subjective komal
EM7904905- 7904905 3 - Draft
Numerical verma -
en

Question Info and Solutions

There are p pairs of positive integers (a,  b) such that gcd (a,  b) and is an integer. What is 7 × p?
a 14b
= 1 +
b 9a

# Options Solution

We have,

a 14b
+
b 9a

2 2
9a +14b
= must be an integer.
9ab

Since the denominator contains a factor of

2 2 2
9,  919a + 14b ⇒ 91b ⇒ 31b

Since b = 3n for some positive integer n, we can rewrite the fraction (divide by 9 on both top
a 28
2 2
a +14n
and bottom) as
3an

Since the denominator now contains a factor of n, we get n ∣∣a2 + 14n
2
⇒ n∣
∣a
2
.

But since 1 = gcd (a,  b) = gcd (a,  3n) = gcd (a,  n) we must have n = 1 and thus b = 3

2
a +14
For b = 3 the original fraction simplifies to 3a
.

For that to be an integer a must be a factor of 14 and therefore we must have

a ∈ {1,  2,  7,  14}.  Each of these values does indeed yield an integer.

Thus there are four solution. P = (1,  3) (2,  3) (7,  3),   (14,  3) and the 7 × P = 28.

Hints
https://new-content-admin.embibe.com/questions/view 6/13
7/28/2021 contentGRAIL
Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 7

Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Subjective komal
EM7902113- 7902113 3 - Draft
Numerical verma -
en

Question Info and Solutions

For each positive integer n, let S (n) denote the sum of the digits of n. For how many values of n is
n + S (n) + S (S (n)) = 2007?

# Options Solution

a 04
Let

T (n) = n + S (n) + S (S (n)) = 2007  

Obviously n < 2007  

Then the maximum value of S (n) + S (S (n)) is when n = 1999 and the sum becomes
20 + 10 = 38. 

So, the minimum bound is 1969.

We do casework upon the tens digit.

Case-1: 1960 = u − 9

 to directly disprove.

Case 2 :

197u ⋅ S (n) = 1 + 9 + 7 + u = 17 + u

and S (S (n)) = 8 + u if u ≤ 2 and S (S (n)) = 2 + (u − 3) = u − 1

https://new-content-admin.embibe.com/questions/view 7/13
7/28/2021 contentGRAIL
( ( )) ≤ ( ( )) ( )

otherwise.

Subcase a T (n) = 1970 + u + 17 + u + 8 + u = 1995 + 3u = 2007 ⇒ u = 4.  This

exceeds our bounds so no

solution here.

Subcaseb : T (n) = 1970 + u + 17 + u + u − 1 = 1986 + 3u + 2007 ⇒ u = 7.  First

solution.

Case- 3 :  198. 5 (n) = 18 + u and S (S (n)) = 9 + u if u ≤ 1 and 2 + (u − 2) = u

otherwise

Subcase a : T (n) = 1980 + u + 18 + u + 9 + u = 2007 + 3u = 2007 ⇒ u = 0 Second

solution

Subcase a:T (n) − 1980 + 11 + 18 + u + 11 + −1998 + 3u = 2007 ⇒ u = 3.  Third

solution 

Case4: 199u But S (n) > 19,  and n + S (n) clearly sum to > 2007

Case-5: 200." So S (n) =? + u and S (S (t)) = 2 + u (recall that n < 2007),  and

2000 + u + 2 + u + 2 + u = 2004 + 3u = 2007 ⇒ u = 1. . Fourth solution.

In total we have 4 colutions, which are 1997. 1980, 1983 and 2001

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 8

Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Subjective Pankaj
EM7904576- 7904576 2 - Draft
Numerical Renwal -
en

https://new-content-admin.embibe.com/questions/view 8/13
7/28/2021 contentGRAIL

Question Info and Solutions

For positive integers n, denote by D (n) the number of pairs of different adjacent digits in the binary (base two)
representation of n. For example, D (3) = D (11 2 ) = 0,  D (21) = D (101012 ) = 4,  and
D (97) = D (11000012 ) = 2.  For how many positive integers n less than or equal to 97  does D (n) = 2 ?

# Options Solution

a 26
If D (n) is even, then the binary expansion of n will both begin and end with a1,  because all
positive binary numbers begin with a 1, and if you switch digits twice, you will have a1 at the
end. Thus we are only concerned with the 49 odd numbers between 1 and 98  inclusive. All of
these odd numbers will have an even D (n) ⋅ D (n) = 0 will be given by the numbers
1,  11,  111,  1111, 11111,  111111 which is a total of 6 numbers.

We skip D (n) = 2 for now and move to D (n) = 4,  which is easier to count. The smallest
D (n) − 4 happens when n = 10101.  To get another number such that D (n) = 4,  we may

extend any of the five blocks of zeroes or ones by one digit. This will form
110101,  100101,  101101,  101001,  101011 all of which are odd numbers that have

D (n) = 4.  To find seven digit numbers that have D (n) = 4.  We can again extend any block

by one so long as it remains less than 1100001 or under. There are five cases:-

1. Extending 110101 is impossible without going over 1100001.  

2. Extending 100101 by putting a 1 at the beginning will go over 1100001 bu the other four
extensions work giving 1000101,  1001101,  1001001,  1001011.

3. Extending 101101 by puttng a 1 at the beginning will go over 1100001 but the other four
extensions given 1001101,  1011101,  1011001,  1011011. Hower 1001101 already appeared
in #2 giving only three new numbers.

4. Extending 101001 at the first group is impossible. The other four extensions are
1001001,  1011001 , 1010001,  1010011 but the first two are repeats. Thus there are only two

new numbers.

5. Extending 101011 at the first group is impossible. The other four extensions are
1001011,  1011011,  1010011,  1010111 but only the last number is new Thus, there is 1 five

digit number, 5 six digit numbers and 4 + 3 + 2 + 1 = 10 seven digit numbers under
1100001 for which D (n) = 4.  That gives a total of 16 numbesr. There smallest number for

which D (n) = 6 is 1010101,  which is under 98.  Further extensions, as well as cases where
D (n) > 6 are not possible. Thus we know that there are 6 odd numbers that have D (n) = 0

and 16 odd numbers that have D (n) = 4,  and 1 number that has D (n) = 6.  The remaining
odd numbers must have D (n) = 2.  This means there are 49 − 6 − 16 − 1 = 26 numbers
that have D (n) = 2

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

https://new-content-admin.embibe.com/questions/view 9/13
7/28/2021 contentGRAIL
Question Learning Maps 1

Question 9

Question
Curator Hygiene Status
Code ID Type Version Plagiarism
Issues
Pankaj
EM7906752- 7906752 Subjective 3 - Draft
Renwal -
en

Question Info and Solutions

The number of integers x which satisfies the inequality is

3 3
< x <
1+√3 √5−√3

(A) 2,  

(B) 3,  

(C) 4,

(D) 5,  

(E) 6.  

# Options Solution

3(√3 −1) 3(√5 +√3 )

We have

3 3
< x < ⇔ < x < .
1+√3 √5 −√3 2 2

– – – −−− −−−
Since
2 4
< √3 − 1 ⇔ < 4 − 2√3 ⇔ 9√3 < 16 ⇔ √243 < √256,
3 9

– – –
√3 − 1 < 1 ⇔ √3 < 2 = √4
a
10 – – 100 −− −− −−− −−−−
< √5 + √3 ⇔ < 8 + 2√15 ⇔ 14 < 9√15 ⇔ √196 < √1215 .
3 9

– – −− −− −− −−
√5 + √3 < 4 ⇔ 8 + 2√15 < 16 ⇔ √15 < 4 ⇔ √15 < √16

3(√3 −1) 3(√5 +√3 )

may be 2,  3,  4,  5
3
∴ 1 < < ,  5 < < 6,    ∴ x
2 2 2

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

https://new-content-admin.embibe.com/questions/view 10/13
7/28/2021 contentGRAIL

Question 10

Question
Curator Hygiene Status
Code ID Type Version Plagiarism
Issues
Pankaj
EM7906768- 7906768 Subjective 2 - Draft
Renwal -
en

Question Info and Solutions

−− −− −− −− −−
Given a > b > c > d > 0,  and U −−
= √ab + √cd ,  V = √ac + √bd ,  W = √ad + √bc .  Use " < " to connect
U ,  V ,  W .

# Options Solution

Since U ,  V ,  W  it is sufficient to compare U 2 ,  V  From

2 2
> 0, ,  W .

2 2
−− −− 2 −− −− 2
U − V = (√ab + √cd ) − (√ac + √bd ) = ab + cd − ac − bd

= (a − d) (b − c) > 0

a −− 2 −− −− 2
2 2 −−
V − W = (√ac + √bd ) − (√ad + √bc ) = ac + bd − ad − bc

= (a − b) (c − d) > 0

Therefore U 2 > V
2
> W
2
,  i.e. W < V < U

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 11
https://new-content-admin.embibe.com/questions/view 11/13
7/28/2021 contentGRAIL

Question ID Type Curator Version Hygiene Plagiarism Status

Code 7909321 Subjective Pankaj 1 Issues - Draft

Renwal
EM7909321- -
en

Question Info and Solutions

Given that the natural numbers numbers a,  b,  c are formed by the same n digits x,  n digits y, and 2n digits z
respectively. For any n ≥ 2 find the digits x,  y,  z such that a2 + b = c

# Options Solution

a (3,  2,  1),   (6,  8,  4),   (8,  3,  7)

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

Question 12

Question
Type Curator Hygiene Status
Code ID Version Plagiarism
Issues
Subjective Ajay
EM7910751- 7910751 2 - Draft
Numerical Singh -
en

Question Info and Solutions

https://new-content-admin.embibe.com/questions/view 12/13
7/28/2021 contentGRAIL

For any real number x, let [x] denote the smallest integer that is greater than or equal to x and [x] denote
the largest integer that is less than or equal to x (for example, [1. 23] = 2  and [1. 23] = 1 ). Find the value of 
2010 2010 2010
2010 − ∑ [ − [ ]].
k=1 k k

# Options Solution

Consider k If k then x so [x]  If

2010 2010
= 1,  2,   … . ,  2010. ∣ 2010, := − ⌊ ] = 0, = 0.
k k

 then 0 so [y]1.
2010 2010
k  /  2010, < y  :   = − [ ⌋ < 1.
k k

a 16
Since the prime factorization of 2010 is 2 × 3 × 5 × 67, we see that 2010 has 16 distinct
2010
divisors. Hence ∑k=1  = number of non-
2010 2010
[ − [ ]] = ∑ [x] + ∑ [y]
k k k∣2010 k/2010

divisor of 2010 among k = 2010 − 16 = 1994

Hints

# ID

Concepts

# Concept ID Code Type Name Display Name Competencies

Question Meta Tags

# Difficulty Level Ideal Time Bloom level Question Source Skill

Question Learning Maps 1

https://new-content-admin.embibe.com/questions/view 13/13