Discrete Math Quiz
20 questions · no time limit
0:00
PROBLEM-SOLVING & DISCRETE MODELING
Question 1 of 20
No time limit
Current
Answered
Flagged
Not seen
A proof by induction claims that ∑i=1ni2=6n(n+1)(2n+1) for all positive integers n. In the inductive step, a student writes: "Assume the formula holds for k. Then ∑i=1k+1i2=∑i=1ki2+(k+1)2=6k(k+1)(2k+1)+(k+1)2." What additional verification is needed to complete the proof?
YOUR PROGRESS
20
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end