Handbook of mathematical induction : : theory and applications / / David S. Gunderson.

"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 mathe...

Full description

Saved in:
Bibliographic Details
Superior document:Discrete mathematics and its applications
VerfasserIn:
Place / Publishing House:Boca Raton ;, London ;, NewYork : : CRC Press, Taylor & Francis Group,, [2010]
2010
Year of Publication:2010
Language:English
Series:CRC Press series on discrete mathematics and its applications.
Online Access:
Physical Description:1 online resource (xxv, 893 pages) :; illustrations.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 5005379135
ctrlnum (MiAaPQ)5005379135
(Au-PeEL)EBL5379135
(CaPaEBR)ebr11554475
(OCoLC)1035519175
collection bib_alma
record_format marc
spelling Gunderson, David S., author.
Handbook of mathematical induction : theory and applications / David S. Gunderson.
Boca Raton ; London ; NewYork : CRC Press, Taylor & Francis Group, [2010]
2010
1 online resource (xxv, 893 pages) : illustrations.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Discrete mathematics and its applications
Includes bibliographical references and indexes.
What is mathematical induction? -- Foundations -- Variants of finite mathematical induction -- Inductive techniques applied to the infinite -- Paradoxes and sophisms from induction -- Empirical induction -- How to prove by induction -- The written MI proof -- Identities -- Inequalities -- Number theory -- Sequences -- Sets -- Logic and language -- Graphs -- Recursion and algorithms -- Games and recreations -- Relations and functions -- Linear and abstract algebra -- Geometry -- Ramsey theory -- Probability and statistics.
"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."--Publisher's description.
Description based on print version record.
Electronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
Proof theory.
Induction (Mathematics)
Logic, Symbolic and mathematical.
Probabilities.
Electronic books.
Print version: Handbook of mathematical induction : theory and applications. Boca Raton ; London : New York : CRC Press, Taylor & Francis Group, c2010 xxv, 893 pages 9781420093643 (DLC) 2010029756
ProQuest (Firm)
CRC Press series on discrete mathematics and its applications.
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=5379135 Click to View
language English
format eBook
author Gunderson, David S.,
spellingShingle Gunderson, David S.,
Handbook of mathematical induction : theory and applications /
Discrete mathematics and its applications
What is mathematical induction? -- Foundations -- Variants of finite mathematical induction -- Inductive techniques applied to the infinite -- Paradoxes and sophisms from induction -- Empirical induction -- How to prove by induction -- The written MI proof -- Identities -- Inequalities -- Number theory -- Sequences -- Sets -- Logic and language -- Graphs -- Recursion and algorithms -- Games and recreations -- Relations and functions -- Linear and abstract algebra -- Geometry -- Ramsey theory -- Probability and statistics.
author_facet Gunderson, David S.,
author_variant d s g ds dsg
author_role VerfasserIn
author_sort Gunderson, David S.,
title Handbook of mathematical induction : theory and applications /
title_sub theory and applications /
title_full Handbook of mathematical induction : theory and applications / David S. Gunderson.
title_fullStr Handbook of mathematical induction : theory and applications / David S. Gunderson.
title_full_unstemmed Handbook of mathematical induction : theory and applications / David S. Gunderson.
title_auth Handbook of mathematical induction : theory and applications /
title_new Handbook of mathematical induction :
title_sort handbook of mathematical induction : theory and applications /
series Discrete mathematics and its applications
series2 Discrete mathematics and its applications
publisher CRC Press, Taylor & Francis Group,
publishDate 2010
physical 1 online resource (xxv, 893 pages) : illustrations.
contents What is mathematical induction? -- Foundations -- Variants of finite mathematical induction -- Inductive techniques applied to the infinite -- Paradoxes and sophisms from induction -- Empirical induction -- How to prove by induction -- The written MI proof -- Identities -- Inequalities -- Number theory -- Sequences -- Sets -- Logic and language -- Graphs -- Recursion and algorithms -- Games and recreations -- Relations and functions -- Linear and abstract algebra -- Geometry -- Ramsey theory -- Probability and statistics.
isbn 9781420093650
9781420093643
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA9
callnumber-sort QA 19.54 G86 42011
genre Electronic books.
genre_facet Electronic books.
url https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=5379135
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 511 - General principles of mathematics
dewey-full 511.3/6
dewey-sort 3511.3 16
dewey-raw 511.3/6
dewey-search 511.3/6
oclc_num 1035519175
work_keys_str_mv AT gundersondavids handbookofmathematicalinductiontheoryandapplications
status_str n
ids_txt_mv (MiAaPQ)5005379135
(Au-PeEL)EBL5379135
(CaPaEBR)ebr11554475
(OCoLC)1035519175
carrierType_str_mv cr
hierarchy_parent_title Discrete mathematics and its applications
is_hierarchy_title Handbook of mathematical induction : theory and applications /
container_title Discrete mathematics and its applications
_version_ 1792330986499866625
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03896nam a2200481 i 4500</leader><controlfield tag="001">5005379135</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20200520144314.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">180523s2010 flua ob 001 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781420093643</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781420093650</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)5005379135</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL5379135</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr11554475</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1035519175</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.54</subfield><subfield code="b">.G86 2011</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/6</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gunderson, David S.,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Handbook of mathematical induction :</subfield><subfield code="b">theory and applications /</subfield><subfield code="c">David S. Gunderson.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton ;</subfield><subfield code="a">London ;</subfield><subfield code="a">NewYork :</subfield><subfield code="b">CRC Press, Taylor &amp; Francis Group,</subfield><subfield code="c">[2010]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xxv, 893 pages) :</subfield><subfield code="b">illustrations.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Discrete mathematics and its applications</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">What is mathematical induction? -- Foundations -- Variants of finite mathematical induction -- Inductive techniques applied to the infinite -- Paradoxes and sophisms from induction -- Empirical induction -- How to prove by induction -- The written MI proof -- Identities -- Inequalities -- Number theory -- Sequences -- Sets -- Logic and language -- Graphs -- Recursion and algorithms -- Games and recreations -- Relations and functions -- Linear and abstract algebra -- Geometry -- Ramsey theory -- Probability and statistics.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"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."--Publisher's description.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on print version record.</subfield></datafield><datafield tag="590" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Proof theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Induction (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Logic, Symbolic and mathematical.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Probabilities.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Handbook of mathematical induction : theory and applications.</subfield><subfield code="d">Boca Raton ; London : New York : CRC Press, Taylor &amp; Francis Group, c2010 </subfield><subfield code="h">xxv, 893 pages </subfield><subfield code="z">9781420093643 </subfield><subfield code="w">(DLC) 2010029756</subfield></datafield><datafield tag="797" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">CRC Press series on discrete mathematics and its applications.</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=5379135</subfield><subfield code="z">Click to View</subfield></datafield></record></collection>