Back to MATHEMATICAL INDUCTION
Your Progress
0 / 121 Answered
0
Correct
0
Incorrect
0%
Accuracy
JEE • MATHEMATICS • MATHEMATICAL INDUCTION
Mathematical induction practice · Mixed difficulty
Choose an answer to check it, or open “View answer” to study the explanation. Sign in to save progress to your account.
Practice format and chapter quiz
These sets use single-correct-answer MCQs. They do not cover every JEE Main or JEE Advanced question format and are not full-length mock papers.
Take a chapter quiz →
Showing 31-60 of 121 questions
Preparing practice and saved progress…
31
Easy
31 of 121
Understanding
+4 | -1
A student was asked to prove a statement by induction. He proved that is true whenever is true for all and also that is true. On the basis of this he could conclude that is true
View answer and explanation
Correct option: C
for all
Option C (for all ) is correct because the base case is P(5) and the inductive step holds for k > 5, meaning it holds for all n greater than or equal to 5.
32
Medium
32 of 121
Application
+4 | -1
If is a positive integer, then is divisible by :
View answer and explanation
Correct option: C
11
Option C (11) is correct because the expression is divisible by 11 for all positive integers n, which can be proven using mathematical induction.
33
Easy
33 of 121
Analyzing
+4 | -1
Let denotes the statement that is odd. It is seen that is true for all
View answer and explanation
Correct option: D
None of these
Option D (None of these) is correct because is always even, not odd, so the statement is never true.
34
Medium
34 of 121
Understanding
+4 | -1
Let . Then which of the following is true
View answer and explanation
Correct option: B
Option B () is correct because even though S(1) is not true, the implication from S(K) to S(K+1) holds, meaning if S(K) were true, then S(K+1) would also be true.
35
Medium
35 of 121
Application
+4 | -1
Statement is true for .
View answer and explanation
Correct option: C
5
Option C (5) is correct because for , the inequality holds true, and it's the smallest integer value that satisfies this condition.
36
Medium
36 of 121
Application
+4 | -1
Statement is divisible by
View answer and explanation
Correct option: C
7
Option C is correct. Using mathematical induction, it can be shown that the expression 3(2n+1) + 2(n-1) is divisible by 7 for all n in N.
37
Medium
37 of 121
Application
+4 | -1
Solution of is
View answer and explanation
Correct option: B
Option B () is correct because solving the inequality involves considering different cases based on the signs of and , and the solution is the intersection of the solutions from each case.
38
Medium
38 of 121
Application
+4 | -1
The least positive integer which makes is _____, where [ ] is the greatest integer function.
View answer and explanation
Correct option: C
3
Option C is correct. By testing values of n starting from 1, we find that n=3 is the least positive integer that satisfies the inequality n! < [(n+1)/2]^n.
39
Easy
39 of 121
Application
+4 | -1
is divisible by
View answer and explanation
Correct option: C
9
Option C (9) is correct because when is substituted into the expression , the result is 873, which is divisible by 9.
40
Medium
40 of 121
Analyzing
+4 | -1
Let Then, which of the following is true?
View answer and explanation
Correct option: B
Option B () is correct because if we assume is true, we can show that is also true.
41
Medium
41 of 121
Application
+4 | -1
Let the number leave the remainder when divided by 3 and when divided by 7 . Then is equal to
View answer and explanation
Correct option: C
5
Option C (5) is correct because by finding the remainders when divided by 3 and 7, and then calculating , the result is 5.
42
Easy
42 of 121
Application
+4 | -1
If is divisible by , if is
View answer and explanation
Correct option: A
A positive integer
Option A (A positive integer) is correct because is divisible by for all positive integers n.
43
Easy
43 of 121
Analyzing
+4 | -1
Statement I:- P(n) is a true statement if is true for where equal to set of natural numbers
Statement II:- Any statement is true by the principle of finite mathematical
induction. Where set of natural numbers
Statement II:- Any statement is true by the principle of finite mathematical
induction. Where set of natural numbers
View answer and explanation
Correct option: C
I is true, II is true and is a correct explanation for I
I is false, II is true. The principle of mathematical induction applies only to natural numbers, not to all real numbers greater than or equal to 1.
44
Medium
44 of 121
Analyzing
+4 | -1
Let is an even integer. If is assumed true is true. Therefore, is true
View answer and explanation
Correct option: D
None of these
Option D (None of these) is correct because the statement P(n) is not true for n=1, thus the principle of mathematical induction cannot be applied.
45
Easy
45 of 121
Application
+4 | -1
If is a positive integer, then isdivisible by
View answer and explanation
Correct option: D
576
Option D (576) is correct because when n=1, the expression evaluates to 576, and when n=2, it evaluates to a multiple of 576.
Explore Other Chapters in MATHEMATICS
View All →
46
Medium
46 of 121
Application
+4 | -1
For all , find
View answer and explanation
Correct option: A
Option A () is correct because the sum can be simplified using partial fraction decomposition and mathematical induction.
47
Easy
47 of 121
Understanding
+4 | -1
The number are distinct rational numbers and ) is always divisible by
View answer and explanation
Correct option: A
Option A () is correct because can be factored as , making it always divisible by .
48
Medium
48 of 121
Application
+4 | -1
will be divisible by
View answer and explanation
Correct option: C
7
Option C (7) is correct because is divisible by 7 for all n in N.
49
Medium
49 of 121
Analyzing
+4 | -1
Let and , where and has least value. Then
View answer and explanation
Correct option: D
is divisible by
Option D ( is divisible by ) is correct because when the given expression is simplified and the values of A, B, and D are substituted, the condition holds true.
50
Medium
50 of 121
Application
+4 | -1
The number of integral roots of the equation is
View answer and explanation
Correct option: C
2
The correct answer is C (2) because solving the absolute value equation in different intervals yields two integral roots: -8 and 2.
51
Medium
51 of 121
Application
+4 | -1
The sum of brackets is equal to
View answer and explanation
Correct option: B
Option B () is correct because it correctly sums the series of sums of squares.
52
Easy
52 of 121
Application
+4 | -1
has _____ at unit's place for .
View answer and explanation
Correct option: B
6
Option B is correct. For n > 1, 2(2^n) always has 6 at the unit's place, as demonstrated by induction.
53
Medium
53 of 121
Application
+4 | -1
A company manufactures cassettes. Its cost and revenue functions are and , respectively, where is the number of cassettes produced and sold in a week. The number of cassettes must be sold by the company to realise some profit, is
View answer and explanation
Correct option: A
More than 2000
Option A (More than 2000) is correct because the profit function, calculated as Revenue - Cost, must be greater than zero. Solving the inequality leads to x > 2000.
54
Easy
54 of 121
Application
+4 | -1
For all is divisible by
View answer and explanation
Correct option: D
15
Option D (15) is correct because for all is divisible by 15. This can be verified by testing a few values of n.
55
Medium
55 of 121
Analyzing
+4 | -1
is equal to
View answer and explanation
Correct option: B
Option B () is correct because it represents the sum of the given series after applying algebraic manipulations and summation formulas.
56
Easy
56 of 121
Application
+4 | -1
If is a positive integer, then isdivisible by
View answer and explanation
Correct option: D
576
Option D (576) is correct because the expression is always divisible by 576 for positive integers n.
57
Medium
57 of 121
Analyzing
+4 | -1
terms is equal to
View answer and explanation
Correct option: A
Option B () is correct because substituting n=1 into the expression yields the first term of the series, 3/4.
58
Medium
58 of 121
Application
+4 | -1
If , then is divisible by
View answer and explanation
Correct option: C
133
Option C (133) is correct because when n=1, equals 3059, which is divisible by 133.
59
Easy
59 of 121
Application
+4 | -1
For all is divisible by
View answer and explanation
Correct option: D
2304
Option D (2304) is correct because is divisible by which equals 2304.
60
Medium
60 of 121
Application
+4 | -1
upto terms is equal to
View answer and explanation
Correct option: B
Option B is correct because substituting n=1 into the expression yields the correct sum, and the formula is derived by finding the general term and summing the geometric progression.
Revision notes and key takeaways
Review MATHEMATICAL INDUCTION in your textbook or class notes, then use this set to check your understanding.
Showing 31-60 of 121 questions
