Prove 1+2+...+n=n(n+1)/2 by induction for n≥1.
Answer and explanation
The base n=1 holds. Assuming the formula for n, add n+1 to get n(n+1)/2+(n+1)=(n+1)(n+2)/2.
Credit both the base and valid induction step.
Subjects
Choose questions individually, practise online, or create a worksheet with matching answers. Counts include generated variants, not only authored originals.
The base n=1 holds. Assuming the formula for n, add n+1 to get n(n+1)/2+(n+1)=(n+1)(n+2)/2.
Credit both the base and valid induction step.
15
Each edge contributes two to the degree sum.
11
A finite tree has n−1 edges.
It is even
The degree sum is even, so the sum of odd contributions contains an even number of odd terms.
The desired conclusion is used as a premise. The induction hypothesis must concern a previously established case, typically n.
Credit identifying the unjustified assumption.
32
Each element is independently included or excluded, giving 2^5.
Prove a base case and a step from n to n+1; neither alone suffices.
UniversityProve a base case and a step from n to n+1; neither alone suffices.
UniversityPractise improper integrals, series, gradients and multiple integrals, with explicit conditions and worked examples.
Develop matrix, vector-space and projection reasoning before using least squares.
Connect initial conditions, linear differential equations and numerical approximation with error and conditioning.
Work with conditional probability, normalization, densities and expectation.
Build epsilon proofs and distinguish pointwise convergence, uniform convergence and compactness.
Study groups, vector-space quotients and proof techniques with carefully scoped definitions.
Study complex analysis, residues, Fourier series, PDE boundary conditions and convexity through focused lessons.
Learn descriptive statistics, probability, sampling and inference with worked reasoning.