Bild 1 von 1
Galerie
Bild 1 von 1
Ähnlichen Artikel verkaufen?
Handbuch der mathematischen Induktion: Theorie und Anwendungen
by Gunderson, David S. | HC | VeryGood
US $73,50
Ca.CHF 58,43
Artikelzustand:
“May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend ”... Mehr erfahrenÜber den Artikelzustand
Sehr gut
Buch, das nicht neu aussieht und gelesen wurde, sich aber in einem hervorragenden Zustand befindet. Der Einband weist keine offensichtlichen Beschädigungen auf. Bei gebundenen Büchern ist der Schutzumschlag vorhanden (sofern zutreffend). Alle Seiten sind vollständig vorhanden, es gibt keine zerknitterten oder eingerissenen Seiten und im Text oder im Randbereich wurden keine Unterstreichungen, Markierungen oder Notizen vorgenommen. Der Inneneinband kann minimale Gebrauchsspuren aufweisen. Minimale Gebrauchsspuren. Genauere Einzelheiten sowie eine Beschreibung eventueller Mängel entnehmen Sie bitte dem Angebot des Verkäufers.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
Kostenlos Economy Shipping.
Standort: Aurora, Illinois, USA
Lieferung:
Lieferung zwischen Fr, 10. Okt und Fr, 17. Okt nach 94104 bei heutigem Zahlungseingang
Rücknahme:
30 Tage Rückgabe. Verkäufer zahlt Rückversand.
Zahlungen:
Sicher einkaufen
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:197691662388
Artikelmerkmale
- Artikelzustand
- Sehr gut
- Hinweise des Verkäufers
- Binding
- Hardcover
- Book Title
- Handbook of Mathematical Induction
- Weight
- 1 lbs
- Product Group
- Book
- IsTextBook
- No
- ISBN
- 9781420093643
Über dieses Produkt
Product Identifiers
Publisher
CRC Press LLC
ISBN-10
1420093649
ISBN-13
9781420093643
eBay Product ID (ePID)
69630879
Product Key Features
Number of Pages
921 Pages
Publication Name
Handbook of Mathematical Induction : Theory and Applications
Language
English
Subject
Operating Systems / General, General, Cognitive Psychology & Cognition, Logic, Set Theory
Publication Year
2010
Type
Textbook
Subject Area
Mathematics, Philosophy, Computers, Psychology
Series
Discrete Mathematics and Its Applications Ser.
Format
Hardcover
Dimensions
Item Height
2.1 in
Item Weight
61.7 Oz
Item Length
10 in
Item Width
7.4 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2010-029756
Dewey Edition
23
Reviews
Gunderson started out collecting some induction problems for discrete math students and then couldn't stop himself, thereafter assembling more than 750 of the addictive things for this handbook and supplementing them with a grounding in theory and discussion of applications. He offers 500-plus complete solutions, and many of the other problems come with hints or references; unlike other treatments, this handbook treats the subject seriously and is not just a collection of recipes ". It "s a book that will work well with most math or computing science courses, on a subject that pertains to graph theory, point set topology, elementary number theory, linear algebra, analysis, probability theory, geometry, group theory, and game theory, among many other topics. "SciTech Book News, February 2011 a unique work the ostensibly narrow subject of mathematical induction is carefully and systematically expounded, from its more elementary aspects to some quite sophisticated uses of the technique. This is done with a (very proper!) emphasis on solving problems by means of some form of induction or other any of us who regularly teach the undergraduate course aimed at introducing mathematics majors to methods of proof quite simply need to own this book. In this boot camp course, it is imperative that problems should be abundant, both in supply and variety, and should be capable of careful dissection. Gunderson hit[s] the mark on both counts Gunderson "s discussions are evocative and thorough and can be appreciated by mathematicians of all sorts [he] develop[s] the requisite surrounding material with great care, considerably enhancing the value of his book as a supplementary text for a huge number of courses, both at an undergraduate and graduate level a very welcome addition to the literature "MAA Reviews, December 2010, ... a treasure trove for anyone who is ... interested in mathematics as a hobby, or as the target of proof automation or assistance. It could also be the basis for a crosscutting course in mathematics, based on seeing how one can apply a single proof technique across the field. -- Simon Thompson in Computing News, May 2011 Gunderson started out collecting some induction problems for discrete math students and then couldn't stop himself, thereafter assembling more than 750 of the addictive things for this handbook and supplementing them with a grounding in theory and discussion of applications. He offers 500-plus complete solutions, and many of the other problems come with hints or references; unlike other treatments, this handbook treats the subject seriously and is not just a 'collection of recipes'. It's a book that will work well with most math or computing science courses, on a subject that pertains to graph theory, point set topology, elementary number theory, linear algebra, analysis, probability theory, geometry, group theory, and game theory, among many other topics. --SciTech Book News, February 2011 ... a unique work ... the ostensibly narrow subject of mathematical induction is carefully and systematically expounded, from its more elementary aspects to some quite sophisticated uses of the technique. This is done with a (very proper!) emphasis on solving problems by means of some form of induction or other .y number theory, linear algebra, analysis, probability theory, geometry, group theory, and game theory, among many other topics. --SciTech Book News, February 2011 ... a unique work ... the ostensibly narrow subject of mathematical induction is carefully and systematically expounded, from its more elementary aspects to some quite sophisticated uses of the technique. This is done with a (very proper!) emphasis on solving problems by means of some form of induction or other ... any of us who regularly teach the undergraduate course aimed at introducing mathematics majors to methods of proof quite simply need to own this book. ... In this boot camp course, it is imperative that problems should be abundant, both in supply and variety, and should be capable of careful dissection. Gunderson hit[s] the mark on both counts ... Gunderson's discussions are evocative and thorough and can be appreciated by mathematicians of all sorts ... [he] develop[s] the requisite surrounding material with great care, considerably enhancing the value of his book as a supplementary text for a huge number of courses, both at an undergraduate and graduate level ... a very welcome addition to the literature ... --MAA Reviews, December 2010, Gunderson started out collecting some induction problems for discrete math students and then couldn't stop himself, thereafter assembling more than 750 of the addictive things for this handbook and supplementing them with a grounding in theory and discussion of applications. He offers 500-plus complete solutions, and many of the other problems come with hints or references; unlike other treatments, this handbook treats the subject seriously and is not just a e~collection of recipese(tm). Ite(tm)s a book that will work well with most math or computing science courses, on a subject that pertains to graph theory, point set topology, elementary number theory, linear algebra, analysis, probability theory, geometry, group theory, and game theory, among many other topics. e"SciTech Book News, February 2011 e a unique work e the ostensibly narrow subject of mathematical induction is carefully and systematically expounded, from its more elementary aspects to some quite sophisticated uses of the technique. This is done with a (very proper!) emphasis on solving problems by means of some form of induction or other e any of us who regularly teach the undergraduate course aimed at introducing mathematics majors to methods of proof quite simply need to own this book. e In this boot camp course, it is imperative that problems should be abundant, both in supply and variety, and should be capable of careful dissection. Gunderson hit[s] the mark on both counts e Gundersone(tm)s discussions are evocative and thorough and can be appreciated by mathematicians of all sorts e [he] develop[s] the requisite surrounding material with great care, considerably enhancing the value of his book as a supplementary text for a huge number of courses, both at an undergraduate and graduate level e a very welcome addition to the literature e e"MAA Reviews, December 2010, ... a treasure trove for anyone who is ... interested in mathematics as a hobby, or as the target of proof automation or assistance. It could also be the basis for a crosscutting course in mathematics, based on seeing how one can apply a single proof technique across the field. -- Simon Thompson in Computing News, May 2011 Gunderson started out collecting some induction problems for discrete math students and then couldn't stop himself, thereafter assembling more than 750 of the addictive things for this handbook and supplementing them with a grounding in theory and discussion of applications. He offers 500-plus complete solutions, and many of the other problems come with hints or references; unlike other treatments, this handbook treats the subject seriously and is not just a 'collection of recipes'. It's a book that will work well with most math or computing science courses, on a subject that pertains to graph theory, point set topology, elementary number theory, linear algebra, analysis, probability theory, geometry, group theory, and game theory, among many other topics. --SciTech Book News, February 2011 ... a unique work ... the ostensibly narrow subject of mathematical induction is carefully and systematically expounded, from its more elementary aspects to some quite sophisticated uses of the technique. This is done with a (very proper!) emphasis on solving problems by means of some form of induction or other ... any of us who regularly teach the undergraduate course aimed at introducing mathematics majors to methods of proof quite simply need to own this book. ... In this boot camp course, it is imperative that problems should be abundant, both in supply and variety, and should be capable of careful dissection. Gunderson hit[s] the mark on both counts ... Gunderson's discussions are evocative and thorough and can be appreciated by mathematicians of all sorts ... [he] develop[s] the requisite surrounding material with great care, considerably enhancing the value of his book as a supplementary text for a huge number of courses, both at an undergraduate and graduate level ... a very welcome addition to the literature ... --MAA Reviews, December 2010, Gunderson started out collecting some induction problems for discrete math students and then couldn't stop himself, thereafter assembling more than 750 of the addictive things for this handbook and supplementing them with a grounding in theory and discussion of applications. He offers 500-plus complete solutions, and many of the other problems come with hints or references; unlike other treatments, this handbook treats the subject seriously and is not just a 'collection of recipes'. It's a book that will work well with most math or computing science courses, on a subject that pertains to graph theory, point set topology, elementary number theory, linear algebra, analysis, probability theory, geometry, group theory, and game theory, among many other topics. -SciTech Book News, February 2011 … a unique work … the ostensibly narrow subject of mathematical induction is carefully and systematically expounded, from its more elementary aspects to some quite sophisticated uses of the technique. This is done with a (very proper!) emphasis on solving problems by means of some form of induction or other … any of us who regularly teach the undergraduate course aimed at introducing mathematics majors to methods of proof quite simply need to own this book. … In this boot camp course, it is imperative that problems should be abundant, both in supply and variety, and should be capable of careful dissection. Gunderson hit[s] the mark on both counts … Gunderson's discussions are evocative and thorough and can be appreciated by mathematicians of all sorts … [he] develop[s] the requisite surrounding material with great care, considerably enhancing the value of his book as a supplementary text for a huge number of courses, both at an undergraduate and graduate level … a very welcome addition to the literature … -MAA Reviews, December 2010, Gunderson started out collecting some induction problems for discrete math students and then couldn't stop himself, thereafter assembling more than 750 of the addictive things for this handbook and supplementing them with a grounding in theory and discussion of applications. He offers 500-plus complete solutions, and many of the other problems come with hints or references; unlike other treatments, this handbook treats the subject seriously and is not just a 'collection of recipes'. It's a book that will work well with most math or computing science courses, on a subject that pertains to graph theory, point set topology, elementary number theory, linear algebra, analysis, probability theory, geometry, group theory, and game theory, among many other topics. --SciTech Book News, February 2011 ... a unique work ... the ostensibly narrow subject of mathematical induction is carefully and systematically expounded, from its more elementary aspects to some quite sophisticated uses of the technique. This is done with a (very proper!) emphasis on solving problems by means of some form of induction or other ... any of us who regularly teach the undergraduate course aimed at introducing mathematics majors to methods of proof quite simply need to own this book. ... In this boot camp course, it is imperative that problems should be abundant, both in supply and variety, and should be capable of careful dissection. Gunderson hit[s] the mark on both counts ... Gunderson's discussions are evocative and thorough and can be appreciated by mathematicians of all sorts ... [he] develop[s] the requisite surrounding material with great care, considerably enhancing the value of his book as a supplementary text for a huge number of courses, both at an undergraduate and graduate level ... a very welcome addition to the literature ... --MAA Reviews, December 2010, Gunderson started out collecting some induction problems for discrete math students and then couldn't stop himself, thereafter assembling more than 750 of the addictive things for this handbook and supplementing them with a grounding in theory and discussion of applications. He offers 500-plus complete solutions, and many of the other problems come with hints or references; unlike other treatments, this handbook treats the subject seriously and is not just a 'e~collection of recipes'e(tm). It'e(tm)s a book that will work well with most math or computing science courses, on a subject that pertains to graph theory, point set topology, elementary number theory, linear algebra, analysis, probability theory, geometry, group theory, and game theory, among many other topics. 'e"SciTech Book News, February 2011 'e¦ a unique work 'e¦ the ostensibly narrow subject of mathematical induction is carefully and systematically expounded, from its more elementary aspects to some quite sophisticated uses of the technique. This is done with a (very proper!) emphasis on solving problems by means of some form of induction or other 'e¦ any of us who regularly teach the undergraduate course aimed at introducing mathematics majors to methods of proof quite simply need to own this book. 'e¦ In this boot camp course, it is imperative that problems should be abundant, both in supply and variety, and should be capable of careful dissection. Gunderson hit[s] the mark on both counts 'e¦ Gunderson'e(tm)s discussions are evocative and thorough and can be appreciated by mathematicians of all sorts 'e¦ [he] develop[s] the requisite surrounding material with great care, considerably enhancing the value of his book as a supplementary text for a huge number of courses, both at an undergraduate and graduate level 'e¦ a very welcome addition to the literature 'e¦ 'e"MAA Reviews, December 2010
Illustrated
Yes
Dewey Decimal
511
Table Of Content
THEORY What Is Mathematical Induction? Introduction An informal introduction to mathematical induction Ingredients of a proof by mathematical induction Two other ways to think of mathematical induction A simple example: dice Gauss and sums A variety of applications History of mathematical induction Mathematical induction in modern literature Foundations Notation Axioms Peano''s axioms Principle of mathematical induction Properties of natural numbers Well-ordered sets Well-founded sets Variants of Finite Mathematical Induction The first principle Strong mathematical induction Downward induction Alternative forms of mathematical induction Double induction Fermat''s method of infinite descent Structural induction Inductive Techniques Applied to the Infinite More on well-ordered sets Transfinite induction Cardinals Ordinals Axiom of choice and its equivalent forms Paradoxes and Sophisms from Induction Trouble with the language? Fuzzy definitions Missed a case? More deceit? Empirical Induction Introduction Guess the pattern? A pattern in primes? A sequence of integers? Sequences with only primes? Divisibility Never a square? Goldbach''s conjecture Cutting the cake Sums of hex numbers Factoring xn − 1 Goodstein sequences How to Prove by Induction Tips on proving by induction Proving more can be easier Proving limits by induction Which kind of induction is preferable? The Written MI Proof A template Improving the flow Using notation and abbreviations APPLICATIONS AND EXERCISES Identities Arithmetic progressions Sums of finite geometric series and related series Power sums, sums of a single power Products and sums of products Sums or products of fractions Identities with binomial coefficients Gaussian coefficients Trigonometry identities Miscellaneous identities Inequalities Number Theory Primes Congruences Divisibility Numbers expressible as sums Egyptian fractions Farey fractions Continued fractions Sequences Difference sequences Fibonacci numbers Lucas numbers Harmonic numbers Catalan numbers Schröder numbers Eulerian numbers Euler numbers Stirling numbers of the second kind Sets Properties of sets Posets and lattices Topology Ultrafilters Logic and Language Sentential logic Equational logic Well-formed formulae Language Graphs Graph theory basics Trees and forests Minimum spanning trees Connectivity, walks Matchings Stable marriages Graph coloring Planar graphs Extremal graph theory Digraphs and tournaments Geometric graphs Recursion and Algorithms Recursively defined operations Recursively defined sets Recursively defined sequences Loop invariants and algorithms Data structures Complexity Games and Recreations Introduction to game theory Tree games Tiling with dominoes and trominoes Dirty faces, cheating wives, muddy children, and colored hats Detecting a counterfeit coin More recreations Relations and Functions Binary relations Functions Calculus Polynomials Primitive recursive functions Ackermann''s function Linear and Abstract Algebra Matrices and linear equations Groups and permutations Rings Fields Vector spaces Geometry Convexity Polygons Lines, planes, regions, and polyhedra Finite geometries Ramsey Theory The Ramsey arrow Basic Ramsey theorems Parameter words and combinatorial spaces Shelah bound High chromatic number and large girth Probability and Statistics Probability basics Basic probability exercises Branching processes The ballot problem and the hitting game Pascal''s game Local lemma SOLUTIONS AND HINTS TO EXERCISES Foundations Empirical Induction Identities Inequalities Number Theory Sequences Sets Logic and Language Graphs Recursion and Algorithms Games and Recreation Relations and Functions Linear and Abstract Algebra Geometry Ramsey Theory Probability and Statistics APPENDICES ZFC Axiom System Inducing You to Laugh? The Greek Alphabet References Index
Synopsis
Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorn's lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs. The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process.
LC Classification Number
QA9.54.G86 2011
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
ThriftBooks
99,1% positive Bewertungen•20.0 Mio. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (5'834'440)
Dieser Artikel (1)
Alle Artikel (5'834'440)
- Automatische Bewertung von eBay- Bewertung vom Käufer.Letzter MonatBestellung pünktlich und problemlos geliefert
- eBay automated Feedback- Bewertung vom Käufer.Letzter MonatOrder delivered on time with no issues
- eBay automated Feedback- Bewertung vom Käufer.Letzter MonatOrder delivered on time with no issues
- eBay automated Feedback- Bewertung vom Käufer.Letzter MonatOrder delivered on time with no issues
ThriftBooks
99,1% positive Bewertungen•20.0 Mio. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (5'834'440)
Dieser Artikel (1)
Alle Artikel (5'834'440)
- Automatische Bewertung von eBay- Bewertung vom Käufer.Letzter MonatBestellung pünktlich und problemlos geliefert
- eBay automated Feedback- Bewertung vom Käufer.Letzter MonatOrder delivered on time with no issues
- eBay automated Feedback- Bewertung vom Käufer.Letzter MonatOrder delivered on time with no issues
- eBay automated Feedback- Bewertung vom Käufer.Letzter MonatOrder delivered on time with no issues