layrd.live
Experiments › Limits practice test
JEE Main · Class 11 Maths · Limits

Limits: JEE Main Practice Test, Fully Solved

25 questions on limits at JEE Main level: 20 multiple choice (+4 / −1) and 5 numerical (+4 / −1). Every answer has been checked numerically.

How to use this page 1. Try the test first: about 60 minutes, pen and paper, no solutions open. 2. Check your answers against the answer key at the bottom. 3. Open "Show solution" only for the ones you got wrong or skipped, and note which tool each one needed.

The seven tools this test checks

ToolThe ideaQuestions
Standard limits and equivalentssin u, tan u, ln(1 + u), eᵘ − 1 ∼ u: safe in products and quotients2, 6, 10, 12, 19, 24
Series expansionsexpand to the order of the denominator when terms cancel1, 5, 17
'The limit exists'kill every coefficient below the denominator's order9, 21, 22
Greatest integer, signum, one-sided, inverse-trig domainswhich side does the inside approach? check both sides1, 3, 13, 20
Powers and the 1-to-the-power-∞ forme raised to lim g(f − 1); a base not tending to 1: substitute7, 8
Sequencestelescope, fixed point L = f(L), golden ratio, conjugates4, 14, 16, 25
Shortcutsm/(1 − xᵐ) − n/(1 − xⁿ) → (m − n)/2; power beats log; rationalise roots11, 15, 18, 23

Section I · Multiple choice (Q1–20)

1Series
, where is the greatest integer function, is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. Near 0, , so and . Then .
  2. Top: .
  3. Bottom: , so the bottom .
  4. Limit .

Answer: (2)

2Equivalents / series
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. and , so the top is
  2. , so the limit is .

Answer: (2)

3Greatest integer, domains
Statement I: does not exist, where is the greatest integer function.
Statement II: .
  1. (1) Both statements are true
  2. (2) Statement I is true, Statement II is false
  3. (3) Statement I is false, Statement II is true
  4. (4) Both statements are false
Show solution
  1. Statement I: for , and is undefined; for , and . The two sides don't agree, so the limit does not exist: true.
  2. Statement II: needs its input in , but for every near 0. The function is defined only at itself, so there is no limit: false.
  3. Answer: Statement I true, Statement II false.

A common slip is to substitute and write : always check the domain first.

Answer: (2) Statement I is true, Statement II is false

4Sequences (conjugates)
If are positive integers and , , then is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. The conjugate gives .
  2. So and .
  3. Since , , so and .

Answer: (3)

5Series
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. , so
  2. .
  3. Difference , so the limit is .

Answer: (2)

6Equivalents
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. Top: .
  2. Bottom: .
  3. Limit .

Answer: (1)

7Powers
The sum of all possible values of for which is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. The base doesn't approach 1, so substitute: the limit is .
  2. or .
  3. Sum .

Answer: (1)

8Logs and infinite sums
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. Each nested root halves the exponent again, so the log is .
  2. .
  3. Limit .

Answer: (4)

9Limit exists (orders)
Let be positive integers. If , then is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. , so .
  2. A finite non-zero limit needs .
  3. .

Answer: (3)

10Equivalents
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. ; ; .
  2. Limit .

Answer: (2)

11Roots
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. (Approach from , where the roots are defined.) Top: .
  2. Bottom: , which is much smaller than .
  3. Divide top and bottom by : .

Answer: (4)

12Equivalents ($a^x$)
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. , so .
  2. Squared:
  3. .

Answer: (2)

13Greatest integer, averages
, where is the greatest integer function, is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. .
  2. For , , so every term is slightly less than 1 (and more than 0): each greatest integer is .
  3. The sum is 0, so the limit is .

Answer: (2)

14Telescoping
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. , so the sum telescopes to .
  2. .

Answer: (3)

15Shortcut
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. Put : , so
  2. The terms cancel, leaving (the shortcut).
  3. .

Answer: (2)

16Sequences (ratio)
If is the th term of and , then (greatest integer) is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. Fibonacci: . Dividing by : , so , .
  2. , so .

Answer: (4)

17Series (composite)
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. , so .
  2. .
  3. Difference: . Limit .

Answer: (4)

18Power beats log
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. , so the product behaves like (as , where is defined).
  2. : the power beats the log. Limit .

Answer: (4)

19Series / equivalents
is
  1. (1)
  2. (2)
  3. (3)
  4. (4)
Show solution
  1. with : the top is .
  2. .
  3. Limit .

Answer: (2)

20Mixed
Match Column I with Column II.
(A) (B) (C) (D)
(P) (Q) (R) (S)
  1. (1) A–R, B–S, C–S, D–P
  2. (2) A–S, B–R, C–P, D–Q
  3. (3) A–P, B–Q, C–S, D–R
  4. (4) A–R, B–S, C–P, D–P
Show solution
  1. (A) (power beats log): R.
  2. (B) unless , where it is . Every other term as , so the sum : S.
  3. (C) squeezes to : S.
  4. (D) For near 0: and , so the ratio is : P.
  5. A–R, B–S, C–S, D–P.

Answer: (1) A–R, B–S, C–S, D–P

Section II · Numerical value (Q21–25)

21Limit exists (constants)
If exists and is finite, then is

Numerical answer (integer 0–9999).

Show solution
  1. Bottom: : it starts at .
  2. Top: . Kill the , , terms: , , .
  3. , (the term is already 0).
  4. .

Answer: 72

22Limit exists (constants)
If , then is

Numerical answer (integer 0–9999).

Show solution
  1. The top , so a non-zero limit needs the bottom : . Then the bottom .
  2. ( can be anything).
  3. .

Answer: 2

23Roots / equivalents
is

Numerical answer (integer 0–9999).

Show solution
  1. (The roots need .) , so .
  2. , so , much smaller than .
  3. , so the limit is .

Answer: 1

24Equivalents
is

Numerical answer (integer 0–9999).

Show solution
  1. Rewrite: .
  2. Equivalents: .

Answer: 1

25Sequences (fixed point)
If , , and exists, then is

Numerical answer (integer 0–9999).

Show solution
  1. Let be the limit: .
  2. The terms are positive, so . (This is Newton's method for .)

Answer: 3

Answer key

Show all answers
  1. 1. (2)
  2. 2. (2)
  3. 3. (2)
  4. 4. (3)
  5. 5. (2)
  6. 6. (1)
  7. 7. (1)
  8. 8. (4)
  9. 9. (3)
  10. 10. (2)
  11. 11. (4)
  12. 12. (2)
  13. 13. (2)
  14. 14. (3)
  15. 15. (2)
  16. 16. (4)
  17. 17. (4)
  18. 18. (4)
  19. 19. (2)
  20. 20. (1)
  21. 21. 72
  22. 22. 2
  23. 23. 1
  24. 24. 1
  25. 25. 3