|
|
|
|
LEADER |
05072nam a2200817Ii 4500 |
001 |
10cc2fb1-0b6b-4741-9c11-1f15f0e64b4d |
005 |
20240926000000.0 |
008 |
150325s2015 sz a ob 001 0 eng d |
015 |
|
|
|a GBB8L7314
|2 bnb
|
016 |
7 |
|
|a 019128414
|2 Uk
|
019 |
|
|
|a 972002173
|
020 |
|
|
|a 3319162497
|q (print)
|
020 |
|
|
|a 3319162500
|q (electronic bk.)
|
020 |
|
|
|a 9783319162492
|q (print)
|
020 |
|
|
|a 9783319162508
|q (electronic bk.)
|
020 |
|
|
|z 9783319162492
|
024 |
7 |
|
|a 10.1007/978-3-319-16250-8
|2 doi
|
035 |
|
|
|a (OCoLC)905596430
|z (OCoLC)972002173
|z (OCoLC)1005831808
|z (OCoLC)1011902830
|z (OCoLC)1022051061
|z (OCoLC)1048175940
|z (OCoLC)1066575932
|z (OCoLC)1086530630
|z (OCoLC)1110994285
|z (OCoLC)1112570673
|
035 |
|
|
|a (OCoLC)905596430
|z (OCoLC)972002173
|
035 |
|
|
|a (Sirsi) a10807173
|
035 |
|
|
|a (Sirsi) spocn905596430
|
037 |
|
|
|a com.springer.onix.9783319162508
|b Springer Nature
|
040 |
|
|
|a GW5XE
|b eng
|e rda
|e pn
|c GW5XE
|d BTCTA
|d UPM
|d COO
|d YDXCP
|d OCLCF
|d OCLCQ
|d LVT
|d Z5A
|d FIE
|d ESU
|d OCLCQ
|d VT2
|d IOG
|d NJR
|d REB
|d U3W
|d OCLCQ
|d CEF
|d AU@
|d EBLCP
|d WYU
|d UKMGB
|d OL$
|d OCLCQ
|d DCT
|d ERF
|d OCLCQ
|d OCLCO
|d CSt
|
040 |
|
|
|a GW5XE
|b eng
|e rda
|e pn
|c GW5XE
|d BTCTA
|d UPM
|d COO
|d YDXCP
|d OCLCF
|d OCLCQ
|d LVT
|d Z5A
|
049 |
|
|
|a MAIN
|
050 |
|
4 |
|a QA9.54
|
072 |
|
7 |
|a MAT022000
|2 bisacsh
|
072 |
|
7 |
|a PBH
|2 bicssc
|
082 |
0 |
4 |
|a 511.3/6
|2 23
|
100 |
1 |
|
|a Joshi, Mark,
|e author
|
245 |
1 |
0 |
|a Proof patterns /
|c Mark Joshi
|
264 |
|
1 |
|a Cham :
|b Springer,
|c 2015
|
300 |
|
|
|a 1 online resource (xiii, 190 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|
347 |
|
|
|b PDF
|
504 |
|
|
|a Includes bibliographical references and index
|
505 |
0 |
|
|a Induction and complete induction -- Double Counting -- The pigeonhole principle -- Divisions -- Contrapositive and contradiction -- Intersection-enclosure and Generation -- Difference of invariants -- Linear dependence, fields and transcendence -- Formal equivalence -- Equivalence extension -- Proof by classification -- Specific-generality -- Diagonal tricks and cardinality -- Connectedness and the Jordan curve theorem -- The Euler characteristic and the classification of regular polyhedra -- Discharging -- The matching problem -- Games -- Analytical patterns -- Counterexamples
|
520 |
|
|
|a This innovative textbook introduces a new pattern-based approach to learning proof methods in the mathematical sciences. Readers will discover techniques that will enable them to learn new proofs across different areas of pure mathematics with ease. The patterns in proofs from diverse fields such as algebra, analysis, topology and number theory are explored. Specific topics examined include game theory, combinatorics, and Euclidean geometry, enabling a broad familiarity. The author, an experienced lecturer and researcher renowned for his innovative view and intuitive style, illuminates a wide range of techniques and examples from duplicating the cube to triangulating polygons to the infinitude of primes to the fundamental theorem of algebra. Intended as a companion for undergraduate students, this text is an essential addition to every aspiring mathematician?s toolkit
|
588 |
0 |
|
|a Online resource; title from PDF title page (SpringerLink, viewed March 25, 2015)
|
650 |
|
0 |
|a Number theory
|
650 |
|
0 |
|a Proof theory
|
650 |
|
7 |
|a Calculus & mathematical analysis
|2 bicssc
|
650 |
|
7 |
|a Combinatorics & graph theory
|2 bicssc
|
650 |
|
7 |
|a Education
|x Teaching Methods & Materials
|x Mathematics
|2 bisacsh
|
650 |
|
7 |
|a Geometry
|2 bicssc
|
650 |
|
7 |
|a Mathematics
|x Combinatorics
|2 bisacsh
|
650 |
|
7 |
|a Mathematics
|x Geometry
|x General
|2 bisacsh
|
650 |
|
7 |
|a Mathematics
|x Mathematical Analysis
|2 bisacsh
|
650 |
|
7 |
|a Mathematics
|x Number Theory
|2 bisacsh
|
650 |
|
7 |
|a Mathematics
|x Topology
|2 bisacsh
|
650 |
|
7 |
|a Number theory
|2 bicssc
|
650 |
|
7 |
|a Number theory
|2 fast
|
650 |
|
7 |
|a Proof theory
|2 fast
|
650 |
|
7 |
|a Teaching of a specific subject
|2 bicssc
|
650 |
|
7 |
|a Topology
|2 bicssc
|
650 |
1 |
4 |
|a Mathematics
|
650 |
2 |
4 |
|a Analysis
|
650 |
2 |
4 |
|a Combinatorics
|
650 |
2 |
4 |
|a Geometry
|
650 |
2 |
4 |
|a Number Theory
|
650 |
2 |
4 |
|a Topology
|
655 |
|
4 |
|a Electronic books
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319162492
|
830 |
|
0 |
|a Online access with purchase: Springer (t)
|
999 |
1 |
0 |
|i 10cc2fb1-0b6b-4741-9c11-1f15f0e64b4d
|l a10807173
|s US-CST
|m proof_patterns_____________________________________________________________2015_______sprina________________________________________joshi__mark________________________e
|
999 |
1 |
0 |
|i 10cc2fb1-0b6b-4741-9c11-1f15f0e64b4d
|l 11092568
|s US-ICU
|m proof_patterns_____________________________________________________________2015_______sprina________________________________________joshi__mark________________________e
|
999 |
1 |
1 |
|l a10807173
|s ISIL:US-CST
|t BKS
|b bac937c7-dfbb-5b4a-b080-0f1b1e57d482
|y bac937c7-dfbb-5b4a-b080-0f1b1e57d482
|p UNLOANABLE
|
999 |
1 |
1 |
|l a10807173
|s ISIL:US-CST
|t BKS
|a SUL-ELECTRONIC
|p UNLOANABLE
|