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.

  1. \(2,5,8,11,14,17,20,23,26,\dots\)
  2. \(1,1,2,3,5,8,13,21,34,55,89,144,233,377,\dots\)
  3. \(1,2,5,14,42,132,429,1430,4862,\dots\)
  4. \(2,6,12,20,30,42,56,72,90,110,\dots\)
  5. \(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.

이제 너 계산기는 이것을 해결하지 않지만, 그 조각은 계산 가능합니다. 아래의 하나를 시도하거나 자신의 것을 입력하십시오.

자신의 작업을 유지

무료 계정은 모든 수업에 노트를 추가, 당신이 완료 한 기록, 당신이 해결 한 문제를 한 곳에, 그리고 당신이이 페이지에 대해 물어 수업 지도자. 수학 자체는 모두에게 열려 있습니다, 로그인 여부.

가입하기 로그인

여기서 사용된 기호

기호를 탭하면 전체 정의, 이미지 및 각 문자의 의미를 확인할 수 있습니다.

사람들이 묻는 질문

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.

이 페이지의 일부는 다음에서 변경되었습니다. Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). 여기서 압축하고 다시 설명; 오류는 우리의.

에 더 Combinatorics & Graph Theory