maths.free › Combinatorics & Graph Theory › Induction › The Meaning of Statements
The Meaning of Statements
Have you ever taken standardized tests where they give you the first few terms of a sequence and then ask you for the next one? Here are some sample questions.
The Meaning of Statements
Have you ever taken standardized tests where they give you the first few terms of a sequence and then ask you for the next one? Here are some sample questions. In each case, see if you can determine a reasonable answer for the next term.
- \(2,5,8,11,14,17,20,23,26,\dots\)
- \(1,1,2,3,5,8,13,21,34,55,89,144,233,377,\dots\)
- \(1,2,5,14,42,132,429,1430,4862,\dots\)
- \(2,6,12,20,30,42,56,72,90,110,\dots\)
- \(2,3,6,11,18,27,38,51,\dots\)
Pretty easy stuff! OK, now try the following somewhat more challenging sequence. Here, we'll give you a lot more terms and challenge you to find the next one. \[\begin{aligned}\end{aligned}\] Trust us when we say that we really have in mind something very concrete, and once it's explained, you'll agree that it's obvious. But for now, it's far from it.
Here's another danger lurking around the corner when we encounter formulas like \[\begin{aligned}\end{aligned}\] What do the dots in this statement mean? In fact, let's consider a much simpler question. What is meant by the following expression: \[\begin{aligned}\end{aligned}\] Are we talking about the sum of the first six positive integers, or are we talking about the sum of the first\(19\) terms from the more complicated challenge sequence given above? You are supposed to answer that you don't know, and that's the correct answer.
The point here is that without a clarifying comment or two, the notation \(1+2+3+\dots+6\) isn't precisely defined. Let's see how to make things right.
First, let \(f:\posints\longrightarrow\posints\) be a function. Set \[\begin{aligned}\end{aligned}\] and if \(n>1\), define \[\begin{aligned}\end{aligned}\] To see that these two statements imply that the expression \(\sum_{i=1}^nf(i)\) is defined for all positive integers, apply the Well Ordered Property to the set of all positive integers for which the expression is not defined and use the recursive definition to define it for the least element.
So if we want to talk about the sum of the first six positive integers, then we should write: \[\begin{aligned}\end{aligned}\] Now it is clear that we are talking about a computation that yields\(21\) as an answer.
A second example: previously, we defined \(n!\) by writing \[\begin{aligned}\end{aligned}\] By this point, you should realize that there's a problem here. Multiplication, like addition, is a binary operation. And what do those dots mean? Here's a way to do the job more precisely. Define \(n!\) to be \(1\) if \(n=1\). And when \(n>1\), set \(n! = n(n-1)!\).
Condensed: the full section is in Keller & Trotter, Applied Combinatorics.
Tani ti. Asnjë kalkulator nuk e zgjidh këtë, por pjesët e saj janë të llogaritura. Provo një më poshtë, ose shkruaj tënde.
Një llogari e lirë shtohet shënime në çdo mësim, një regjistrim të asaj që ju keni përfunduar, problemet tuaja të zgjidhura në një vend, dhe një mësues që ju mund të pyesni rreth kësaj faqeje. Matematika vetë është e hapur për të gjithë, të regjistruar apo jo.
Regjistrohu HyrSimbolet e përdorura këtu
Prek çdo simbol për përkufizimin e plotë, një fotografi dhe se çfarë do të thotë çdo shkronjë në të.
Pyetja që bëjnë njerëzit
Permutation or combination?
Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).
What is a graph in this sense?
Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.
Pjesa e kësaj faqeje është adaptuar nga Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). E përmbledhur dhe ri-shkruar këtu; gabimet janë tona.
Më shumë në Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs