maths.free › Discrete Math & Logic › Sums and induction
Sums and induction
Closed forms for sums, and how induction proves them.
Σ k = n(n+1)/2 is the formula Gauss found at school; Σ k² and Σ k³ have closed forms too. Induction proves them: check n = 1, then show that if the formula holds for n it holds for n + 1.
Arbejdstxrd eksempel · sum of k for k = 1 to n
Trin for trin
- \sum_{k=1}^{n} k
Write the sum out.
- 1 + 2 + 3 + 4 + \cdots
The first few terms.
- = \frac{n \left(n + 1\right)}{2}
Closed form (a standard summation formula, provable by induction).
Afslør svaret
Nu er du Vælg et problem, eller skriv eller tegne din egen. Hvert skridt, et billede, svaret skjult, indtil du spørger.
En gratis konto tilføjer noter om hver lektion, en rekord over, hvad du har afsluttet, dine løste problemer på ét sted, og en vejleder, du kan spørge om denne side. Matematik selv er åben for alle, logget på eller ej.
Tilmeld dig LoginSymboler brugt her
Tryk på ethvert symbol for den fulde definition, et billede, og hvad hvert bogstav i det betyder.
Hvordan: Sums and induction
- Write the sum out.
- The first few terms.
- Closed form (a standard summation formula, provable by induction).
Spørgsmål folk spørger
What makes mathematics "discrete"?
It deals with separate, countable objects (integers, graphs, statements) rather than continuous quantities. No limits, no infinitesimals; instead induction, counting and logic.
How does a proof by induction work?
Show the statement for the first case, then show that whenever it holds for n it holds for n + 1. Like dominoes: the first falls, and each knocks over the next.
What order should I take these lessons in?
Logic and proof first, because every later lesson proves things. Then induction, sets, relations and functions, counting, recurrences, graphs, Boolean algebra and automata, and finally algorithms and complexity, which use nearly everything before them.
Is discrete mathematics the same as the maths of computer science?
Largely. Data structures are graphs and trees, correctness arguments are induction, running times are recurrences and sums, circuits are Boolean algebra, and what a computer can do efficiently is the subject of the last lessons. It is also ordinary mathematics in its own right.
Do I need calculus for this course?
No. School algebra is enough. A little familiarity with limits helps when comparing growth rates, and the lesson on asymptotic analysis explains the one limit fact it uses.
Mere i Discrete Math & Logic
Truth tablesProof by inductionAlgorithms and growth of functionsPredicate logic and quantifiersDirect proof, contrapositive and contradictionStrong induction and the well-ordering principleRelations: equivalence relations and partial ordersFunctions and cardinalityCounting: rules, choices and bijectionsThe pigeonhole principleSolving linear recurrence relationsGraphs: degrees, paths and connectivityTrees and spanning treesEuler and Hamilton paths