(a) Identify the error and write the correct identity for shifting the index by −1.
(b) Evaluate k=3∑20(k−2) by reindexing to start from k=1, and verify your answer using the formula for the sum of the first N positive integers.
(c) Evaluate n=1∑10n(n+1)−n=2∑11(n−1)2.
[Difficulty: hard. Tests the common error of shifting the index without adjusting the term.]
Solution:
(a) When shifting the index from n to n′=n−1 (so n=n′+1), the bounds change from n=1 to n′=0 and n=5 to n′=4, but the general term must also change. The correct identity is:
∑n=15n=∑n′=04(n′+1)
The student's error was writing ∑n=04n instead of ∑n=04(n+1). The LHS equals 15 but the student's RHS equals 10.
(b) Let j=k−2, so when k=3, j=1, and when k=20, j=18:
∑k=320(k−2)=∑j=118j=218×19=171
Verification: the original sum has 18 terms from 1 to 18, confirming the result.
(b) The expansion (1+x)n for non-integer n converges when ∣x∣<1. Here we have (1−2x)−1/2, so we need ∣−2x∣<1, i.e., ∣x∣<21.
(c) The student computed 2!n(n−1)(−2)2 but used n=−21 incorrectly. The correct computation for the coefficient of x2:
(2−1/2)(−2)2=2(−1/2)(−3/2)×4=23/4×4=83×4=23
The student's error was multiplying three terms instead of two: (2−1/2) only involves two factors 2!n(n−1), not three. The correct coefficient is 23, not −3.
Prove by mathematical induction that 7n−1 is divisible by 6 for all n∈′{′Z′}′+.
A student presents the following proof:
Base case (n=0):70−1=0, which is divisible by 6.
Inductive step: Assume 7k−1=6m. Then 7k+1−1=7⋅7k−1=7(6m+1)−1=42m+6=6(7m+1).
(a) Explain the flaw in the student's base case.
(b) Write out a complete, correct proof.
[Difficulty: hard. Tests the common error of starting the base case at the wrong value for divisibility results.]
Solution:
(a) The statement claims "for all n∈′{′Z′}′+", meaning n≥1. The student verified the base case at n=0, which is outside the domain of the claim. While n=0 does happen to satisfy the property, the proof must start at n=1 to be valid. The base case at n=0 is unnecessary and, if it were the only base case, would not constitute a valid proof of the claim.
(b)
Base case (n=1):71−1=6, which is divisible by 6. True.
Inductive hypothesis: Assume 7k−1=6m for some integer m, where k≥1.
Inductive step: We must show 7k+1−1 is divisible by 6.
7k+1−1=7⋅7k−1=7(6m+1)−1=42m+7−1=42m+6=6(7m+1)
Since 7m+1 is an integer, 7k+1−1 is divisible by 6.
Conclusion: By the principle of mathematical induction, 7n−1 is divisible by 6 for all n∈′{′Z′}′+.
Tests synthesis of number and algebra with other topics.
IT-1: Geometric Series Convergence with Function Notation (with Functions)
Question:
The function f is defined by f(x)=1−x21 for x∈(−1,1).
(a) Express f(x) as the sum of an infinite geometric series, stating the common ratio.
(b) Find the value of n=0∑∞4n1.
(c) The series n=0∑∞3nx2n converges for some values of x. Find the sum to infinity and state the range of x for which it converges.
[Difficulty: hard. Combines geometric series convergence with function domain restrictions.]
Solution:
(a) Using partial fractions:
f(x)=1−x21=(1−x)(1+x)1=21(1−x1+1+x1)
Each fraction is a geometric series:
1−x1=∑n=0∞xnfor ∣x∣<1
1+x1=∑n=0∞(−x)n=∑n=0∞(−1)nxnfor ∣x∣<1
Therefore:
f(x)=21∑n=0∞(1+(−1)n)xn
This gives f(x)=1+x2+x4+x6+⋯, a geometric series with first term 1 and common ratio x2, valid for ∣x2∣<1, i.e., x∈(−1,1).
(b) This is a geometric series with first term 1 and common ratio r=41. Since ∣r∣<1:
S∞=1−411=34
(c) Rewrite as n=0∑∞(3x2)n.
This is a geometric series with first term 1 and common ratio r=3x2.
Convergence requires ∣r∣<1, so 3x2<1, giving x2<3, i.e., −3<x<3.
S∞=1−3x21=3−x23
IT-2: Logarithm Equation with Composite Function Domain (with Functions)
Question:
Given f(x)=log3(x+4) and g(x)=x2−5:
(a) Find (f∘g)(x) and state its domain.
(b) Solve (f∘g)(x)=2.
(c) A student solves the equation log3(x2−1)=2 and obtains x=±10. Explain why one solution must be rejected.
[Difficulty: hard. Combines logarithm domain restrictions with composite function domain analysis.]
Solution:
(a)(f∘g)(x)=f(g(x))=log3(x2−5+4)=log3(x2−1).
Domain restrictions:
From g(x): x∈′{′R′}′ (no restriction, polynomial).
From f: the argument must be positive, so x2−1>0, giving x<−1 or x>1.
Domain of f∘g: (−∞,−1)∪(1,∞).
(b)log3(x2−1)=2⟹x2−1=9⟹x2=10⟹x=±10.
Check against domain: 10≈3.16>1 (valid) and −10≈−3.16<−1 (valid).
Both solutions are valid: x=10 and x=−10.
(c) The student solved log3(x2−1)=2 correctly, but without checking the domain. In this case both solutions are valid. However, if the equation were log3(x−1)=2, solving gives x−1=9⟹x=10, but the domain requires x>1, so x=10 is valid. If instead the equation were log3(1−x)=2, then 1−x=9⟹x=−8, but the domain requires 1−x>0⟹x<1, so x=−8 is valid. The key point is that logarithm arguments must always be positive, and extraneous solutions arise when the algebraic solution violates this constraint.
IT-3: Permutations with Restrictions (with Probability)
Question:
Eight people — Alice, Ben, Charlie, Diana, Elliot, Fiona, George, and Hannah — are to be seated in a row of eight chairs.
(a) In how many ways can they be seated if Alice and Ben must sit next to each other?
(b) In how many ways can they be seated if Alice and Ben must NOT sit next to each other?
(c) In how many ways can they be seated if Alice, Ben, and Charlie must all sit together, and Diana and Elliot must also sit together (but the two groups may be in any order)?
[Difficulty: hard. Tests arrangements with multiple restrictions requiring careful case analysis.]
Solution:
(a) Treat Alice and Ben as a single "block." There are 7 items to arrange: the AB block and the other 6 people.
Number of arrangements of the blocks: 7!=5040.
Within the AB block, Alice and Ben can be arranged in 2!=2 ways.
Total: 7!×2=10080.
(b) Total arrangements without restrictions: 8!=40320.
Arrangements where Alice and Ben sit together: 10080 (from part a).
Arrangements where they do NOT sit together: 40320−10080=30240.
(c) There are two groups: ABC (size 3) and DE (size 2), plus the remaining 3 individuals: F, G, H.
Items to arrange: 2 groups + 3 individuals = 5 items.
Arrangements of the 5 items: 5!=120.
Within the ABC group: 3!=6 arrangements.
Within the DE group: 2!=2 arrangements.