Number and Algebra -- Diagnostic Tests
Number and Algebra — Diagnostic Tests
Unit Tests
Tests edge cases, boundary conditions, and common misconceptions for number and algebra.
UT-1: Sigma Notation Index Shifting Error
Question:
A student writes the following “simplification”:
(a) Identify the error and write the correct identity for shifting the index by .
(b) Evaluate by reindexing to start from And verify your answer using the formula for the sum of the first positive integers.
(c) Evaluate .
[Difficulty: hard. Tests the common error of shifting the index without adjusting the term.]
Solution:
(a) When shifting the index from to (so ), the bounds change from to and to But the general term must also change. The correct identity is:
The student’s error was writing instead of . The LHS equals but the student’s RHS equals .
(b) Let So when k = 3$$j = 1And when k = 20$$j = 18:
Verification: the original sum has 18 terms from to Confirming the result.
(c)
For the second sum, let So when n = 2$$m = 1And when n = 11$$m = 10:
Therefore the difference is .
UT-2: Binomial Theorem with Non-Standard Exponent
Question:
(a) Find the coefficient of in the binomial expansion of .
(b) Determine the exact range of for which the expansion converges.
(c) A student claims that the coefficient of in is . Identify the error and find the correct coefficient.
[Difficulty: hard. Tests binomial expansion with fractional negative exponent, convergence condition, and sign errors.]
Solution:
(a) Using the general binomial expansion with and replacing with :
The general term in is:
For :
So the coefficient of is .
(b) The expansion for non-integer converges when . Here we have So we need I.e., .
(c) The student computed but used incorrectly. The correct computation for the coefficient of :
The student’s error was multiplying three terms instead of two: only involves two factors Not three. The correct coefficient is Not .
UT-3: Proof by Induction with Divisibility
Question:
Prove by mathematical induction that is divisible by for all .
A student presents the following proof:
Base case (): Which is divisible by .
Inductive step: Assume . Then .
(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 ”, meaning . The student verified the base case at Which is outside the domain of the claim. While does happen to satisfy the property, the proof must start at to be valid. The base case at is unnecessary and, if it were the only base case, would not constitute a valid proof of the claim.
(b)
Base case (): Which is divisible by . True.
Inductive hypothesis: Assume for some integer Where .
Inductive step: We must show is divisible by .
Since is an integer, is divisible by .
Conclusion: By the principle of mathematical induction, is divisible by for all .
Integration Tests
Tests synthesis of number and algebra with other topics.
IT-1: Geometric Series Convergence with Function Notation (with Functions)
Question:
The function is defined by for .
(a) Express as the sum of an infinite geometric series, stating the common ratio.
(b) Find the value of .
(c) The series converges for some values of . Find the sum to infinity and state the range of for which it converges.
[Difficulty: hard. Combines geometric series convergence with function domain restrictions.]
Solution:
(a) Using partial fractions:
Each fraction is a geometric series:
Therefore:
This gives A geometric series with first term and common ratio Valid for I.e., .
(b) This is a geometric series with first term and common ratio . Since :
(c) Rewrite as .
This is a geometric series with first term and common ratio .
Convergence requires So Giving I.e., .
IT-2: Logarithm Equation with Composite Function Domain (with Functions)
Question:
Given and :
(a) Find and state its domain.
(b) Solve .
(c) A student solves the equation and obtains . Explain why one solution must be rejected.
[Difficulty: hard. Combines logarithm domain restrictions with composite function domain analysis.]
Solution:
(a) .
Domain restrictions:
- From : (no restriction, polynomial).
- From : the argument must be positive, so Giving or .
Domain of : .
(b) .
Check against domain: (valid) and (valid).
Both solutions are valid: and .
(c) The student solved correctly, but without checking the domain. In this case both solutions are valid. However, if the equation were Solving gives But the domain requires So is valid. If instead the equation were Then But the domain requires So 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 items to arrange: the AB block and the other people.
Number of arrangements of the blocks: .
Within the AB block, Alice and Ben can be arranged in ways.
Total: .
(b) Total arrangements without restrictions: .
Arrangements where Alice and Ben sit together: (from part a).
Arrangements where they do NOT sit together: .
(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: .
Within the ABC group: arrangements. Within the DE group: arrangements.
Total: .