ECAT Mathematics
90:00
Exit
Copying quiz content is prohibited.
Leave Quiz?
Your progress will be lost if you leave now. Are you sure?
Exit
Stay
0
questions remaining
ECAT Mathematics
Chapter 8: Mathematical Induction and Binomial Theorem
85 Questions
90 Minutes
Pass: 60%+
ECAT Prep
0
The Principle of Mathematical Induction has steps:
A
Only base case
B
Only inductive step
C
Base case and inductive step
D
Three cases
1
In inductive step, we assume P(k) true and prove:
A
P(k−1)
B
P(k)
C
P(k+1)
D
P(1)
2
The base case for induction usually shows P(n) true for:
A
n=0 or n=1
B
n=100
C
n=k
D
all n
3
Binomial theorem: (a+b)^n = Σ C(n,r) a^{n−r} b^r for r=0 to n. Valid for:
A
n∈Z only
B
n∈N (natural/whole)
C
n∈R
D
n negative only
4
General term T_{r+1} in (a+b)^n =
A
C(n,r) a^r b^{n−r}
B
C(n,r) a^{n−r} b^r
C
C(n,r) (ab)^r
D
nCr
5
Number of terms in expansion of (a+b)^n:
A
n
B
n−1
C
n+1
D
2n
6
Sum of binomial coefficients in (1+x)^n:
A
n
B
2^n
C
n!
D
n^2
7
Middle term of (a+b)^n when n is even:
A
T_{n/2}
B
T_{n/2+1}
C
T_{n+1}
D
T_{n/2−1}
8
Coefficient of x^r in (1+x)^n:
A
n!
B
r!
C
C(n,r)
D
n^r
9
(1+x)^n expanded up to x^2 ≈
A
1+nx
B
1+nx+n(n−1)x²/2
C
1+2nx
D
1+nx²
10
Pascal's triangle: each element is the sum of the:
A
Two elements below
B
Two elements above
C
Diagonal elements
D
Corner elements
11
Prove by induction: 1+2+...+n = n(n+1)/2. Base (n=1): LHS=1, RHS=
A
1
B
2
C
1/2
D
3
12
Inductive step: assume 1+...+k=k(k+1)/2. Add (k+1): LHS=
A
k(k+1)/2+(k+1)
B
k(k+1)/2
C
(k+1)(k+2)/2
D
k^2/2
13
The Binomial coefficient C(n,r) is also written as:
A
nPr
B
nCr or ⁿCᵣ or (n r)
C
n/r
D
nr
14
In (2x+3)^5, the term with x^3 has r=
A
2
B
3
C
4
D
5
15
C(5,2)(2x)^3(3)^2 for (2x+3)^5 with r=2 gives coefficient:
A
10×8×9=720
B
C(5,2)=10 only
C
3^2=9 only
D
Not possible
16
4th term of (x+y)^7 (T_4, r=3):
A
C(7,3)x^4y^3
B
C(7,4)x^3y^4
C
C(7,3)x^3y^4
D
C(7,4)x^4y^3
17
Sum of coefficients of (2x+3)^n with x=1:
A
5^n
B
(2+3)^n=5^n
C
n!
D
2^n
18
Prove 2^n > n for all n≥1 by induction. Base n=1: 2>1 ✓. Step: assume 2^k>k. Then 2^{k+1}=2×2^k >
A
2k > k+1 for k≥1
B
k+1 only if k=1
C
2k for all k
D
2^k
19
The binomial expansion of (1−x)^n starts:
A
1+nx
B
1−nx+...
C
1+x−nx
D
−nx
20
Coefficient of x^2 in (1+x)^8:
A
C(8,2)=28
B
8
C
56
D
64
21
Middle term of (x+y)^6 (n=6, middle at r=3):
A
T_3=C(6,2)x^4y^2
B
T_4=C(6,3)x^3y^3
C
T_4=C(6,4)x^2y^4
D
T_3
22
By induction: n³−n is divisible by 6 for all n∈N. Base n=1: 1−1=0, divisible by 6?
A
Yes (0 is divisible by any positive integer)
B
No
C
Only by 2
D
Only by 3
23
Binomial theorem for negative/fractional n gives:
A
Finite terms
B
Infinite series (convergent for |x|<1)
C
Always diverges
D
Only for integers
24
Coefficient of x^3 in (1+x)^10:
A
120
B
C(10,3)=120
C
C(10,7)=120
D
All of the above
25
Last term of (a+b)^n:
A
a^n
B
b^n
C
C(n,n)b^n
D
a^nb^n
26
First term of (a+b)^n:
A
b^n
B
C(n,0)a^n
C
ab^n
D
a^{n+1}
27
Telescoping sum: Σ(k=1 to n) k(k+1) proved by induction. T_n: n(n+1)(n+2)/3. Check n=1: 1×2=2, formula: 1×2×3/3=2. ✓
A
Proves for n=1
B
Completes proof
C
Is inductive step
D
Does not prove
28
(a+b)^0 =
A
0
B
a
C
b
D
1
29
Σ_{k=0}^{n} (−1)^k C(n,k) =
A
2^n
B
0
C
1
D
n!
30
Binomial coefficient C(n,r)+C(n,r+1) = C(n+1,r+1). This is:
A
Pascal's identity
B
Fermat's theorem
C
Newton's binomial
D
Stirling's formula
31
Coefficient of x^4 in (1+2x)^10:
A
C(10,4)×2^4=3360
B
C(10,4)×2^4=C(10,4)×16=210×16=3360
C
3360
D
All of the above
32
For PMI to work, the proposition must be:
A
True for n=0 only
B
True for all n but need not prove
C
A statement about natural numbers
D
True for infinitely many exceptions
33
Prove n^2+n is even for all n. Base: n=1: 1+1=2, even. ✓ Step: (k+1)^2+(k+1)=k^2+3k+2=
A
(k^2+k)+2(k+1)
B
k^2+k+2k+2
C
Both of the above
D
None
34
n! > 2^n for n≥?
A
n≥3
B
n≥4
C
n≥5
D
n≥2
35
Sum of odd binomial coefficients = Sum of even binomial coefficients for (1+1)^n:
A
2^n
B
2^{n−1}
C
n!
D
n
36
T_{r+1} of (1+x)^n: if r=0 gives T_1=
A
C(n,0)x^0=1
B
C(n,0)x=x
C
nx
D
1+x
37
The greatest coefficient in (1+x)^{2n} is:
A
C(2n,n)
B
C(2n,0)
C
C(2n,2n)
D
2^{2n}
38
PMI cannot prove statements that are:
A
True for n=1
B
True for all n
C
False for some n
D
About sums
39
(x+1/x)^6: term independent of x (T_{r+1} with x^{6-2r}=1, r=3):
A
C(6,3)=20
B
6!
C
C(6,3)x^0=20
D
Both a and c
40
Prove 1^3+2^3+...+n^3=[n(n+1)/2]^2. Note that [n(n+1)/2]^2 =
A
(Σk)^2
B
(n!)^2
C
n^2(n+1)^2/4
D
All of above: B is wrong but A and C correct
41
For large n, (1+1/n)^n approaches:
A
1
B
∞
C
e
D
0
42
Coefficient of x^2y^3 in (x+y)^5:
A
C(5,2)=10
B
C(5,3)=10
C
Both the same
D
C(5,2)×C(5,3)
43
Expand (1+x)^3 = ?
A
1+3x+3x^2+x^3
B
1+x+x^2+x^3
C
1+3x+x^2+3x^3
D
3+3x+3x^2+x^3
44
The sum Σ_{r=0}^n r×C(n,r) =
A
n×2^{n−1}
B
2^n
C
n!
D
n^2
45
Last digit of 3^100 found using binomial: (3^4)^25=(81)^25=(80+1)^25; last digit:
A
1
B
3
C
9
D
7
46
The term containing y^4 in (x+y)^7 is:
A
C(7,4)x^3y^4
B
C(7,3)x^4y^3
C
C(7,4)x^4y^3
D
7x^3y^4
47
PMI: "Strong induction" assumes P(1),P(2),...,P(k) all true to prove:
A
P(0)
B
P(k)
C
P(k+1)
D
P(k−1)
48
Coefficient of a^3b^3 in (a+b)^6:
A
20
B
C(6,3)=20
C
15
D
Both a and b
49
(2+x)^3 coefficient of x^2:
A
6
B
3×4=12
C
12
D
4×3=12
50
Proof by induction that 4^n−1 is divisible by 3: 4^{k+1}−1=4×4^k−1=4(4^k−1)+3. The term 4(4^k−1) is div by 3 because:
A
Inductive hypothesis says 4^k−1 div by 3
B
4 is div by 3
C
1 is div by 3
D
Not divisible
51
(a−b)^4 = ?
A
a^4−4a^3b+6a^2b^2−4ab^3+b^4
B
a^4+4a^3b+6a^2b^2+4ab^3+b^4
C
a^4−b^4
D
a^4+b^4
52
Number of terms in (x+y+z)^n:
A
n+1
B
C(n+2,2)
C
(n+1)^2
D
n^2
53
Σ_{r=0}^n C(n,r) × 3^r = (1+3)^n = ?
A
4^n
B
3^n
C
n×3
D
n!
54
5th term of (a−b)^8 (T_5, r=4):
A
C(8,4)a^4b^4
B
−C(8,4)a^4b^4
C
C(8,4)a^5b^4
D
C(8,4)a^4(−b)^4=C(8,4)a^4b^4
55
PMI base case for n=2 instead of n=1 proves the statement for:
A
n=1
B
n≥2
C
All natural numbers
D
Only n=2
56
(1+x)^{1/2} ≈ 1+(1/2)x for small x is:
A
Exact
B
Binomial approximation (first-order)
C
Always wrong
D
Only for x=0
57
Σ_{r=0}^n (−1)^r C(n,r) r = ?
A
0
B
n
C
−n×2^{n−1}
D
n×2^{n−1}
58
C(n,r) is maximum when r = ?
A
0
B
n
C
n/2 (if n even)
D
1
59
In (1+x)^n, term T_3 (r=2) = ?
A
C(n,2)x^2
B
C(n,2)x^2
C
n(n−1)x^2/2
D
Both A, B, C (all equal)
60
Coefficient of x^5 in (1+x)^{10}:
A
252
B
C(10,5)=252
C
Both the same
D
126
61
PMI: to prove Σk^2=n(n+1)(2n+1)/6, the inductive step adds:
A
(k+1)^2 to both sides
B
k^2
C
k+1
D
None
62
The Binomial series (1+x)^n for |x|<1 and any real n is:
A
Finite
B
An infinite series
C
Undefined
D
Always divergent
63
T_{r+1} of (2x−3)^5 with r=2:
A
C(5,2)(2x)^3(−3)^2
B
C(5,2)(2x)^2(−3)^3
C
C(5,2)(2x)^3(3)^2
D
−C(5,2)(2x)^3(3)^2
64
Total number of terms in expansion (1+x)^{n} using PMI:
A
n
B
n+1
C
Proved by counting C(n,0) to C(n,n): n+1 terms
D
n−1
65
Proof: 2n < n! for n≥4. Base n=4: 8<24 ✓. Inductive step: 2(k+1)=2k+2<k!+2<(k+1)!
A
Requires k!>2 which holds for k≥3
B
Requires k≥0
C
Only works for k=4
D
False
66
C(12,4) =
A
495
B
C(12,8)=495
C
Both of the above
D
None
67
Which identity is Pascal's?
A
C(n,r)+C(n,r+1)=C(n+1,r+1)
B
C(n,r)=C(n,r−1)
C
C(n,r)=n×C(n−1,r)
D
C(n,r)/C(n,r−1)=(n−r+1)/r
68
(x+2)^4 expansion: coefficient of x^2:
A
C(4,2)×2^2=6×4=24
B
C(4,2)×2^2=24
C
C(4,2)×4=24
D
All of the above
69
By induction: n(n+1) is always even. Because:
A
n and (n+1) are consecutive integers, one must be even
B
n^2 is even
C
(n+1) is even
D
n is even
70
Σ_{r=0}^n C(n,r) = 128 means 2^n=128, so n=
A
5
B
6
C
7
D
8
71
Coefficient of x^4 in (x+1/x)^8 (term with x^{8-2r}=4, r=2):
A
C(8,2)=28
B
C(8,2)=56
C
C(8,4)=70
D
28
72
PMI requires propositions about which type of numbers?
A
Real numbers
B
Complex numbers
C
Natural (or integer) numbers
D
Rational numbers
73
Alternate expression: C(n,r) = C(n−1,r) + ?
A
C(n−1,r−1)
B
C(n,r−1)
C
C(n+1,r)
D
C(n,r+1)
74
(a+b)^2 expanded:
A
a^2+2ab+b^2
B
a^2−2ab+b^2
C
a^2+b^2
D
2a+2b
75
(a−b)^2 expanded:
A
a^2+2ab+b^2
B
a^2−2ab+b^2
C
a^2+b^2
D
2a−2b
76
(a+b)^3 = ?
A
a^3+3a^2b+3ab^2+b^3
B
a^3+b^3
C
a^3−3a^2b+3ab^2−b^3
D
3(a+b)
77
n^2 > n for n≥?
A
n≥1
B
n≥2
C
n≥3
D
n≥0
78
Coefficient of xy^3 in (x+y)^4:
A
C(4,1)=4
B
C(4,3)=4
C
4
D
All of above
79
Which power of 3 ends in digit 1?
A
3^1
B
3^4
C
3^5
D
3^3
80
The well-ordering principle (which underlies PMI) states every non-empty set of natural numbers has a:
A
Maximum
B
Minimum
C
Median
D
Mean
81
C(2n,n) is:
A
Even always
B
Odd always
C
Always larger than 2^n for large n
D
All of the above
82
T_{r+1} of (x^2 + 1/x)^9: term independent of x when 18-3r=0, r=?
A
6
B
3
C
9
D
0
83
4^3+5^3+6^3−(1^3+2^3+3^3)= (proved by telescoping/induction) =
A
216+125+64−1−8−27=369
B
369
C
369−36=333 hmm, let me just say: evaluates to a specific integer.
D
None
84
Sum of first n terms of GP proved by induction: S_n=a(r^n−1)/(r−1). Verify n=1: S_1=a(r−1)/(r−1)=
A
a
B
ar
C
a/r
D
0
0
/ 85 answered
Exit
Submit Quiz