Distilling Ideas: An Introduction to Mathematical Thinking by Michael Starbird, Brian P. Katz

By Michael Starbird, Brian P. Katz

Mathematics isn't a spectator activity: winning scholars of arithmetic grapple with principles for themselves. Distilling Ideas offers a gently designed series of workouts and theorem statements that problem scholars to create proofs and ideas. As scholars meet those demanding situations, they realize techniques of proofs and techniques of considering past arithmetic. so as phrases, Distilling Ideas is helping its clients to enhance the abilities, attitudes, and behavior of brain of a mathematician and to benefit from the strategy of distilling and exploring rules.

Distilling Ideas is a perfect textbook for a primary proof-based path. The textual content engages the variety of students' personal tastes and aesthetics via a corresponding number of attention-grabbing mathematical content material from graphs, teams, and epsilon-delta calculus. every one subject is on the market to clients with no historical past in summary arithmetic as the thoughts come up from asking questions about daily event. all of the universal facts buildings turn out to be ordinary options to real wishes. Distilling Ideas or any subset of its chapters is a perfect source both for an geared up Inquiry established studying path or for person examine.

A pupil reaction to Distilling Ideas: "I suppose that i've got grown extra as a mathematician during this type than in the entire different sessions I've ever taken all through my educational life."

Show description

Read or Download Distilling Ideas: An Introduction to Mathematical Thinking (Mathematics Through Inquiry) PDF

Similar mathematics books

Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

A gradual advent to the hugely refined global of discrete arithmetic, Mathematical difficulties and Proofs provides themes starting from trouble-free definitions and theorems to complex subject matters -- akin to cardinal numbers, producing capabilities, houses of Fibonacci numbers, and Euclidean set of rules.

Graphs, matrices, and designs: Festschrift in honor of Norman J. Pullman

Examines walls and covers of graphs and digraphs, latin squares, pairwise balanced designs with prescribed block sizes, ranks and permanents, extremal graph concept, Hadamard matrices and graph factorizations. This ebook is designed to be of curiosity to utilized mathematicians, desktop scientists and communications researchers.

Elementare Analysis: Von der Anschauung zur Theorie (Mathematik Primar- und Sekundarstufe) (German Edition)

In diesem Lehrbuch finden Sie einen Zugang zur Differenzial- und Integralrechnung, der ausgehend von inhaltlich-anschaulichen Überlegungen die zugehörige Theorie entwickelt. Dabei entsteht die Theorie als Präzisierung und als Überwindung der Grenzen des Anschaulichen. Das Buch richtet sich an Studierende des Lehramts Mathematik für die Sekundarstufe I, die „Elementare research" als „höheren Standpunkt" für die Funktionenlehre benötigen, Studierende für das gymnasiale Lehramt oder in Bachelor-Studiengängen, die einen sinnstiftenden Zugang zur research suchen, und an Mathematiklehrkräfte der Sekundarstufe II, die ihren Analysis-Lehrgang stärker inhaltlich als kalkülorientiert gestalten möchten.

Extra resources for Distilling Ideas: An Introduction to Mathematical Thinking (Mathematics Through Inquiry)

Sample text

Notice that in our original definition of a walk, the beginning and ending vertices had no restrictions, so they could actually have been the same vertex. So now we define a special walk that does start and end at the same vertex and has no repeated edges. 8. A circuit is a walk with at least one edge that begins and ends at the same vertex and never uses the same edge twice. 26. V; E/, the K¨onigsberg Bridge Problem graph. Find at least one circuit that contains at least one repeated vertex (other than the initial/final vertex).

13. Let G be a graph. Then a subtree T of G is a maximal tree if and only if for any edge of G not in T , adding it to T produces a subgraph that is not a tree. 5. W [ fvg [ fwg; F [ feg/ is not a tree. 45. A subtree T in a connected graph G is a maximal tree if and only if T contains every vertex of G. 5 Planarity Earlier, we ran across the issue of whether we could draw a graph in the plane without having edges cross. If a graph can be drawn without edges crossing, we can often use geometric insights to deduce features about the graph.

You can put the Sternbucks anywhere you like; try several locations. Does the starting place affect the answer? If we can trace one visual representation of the K¨onigsberg Bridge graph, we can trace any correct representation, which is why we can abuse language and talk about the (visual representation of the) graph when working on this problem. V; E/. 16. V; E/, without reference to a visual representation of K. The K¨onigsberg Bridge Problem was modeled by a graph, and its challenge was described in terms of a tracing problem.

Download PDF sample

Rated 4.84 of 5 – based on 28 votes